./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-lit/qw2004-2b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-lit/qw2004-2b.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f17f6182d2330561fe6717b6a061d0dded698483f9e32b37a3b36e1144855a29 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:33:36,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:33:36,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:33:36,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:33:36,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:33:36,275 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:33:36,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:33:36,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:33:36,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:33:36,277 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:33:36,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:33:36,278 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:33:36,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:33:36,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:33:36,279 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:33:36,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:33:36,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:33:36,280 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:33:36,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:33:36,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:33:36,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:33:36,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:33:36,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:33:36,282 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:33:36,283 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:33:36,283 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:33:36,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:33:36,283 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:33:36,284 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:33:36,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:33:36,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:33:36,285 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:33:36,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:33:36,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:33:36,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:33:36,290 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:33:36,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:33:36,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:33:36,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:33:36,291 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:33:36,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:33:36,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:33:36,292 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f17f6182d2330561fe6717b6a061d0dded698483f9e32b37a3b36e1144855a29 [2024-11-09 02:33:36,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:33:36,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:33:36,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:33:36,615 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:33:36,615 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:33:36,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/qw2004-2b.i [2024-11-09 02:33:38,122 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:33:38,432 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:33:38,433 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/qw2004-2b.i [2024-11-09 02:33:38,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2610ed8/cbaa40b41b5346429b725a2490f6ed05/FLAGefe8f40ad [2024-11-09 02:33:38,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2610ed8/cbaa40b41b5346429b725a2490f6ed05 [2024-11-09 02:33:38,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:33:38,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:33:38,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:33:38,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:33:38,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:33:38,737 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:33:38" (1/1) ... [2024-11-09 02:33:38,738 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c95c8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:38, skipping insertion in model container [2024-11-09 02:33:38,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:33:38" (1/1) ... [2024-11-09 02:33:38,792 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:33:39,104 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/qw2004-2b.i[30003,30016] [2024-11-09 02:33:39,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:33:39,137 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:33:39,192 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/qw2004-2b.i[30003,30016] [2024-11-09 02:33:39,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:33:39,252 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:33:39,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:39 WrapperNode [2024-11-09 02:33:39,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:33:39,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:33:39,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:33:39,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:33:39,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:39" (1/1) ... [2024-11-09 02:33:39,281 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:39" (1/1) ... [2024-11-09 02:33:39,309 INFO L138 Inliner]: procedures = 174, calls = 32, calls flagged for inlining = 9, calls inlined = 10, statements flattened = 114 [2024-11-09 02:33:39,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:33:39,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:33:39,313 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:33:39,313 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:33:39,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:39" (1/1) ... [2024-11-09 02:33:39,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:39" (1/1) ... [2024-11-09 02:33:39,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:39" (1/1) ... [2024-11-09 02:33:39,353 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-09 02:33:39,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:39" (1/1) ... [2024-11-09 02:33:39,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:39" (1/1) ... [2024-11-09 02:33:39,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:39" (1/1) ... [2024-11-09 02:33:39,364 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:39" (1/1) ... [2024-11-09 02:33:39,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:39" (1/1) ... [2024-11-09 02:33:39,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:39" (1/1) ... [2024-11-09 02:33:39,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:33:39,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:33:39,381 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:33:39,381 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:33:39,382 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:39" (1/1) ... [2024-11-09 02:33:39,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:33:39,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:33:39,419 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:33:39,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:33:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure BCSP_PnpStop [2024-11-09 02:33:39,475 INFO L138 BoogieDeclarations]: Found implementation of procedure BCSP_PnpStop [2024-11-09 02:33:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 02:33:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:33:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 02:33:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 02:33:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:33:39,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:33:39,478 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 02:33:39,652 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:33:39,653 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:33:39,858 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 02:33:39,858 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:33:39,978 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:33:39,978 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 02:33:39,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:33:39 BoogieIcfgContainer [2024-11-09 02:33:39,979 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:33:39,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:33:39,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:33:39,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:33:39,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:33:38" (1/3) ... [2024-11-09 02:33:39,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69531cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:33:39, skipping insertion in model container [2024-11-09 02:33:39,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:39" (2/3) ... [2024-11-09 02:33:39,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69531cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:33:39, skipping insertion in model container [2024-11-09 02:33:39,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:33:39" (3/3) ... [2024-11-09 02:33:39,990 INFO L112 eAbstractionObserver]: Analyzing ICFG qw2004-2b.i [2024-11-09 02:33:40,008 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:33:40,009 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:33:40,009 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 02:33:40,051 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 02:33:40,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 40 transitions, 84 flow [2024-11-09 02:33:40,123 INFO L124 PetriNetUnfolderBase]: 5/39 cut-off events. [2024-11-09 02:33:40,124 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 02:33:40,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 39 events. 5/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-11-09 02:33:40,131 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 40 transitions, 84 flow [2024-11-09 02:33:40,134 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 39 transitions, 81 flow [2024-11-09 02:33:40,155 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:33:40,164 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;@65f60db9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:33:40,165 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 02:33:40,181 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 02:33:40,182 INFO L124 PetriNetUnfolderBase]: 4/32 cut-off events. [2024-11-09 02:33:40,182 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 02:33:40,182 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:33:40,183 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:33:40,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:33:40,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:33:40,190 INFO L85 PathProgramCache]: Analyzing trace with hash -2140786468, now seen corresponding path program 1 times [2024-11-09 02:33:40,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:33:40,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184132793] [2024-11-09 02:33:40,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:33:40,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:33:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:33:40,486 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-09 02:33:40,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:33:40,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184132793] [2024-11-09 02:33:40,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184132793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:33:40,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:33:40,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:33:40,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073074738] [2024-11-09 02:33:40,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:33:40,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:33:40,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:33:40,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:33:40,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:33:40,542 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 40 [2024-11-09 02:33:40,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 39 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:33:40,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:33:40,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 40 [2024-11-09 02:33:40,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:33:40,752 INFO L124 PetriNetUnfolderBase]: 96/278 cut-off events. [2024-11-09 02:33:40,754 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 02:33:40,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 278 events. 96/278 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1388 event pairs, 45 based on Foata normal form. 12/262 useless extension candidates. Maximal degree in co-relation 452. Up to 113 conditions per place. [2024-11-09 02:33:40,761 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 27 selfloop transitions, 3 changer transitions 3/53 dead transitions. [2024-11-09 02:33:40,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 175 flow [2024-11-09 02:33:40,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:33:40,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 02:33:40,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2024-11-09 02:33:40,776 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.74375 [2024-11-09 02:33:40,778 INFO L175 Difference]: Start difference. First operand has 38 places, 39 transitions, 81 flow. Second operand 4 states and 119 transitions. [2024-11-09 02:33:40,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 175 flow [2024-11-09 02:33:40,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 174 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:33:40,786 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 99 flow [2024-11-09 02:33:40,789 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2024-11-09 02:33:40,793 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2024-11-09 02:33:40,795 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 99 flow [2024-11-09 02:33:40,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:33:40,797 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:33:40,797 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:33:40,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:33:40,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:33:40,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:33:40,799 INFO L85 PathProgramCache]: Analyzing trace with hash -44288212, now seen corresponding path program 1 times [2024-11-09 02:33:40,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:33:40,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679897560] [2024-11-09 02:33:40,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:33:40,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:33:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:33:40,991 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-09 02:33:40,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:33:40,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679897560] [2024-11-09 02:33:40,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679897560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:33:40,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:33:40,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:33:40,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107595662] [2024-11-09 02:33:40,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:33:40,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:33:40,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:33:40,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:33:40,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:33:41,010 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 40 [2024-11-09 02:33:41,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:33:41,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:33:41,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 40 [2024-11-09 02:33:41,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:33:41,213 INFO L124 PetriNetUnfolderBase]: 124/322 cut-off events. [2024-11-09 02:33:41,214 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-11-09 02:33:41,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 322 events. 124/322 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1544 event pairs, 55 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 610. Up to 128 conditions per place. [2024-11-09 02:33:41,218 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 27 selfloop transitions, 5 changer transitions 21/70 dead transitions. [2024-11-09 02:33:41,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 70 transitions, 280 flow [2024-11-09 02:33:41,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:33:41,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 02:33:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-11-09 02:33:41,223 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.609375 [2024-11-09 02:33:41,223 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 99 flow. Second operand 8 states and 195 transitions. [2024-11-09 02:33:41,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 70 transitions, 280 flow [2024-11-09 02:33:41,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 70 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:33:41,227 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 122 flow [2024-11-09 02:33:41,228 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=122, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2024-11-09 02:33:41,228 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2024-11-09 02:33:41,229 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 122 flow [2024-11-09 02:33:41,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:33:41,229 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:33:41,229 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-09 02:33:41,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:33:41,230 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:33:41,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:33:41,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1094475718, now seen corresponding path program 1 times [2024-11-09 02:33:41,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:33:41,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941516142] [2024-11-09 02:33:41,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:33:41,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:33:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:33:41,326 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-09 02:33:41,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:33:41,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941516142] [2024-11-09 02:33:41,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941516142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:33:41,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:33:41,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:33:41,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861960018] [2024-11-09 02:33:41,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:33:41,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:33:41,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:33:41,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:33:41,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:33:41,335 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40 [2024-11-09 02:33:41,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-09 02:33:41,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:33:41,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40 [2024-11-09 02:33:41,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:33:41,457 INFO L124 PetriNetUnfolderBase]: 89/266 cut-off events. [2024-11-09 02:33:41,457 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-11-09 02:33:41,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 266 events. 89/266 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1201 event pairs, 35 based on Foata normal form. 6/255 useless extension candidates. Maximal degree in co-relation 534. Up to 138 conditions per place. [2024-11-09 02:33:41,463 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 29 selfloop transitions, 1 changer transitions 9/58 dead transitions. [2024-11-09 02:33:41,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 252 flow [2024-11-09 02:33:41,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:33:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 02:33:41,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2024-11-09 02:33:41,465 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.71875 [2024-11-09 02:33:41,465 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 122 flow. Second operand 4 states and 115 transitions. [2024-11-09 02:33:41,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 252 flow [2024-11-09 02:33:41,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 236 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-09 02:33:41,472 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 117 flow [2024-11-09 02:33:41,474 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2024-11-09 02:33:41,474 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2024-11-09 02:33:41,475 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 117 flow [2024-11-09 02:33:41,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-09 02:33:41,475 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:33:41,476 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-09 02:33:41,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:33:41,477 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:33:41,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:33:41,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1668404468, now seen corresponding path program 2 times [2024-11-09 02:33:41,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:33:41,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923528783] [2024-11-09 02:33:41,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:33:41,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:33:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:33:41,568 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-09 02:33:41,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:33:41,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923528783] [2024-11-09 02:33:41,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923528783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:33:41,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:33:41,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:33:41,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519453541] [2024-11-09 02:33:41,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:33:41,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:33:41,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:33:41,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:33:41,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:33:41,579 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40 [2024-11-09 02:33:41,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:33:41,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:33:41,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40 [2024-11-09 02:33:41,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:33:41,689 INFO L124 PetriNetUnfolderBase]: 100/291 cut-off events. [2024-11-09 02:33:41,689 INFO L125 PetriNetUnfolderBase]: For 59/62 co-relation queries the response was YES. [2024-11-09 02:33:41,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 291 events. 100/291 cut-off events. For 59/62 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1393 event pairs, 30 based on Foata normal form. 17/290 useless extension candidates. Maximal degree in co-relation 580. Up to 121 conditions per place. [2024-11-09 02:33:41,691 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 15 selfloop transitions, 2 changer transitions 34/68 dead transitions. [2024-11-09 02:33:41,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 291 flow [2024-11-09 02:33:41,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:33:41,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 02:33:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2024-11-09 02:33:41,695 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.725 [2024-11-09 02:33:41,695 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 117 flow. Second operand 5 states and 145 transitions. [2024-11-09 02:33:41,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 291 flow [2024-11-09 02:33:41,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 68 transitions, 288 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 02:33:41,699 INFO L231 Difference]: Finished difference. Result has 54 places, 32 transitions, 108 flow [2024-11-09 02:33:41,701 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=54, PETRI_TRANSITIONS=32} [2024-11-09 02:33:41,702 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2024-11-09 02:33:41,702 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 32 transitions, 108 flow [2024-11-09 02:33:41,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:33:41,702 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:33:41,703 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, 1] [2024-11-09 02:33:41,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:33:41,704 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:33:41,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:33:41,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1208220253, now seen corresponding path program 1 times [2024-11-09 02:33:41,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:33:41,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195801016] [2024-11-09 02:33:41,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:33:41,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:33:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:33:41,840 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-09 02:33:41,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:33:41,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195801016] [2024-11-09 02:33:41,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195801016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:33:41,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:33:41,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:33:41,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730884428] [2024-11-09 02:33:41,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:33:41,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:33:41,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:33:41,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:33:41,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:33:41,861 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 40 [2024-11-09 02:33:41,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 32 transitions, 108 flow. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:33:41,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:33:41,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 40 [2024-11-09 02:33:41,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:33:42,058 INFO L124 PetriNetUnfolderBase]: 92/307 cut-off events. [2024-11-09 02:33:42,058 INFO L125 PetriNetUnfolderBase]: For 99/101 co-relation queries the response was YES. [2024-11-09 02:33:42,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 307 events. 92/307 cut-off events. For 99/101 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1615 event pairs, 28 based on Foata normal form. 7/298 useless extension candidates. Maximal degree in co-relation 678. Up to 106 conditions per place. [2024-11-09 02:33:42,063 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 35 selfloop transitions, 6 changer transitions 19/75 dead transitions. [2024-11-09 02:33:42,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 352 flow [2024-11-09 02:33:42,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 02:33:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 02:33:42,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 258 transitions. [2024-11-09 02:33:42,067 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5863636363636363 [2024-11-09 02:33:42,067 INFO L175 Difference]: Start difference. First operand has 54 places, 32 transitions, 108 flow. Second operand 11 states and 258 transitions. [2024-11-09 02:33:42,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 352 flow [2024-11-09 02:33:42,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 75 transitions, 324 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-11-09 02:33:42,073 INFO L231 Difference]: Finished difference. Result has 58 places, 36 transitions, 153 flow [2024-11-09 02:33:42,074 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=153, PETRI_PLACES=58, PETRI_TRANSITIONS=36} [2024-11-09 02:33:42,075 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2024-11-09 02:33:42,076 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 36 transitions, 153 flow [2024-11-09 02:33:42,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:33:42,077 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:33:42,077 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, 1] [2024-11-09 02:33:42,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:33:42,077 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:33:42,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:33:42,078 INFO L85 PathProgramCache]: Analyzing trace with hash 291242283, now seen corresponding path program 2 times [2024-11-09 02:33:42,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:33:42,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429054849] [2024-11-09 02:33:42,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:33:42,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:33:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:33:42,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:33:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:33:42,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:33:42,142 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:33:42,144 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-09 02:33:42,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2024-11-09 02:33:42,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:33:42,147 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2024-11-09 02:33:42,203 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 02:33:42,203 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 02:33:42,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:33:42 BasicIcfg [2024-11-09 02:33:42,209 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 02:33:42,210 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 02:33:42,210 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 02:33:42,210 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 02:33:42,211 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:33:39" (3/4) ... [2024-11-09 02:33:42,212 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 02:33:42,280 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 02:33:42,280 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 02:33:42,281 INFO L158 Benchmark]: Toolchain (without parser) took 3553.06ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 128.4MB in the beginning and 134.8MB in the end (delta: -6.4MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2024-11-09 02:33:42,281 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:33:42,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.68ms. Allocated memory is still 159.4MB. Free memory was 127.9MB in the beginning and 105.9MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 02:33:42,282 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.51ms. Allocated memory is still 159.4MB. Free memory was 105.9MB in the beginning and 103.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 02:33:42,286 INFO L158 Benchmark]: Boogie Preprocessor took 64.01ms. Allocated memory is still 159.4MB. Free memory was 103.8MB in the beginning and 101.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 02:33:42,287 INFO L158 Benchmark]: RCFGBuilder took 602.06ms. Allocated memory is still 159.4MB. Free memory was 100.6MB in the beginning and 111.3MB in the end (delta: -10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 02:33:42,287 INFO L158 Benchmark]: TraceAbstraction took 2228.22ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 110.3MB in the beginning and 139.0MB in the end (delta: -28.7MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-11-09 02:33:42,287 INFO L158 Benchmark]: Witness Printer took 70.70ms. Allocated memory is still 192.9MB. Free memory was 139.0MB in the beginning and 134.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:33:42,292 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 524.68ms. Allocated memory is still 159.4MB. Free memory was 127.9MB in the beginning and 105.9MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.51ms. Allocated memory is still 159.4MB. Free memory was 105.9MB in the beginning and 103.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.01ms. Allocated memory is still 159.4MB. Free memory was 103.8MB in the beginning and 101.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 602.06ms. Allocated memory is still 159.4MB. Free memory was 100.6MB in the beginning and 111.3MB in the end (delta: -10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2228.22ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 110.3MB in the beginning and 139.0MB in the end (delta: -28.7MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * Witness Printer took 70.70ms. Allocated memory is still 192.9MB. Free memory was 139.0MB in the beginning and 134.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 690]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L697] 0 volatile int stoppingFlag; [L698] 0 volatile int pendingIo; [L699] 0 volatile int stoppingEvent; [L700] 0 volatile int stopped; [L756] 0 pthread_t t; [L757] 0 pendingIo = 1 [L758] 0 stoppingFlag = 0 [L759] 0 stoppingEvent = 0 [L760] 0 stopped = 0 [L761] FCALL, FORK 0 pthread_create(&t, 0, BCSP_PnpStop, 0) VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t=-1] [L762] CALL 0 BCSP_PnpAdd(0) [L734] 0 int status; [L735] CALL, EXPR 0 BCSP_IoIncrement() [L703] 0 int lsf = stoppingFlag; VAL [lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L745] 1 stoppingFlag = 1 VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L747] CALL 1 BCSP_IoDecrement() [L725] 1 int pending; [L726] CALL, EXPR 1 dec() [L705] COND FALSE 0 !(\read(lsf)) VAL [lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L709] 0 int lp = pendingIo; VAL [lp=1, lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L719] 1 pendingIo-- [L720] 1 int tmp = pendingIo; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1, tmp=0] [L722] 1 return tmp; [L726] RET, EXPR 1 dec() [L726] 1 pending = dec() [L727] COND TRUE 1 pending == 0 VAL [pending=0, pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1] [L729] 1 stoppingEvent = 1 VAL [pending=0, pendingIo=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L747] RET 1 BCSP_IoDecrement() [L749] 1 int lse = stoppingEvent; VAL [\old(arg)={0:0}, arg={0:0}, lse=1, pendingIo=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L751] CALL 1 assume_abort_if_not(lse) [L686] COND FALSE 1 !(!cond) [L751] RET 1 assume_abort_if_not(lse) [L712] 0 pendingIo = lp + 1 VAL [lp=1, lsf=0, pendingIo=2, stopped=0, stoppingEvent=1, stoppingFlag=1] [L715] 0 return 0; VAL [\result=0, lsf=0, pendingIo=2, stopped=0, stoppingEvent=1, stoppingFlag=1] [L735] RET, EXPR 0 BCSP_IoIncrement() [L735] 0 status = BCSP_IoIncrement() [L736] COND TRUE 0 status == 0 VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=2, status=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L752] 1 stopped = 1 VAL [\old(arg)={0:0}, arg={0:0}, lse=1, pendingIo=2, stopped=1, stoppingEvent=1, stoppingFlag=1] [L737] 0 int local_assertion = !stopped; VAL [\old(arg)={0:0}, arg={0:0}, local_assertion=0, pendingIo=2, status=0, stopped=1, stoppingEvent=1, stoppingFlag=1] [L738] CALL 0 __VERIFIER_assert(local_assertion) [L689] COND TRUE 0 !(cond) VAL [\old(cond)=0, cond=0, pendingIo=2, stopped=1, stoppingEvent=1, stoppingFlag=1] [L690] 0 reach_error() VAL [\old(cond)=0, cond=0, pendingIo=2, stopped=1, stoppingEvent=1, stoppingFlag=1] - UnprovableResult [Line: 761]: 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 3 procedures, 50 locations, 2 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: 2.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 154 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 500 IncrementalHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 19 mSDtfsCounter, 500 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=5, InterpolantAutomatonStates: 32, 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.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 197 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-09 02:33:42,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE