./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/stateful_check.c --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/ldv-regression/stateful_check.c -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 86e7865b5c88aae342720e4dde014f366638a0b48b0e0f6e55acb2c675bcac3e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:48:20,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:48:20,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:48:20,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:48:20,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:48:20,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:48:20,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:48:20,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:48:20,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:48:20,788 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:48:20,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:48:20,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:48:20,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:48:20,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:48:20,789 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:48:20,790 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:48:20,790 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:48:20,790 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:48:20,790 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:48:20,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:48:20,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:48:20,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:48:20,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:48:20,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:48:20,793 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:48:20,793 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:48:20,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:48:20,794 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:48:20,794 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:48:20,794 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:48:20,794 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:48:20,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:48:20,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:48:20,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:48:20,795 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:48:20,795 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:48:20,795 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:48:20,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:48:20,795 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:48:20,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:48:20,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:48:20,797 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:48:20,797 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 -> 86e7865b5c88aae342720e4dde014f366638a0b48b0e0f6e55acb2c675bcac3e [2024-11-08 13:48:20,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:48:21,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:48:21,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:48:21,014 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:48:21,014 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:48:21,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/stateful_check.c [2024-11-08 13:48:22,395 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:48:22,566 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:48:22,566 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/stateful_check.c [2024-11-08 13:48:22,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5de7e6c3a/0b3da047198a407f8c6d9656a14cc29e/FLAGffe234cb1 [2024-11-08 13:48:22,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5de7e6c3a/0b3da047198a407f8c6d9656a14cc29e [2024-11-08 13:48:22,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:48:22,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:48:22,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:48:22,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:48:22,599 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:48:22,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:48:22" (1/1) ... [2024-11-08 13:48:22,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@704f2092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:48:22, skipping insertion in model container [2024-11-08 13:48:22,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:48:22" (1/1) ... [2024-11-08 13:48:22,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:48:22,754 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/ldv-regression/stateful_check.c[298,311] [2024-11-08 13:48:22,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:48:22,787 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:48:22,795 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/ldv-regression/stateful_check.c[298,311] [2024-11-08 13:48:22,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:48:22,812 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:48:22,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:48:22 WrapperNode [2024-11-08 13:48:22,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:48:22,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:48:22,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:48:22,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:48:22,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:48:22" (1/1) ... [2024-11-08 13:48:22,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:48:22" (1/1) ... [2024-11-08 13:48:22,838 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 104 [2024-11-08 13:48:22,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:48:22,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:48:22,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:48:22,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:48:22,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:48:22" (1/1) ... [2024-11-08 13:48:22,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:48:22" (1/1) ... [2024-11-08 13:48:22,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:48:22" (1/1) ... [2024-11-08 13:48:22,856 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-08 13:48:22,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:48:22" (1/1) ... [2024-11-08 13:48:22,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:48:22" (1/1) ... [2024-11-08 13:48:22,859 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:48:22" (1/1) ... [2024-11-08 13:48:22,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:48:22" (1/1) ... [2024-11-08 13:48:22,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:48:22" (1/1) ... [2024-11-08 13:48:22,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:48:22" (1/1) ... [2024-11-08 13:48:22,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:48:22,865 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:48:22,865 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:48:22,865 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:48:22,866 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:48:22" (1/1) ... [2024-11-08 13:48:22,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:48:22,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:48:22,896 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-08 13:48:22,898 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-08 13:48:22,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:48:22,930 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2024-11-08 13:48:22,930 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2024-11-08 13:48:22,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:48:22,930 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2024-11-08 13:48:22,930 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2024-11-08 13:48:22,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:48:22,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:48:22,978 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:48:22,979 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:48:23,119 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-08 13:48:23,119 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:48:23,129 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:48:23,129 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 13:48:23,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:48:23 BoogieIcfgContainer [2024-11-08 13:48:23,129 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:48:23,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:48:23,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:48:23,133 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:48:23,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:48:22" (1/3) ... [2024-11-08 13:48:23,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b652e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:48:23, skipping insertion in model container [2024-11-08 13:48:23,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:48:22" (2/3) ... [2024-11-08 13:48:23,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b652e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:48:23, skipping insertion in model container [2024-11-08 13:48:23,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:48:23" (3/3) ... [2024-11-08 13:48:23,161 INFO L112 eAbstractionObserver]: Analyzing ICFG stateful_check.c [2024-11-08 13:48:23,186 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:48:23,190 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:48:23,249 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:48:23,254 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;@6aaa01c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:48:23,254 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:48:23,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 41 states have internal predecessors, (53), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 13:48:23,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 13:48:23,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:48:23,264 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:48:23,265 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:48:23,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:48:23,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2032519849, now seen corresponding path program 1 times [2024-11-08 13:48:23,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:48:23,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190147786] [2024-11-08 13:48:23,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:48:23,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:48:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:48:23,377 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-08 13:48:23,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:48:23,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190147786] [2024-11-08 13:48:23,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190147786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:48:23,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:48:23,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 13:48:23,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181830189] [2024-11-08 13:48:23,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:48:23,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 13:48:23,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:48:23,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 13:48:23,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 13:48:23,405 INFO L87 Difference]: Start difference. First operand has 46 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 41 states have internal predecessors, (53), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:48:23,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:48:23,424 INFO L93 Difference]: Finished difference Result 87 states and 129 transitions. [2024-11-08 13:48:23,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 13:48:23,425 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-08 13:48:23,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:48:23,430 INFO L225 Difference]: With dead ends: 87 [2024-11-08 13:48:23,430 INFO L226 Difference]: Without dead ends: 40 [2024-11-08 13:48:23,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 13:48:23,435 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:48:23,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:48:23,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-08 13:48:23,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-08 13:48:23,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.4375) internal successors, (46), 35 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 13:48:23,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2024-11-08 13:48:23,460 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 8 [2024-11-08 13:48:23,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:48:23,461 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2024-11-08 13:48:23,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:48:23,461 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2024-11-08 13:48:23,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 13:48:23,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:48:23,462 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:48:23,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:48:23,462 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:48:23,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:48:23,463 INFO L85 PathProgramCache]: Analyzing trace with hash 160489557, now seen corresponding path program 1 times [2024-11-08 13:48:23,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:48:23,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884905912] [2024-11-08 13:48:23,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:48:23,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:48:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:48:23,501 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-08 13:48:23,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:48:23,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884905912] [2024-11-08 13:48:23,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884905912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:48:23,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:48:23,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 13:48:23,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072682067] [2024-11-08 13:48:23,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:48:23,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:48:23,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:48:23,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:48:23,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:48:23,505 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:48:23,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:48:23,528 INFO L93 Difference]: Finished difference Result 68 states and 97 transitions. [2024-11-08 13:48:23,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:48:23,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-08 13:48:23,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:48:23,530 INFO L225 Difference]: With dead ends: 68 [2024-11-08 13:48:23,531 INFO L226 Difference]: Without dead ends: 62 [2024-11-08 13:48:23,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:48:23,532 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 33 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:48:23,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 98 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:48:23,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-08 13:48:23,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-08 13:48:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 55 states have internal predecessors, (77), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 13:48:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 90 transitions. [2024-11-08 13:48:23,539 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 90 transitions. Word has length 9 [2024-11-08 13:48:23,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:48:23,540 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 90 transitions. [2024-11-08 13:48:23,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:48:23,540 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 90 transitions. [2024-11-08 13:48:23,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 13:48:23,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:48:23,541 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:48:23,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:48:23,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:48:23,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:48:23,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1852157628, now seen corresponding path program 1 times [2024-11-08 13:48:23,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:48:23,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282597695] [2024-11-08 13:48:23,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:48:23,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:48:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:48:23,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 13:48:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:48:23,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:48:23,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:48:23,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282597695] [2024-11-08 13:48:23,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282597695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:48:23,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:48:23,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:48:23,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582763007] [2024-11-08 13:48:23,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:48:23,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:48:23,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:48:23,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:48:23,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:48:23,611 INFO L87 Difference]: Start difference. First operand 62 states and 90 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:48:23,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:48:23,666 INFO L93 Difference]: Finished difference Result 148 states and 223 transitions. [2024-11-08 13:48:23,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:48:23,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-08 13:48:23,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:48:23,668 INFO L225 Difference]: With dead ends: 148 [2024-11-08 13:48:23,668 INFO L226 Difference]: Without dead ends: 89 [2024-11-08 13:48:23,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:48:23,669 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 19 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:48:23,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 118 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:48:23,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-08 13:48:23,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2024-11-08 13:48:23,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 79 states have internal predecessors, (112), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 13:48:23,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 125 transitions. [2024-11-08 13:48:23,679 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 125 transitions. Word has length 20 [2024-11-08 13:48:23,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:48:23,679 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 125 transitions. [2024-11-08 13:48:23,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:48:23,679 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 125 transitions. [2024-11-08 13:48:23,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 13:48:23,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:48:23,680 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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-08 13:48:23,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 13:48:23,680 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:48:23,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:48:23,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1007794771, now seen corresponding path program 1 times [2024-11-08 13:48:23,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:48:23,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622595199] [2024-11-08 13:48:23,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:48:23,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:48:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:48:23,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 13:48:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:48:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:48:23,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:48:23,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622595199] [2024-11-08 13:48:23,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622595199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:48:23,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196820663] [2024-11-08 13:48:23,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:48:23,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:48:23,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:48:23,790 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:48:23,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 13:48:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:48:23,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 13:48:23,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:48:23,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:48:23,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:48:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:48:23,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196820663] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:48:23,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:48:23,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2024-11-08 13:48:23,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551927481] [2024-11-08 13:48:23,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:48:23,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 13:48:23,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:48:23,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 13:48:23,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 13:48:23,949 INFO L87 Difference]: Start difference. First operand 86 states and 125 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 13:48:24,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:48:24,056 INFO L93 Difference]: Finished difference Result 253 states and 388 transitions. [2024-11-08 13:48:24,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 13:48:24,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-11-08 13:48:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:48:24,058 INFO L225 Difference]: With dead ends: 253 [2024-11-08 13:48:24,058 INFO L226 Difference]: Without dead ends: 170 [2024-11-08 13:48:24,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 13:48:24,059 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 61 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:48:24,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 232 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:48:24,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-08 13:48:24,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 158. [2024-11-08 13:48:24,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 148 states have (on average 1.5472972972972974) internal successors, (229), 151 states have internal predecessors, (229), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 13:48:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 242 transitions. [2024-11-08 13:48:24,079 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 242 transitions. Word has length 27 [2024-11-08 13:48:24,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:48:24,079 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 242 transitions. [2024-11-08 13:48:24,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 13:48:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 242 transitions. [2024-11-08 13:48:24,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 13:48:24,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:48:24,081 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:48:24,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 13:48:24,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:48:24,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:48:24,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:48:24,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1977818999, now seen corresponding path program 1 times [2024-11-08 13:48:24,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:48:24,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604541353] [2024-11-08 13:48:24,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:48:24,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:48:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 13:48:24,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 13:48:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 13:48:24,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 13:48:24,328 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 13:48:24,330 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 13:48:24,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 13:48:24,333 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-08 13:48:24,359 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 13:48:24,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 01:48:24 BoogieIcfgContainer [2024-11-08 13:48:24,361 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 13:48:24,361 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 13:48:24,362 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 13:48:24,362 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 13:48:24,362 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:48:23" (3/4) ... [2024-11-08 13:48:24,363 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 13:48:24,417 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 13:48:24,418 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 13:48:24,418 INFO L158 Benchmark]: Toolchain (without parser) took 1824.94ms. Allocated memory is still 169.9MB. Free memory was 98.5MB in the beginning and 137.8MB in the end (delta: -39.4MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2024-11-08 13:48:24,418 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory was 84.3MB in the beginning and 84.2MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 13:48:24,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.82ms. Allocated memory is still 169.9MB. Free memory was 98.2MB in the beginning and 85.4MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 13:48:24,420 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.10ms. Allocated memory is still 169.9MB. Free memory was 85.4MB in the beginning and 83.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 13:48:24,420 INFO L158 Benchmark]: Boogie Preprocessor took 25.86ms. Allocated memory is still 169.9MB. Free memory was 83.8MB in the beginning and 82.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 13:48:24,420 INFO L158 Benchmark]: RCFGBuilder took 264.59ms. Allocated memory is still 169.9MB. Free memory was 81.7MB in the beginning and 68.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 13:48:24,421 INFO L158 Benchmark]: TraceAbstraction took 1230.27ms. Allocated memory is still 169.9MB. Free memory was 67.8MB in the beginning and 63.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2024-11-08 13:48:24,421 INFO L158 Benchmark]: Witness Printer took 56.18ms. Allocated memory is still 169.9MB. Free memory was 63.7MB in the beginning and 137.8MB in the end (delta: -74.1MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-11-08 13:48:24,422 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.15ms. Allocated memory is still 121.6MB. Free memory was 84.3MB in the beginning and 84.2MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.82ms. Allocated memory is still 169.9MB. Free memory was 98.2MB in the beginning and 85.4MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.10ms. Allocated memory is still 169.9MB. Free memory was 85.4MB in the beginning and 83.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.86ms. Allocated memory is still 169.9MB. Free memory was 83.8MB in the beginning and 82.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 264.59ms. Allocated memory is still 169.9MB. Free memory was 81.7MB in the beginning and 68.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1230.27ms. Allocated memory is still 169.9MB. Free memory was 67.8MB in the beginning and 63.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * Witness Printer took 56.18ms. Allocated memory is still 169.9MB. Free memory was 63.7MB in the beginning and 137.8MB in the end (delta: -74.1MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 6]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L11] int ldv_mutex = 1; [L13] int open_called = 0; VAL [ldv_mutex=1, open_called=0] [L76] int ldv_s_misc_fops_file_operations = 0; [L77] CALL my_init() [L71] open_called = 0 [L72] return 0; VAL [\result=0, ldv_mutex=1, open_called=0] [L77] RET my_init() [L78] COND TRUE __VERIFIER_nondet_int() [L82] case 0: [L84] CALL misc_open() [L59] COND TRUE __VERIFIER_nondet_int() [L61] return 1; VAL [\result=1, ldv_mutex=1, open_called=0] [L84] RET misc_open() [L85] ldv_s_misc_fops_file_operations++ VAL [ldv_mutex=1, ldv_s_misc_fops_file_operations=1, open_called=0] [L78] COND TRUE __VERIFIER_nondet_int() [L82] case 0: [L90] case 1: [L92] CALL misc_read() [L54] return 0; VAL [\result=0, ldv_mutex=1, open_called=0] [L92] RET misc_read() [L93] ldv_s_misc_fops_file_operations++ VAL [ldv_mutex=1, ldv_s_misc_fops_file_operations=2, open_called=0] [L78] COND TRUE __VERIFIER_nondet_int() [L82] case 0: [L90] case 1: [L98] case 2: [L100] CALL misc_llseek() [L50] return 0; VAL [\result=0, ldv_mutex=1, open_called=0] [L100] RET misc_llseek() [L101] ldv_s_misc_fops_file_operations++ VAL [ldv_mutex=1, ldv_s_misc_fops_file_operations=3, open_called=0] [L78] COND TRUE __VERIFIER_nondet_int() [L82] case 0: [L90] case 1: [L98] case 2: [L106] case 3: [L108] CALL misc_release() [L36] COND FALSE !(\read(open_called)) VAL [ldv_mutex=1, open_called=0] [L43] CALL mutex_lock() VAL [\old(ldv_mutex)=1, ldv_mutex=1, open_called=0] [L18] (ldv_mutex == 1) ? 0 : __blast_assert() VAL [\old(ldv_mutex)=1, ldv_mutex=1, open_called=0] [L19] ldv_mutex = 2 VAL [\old(ldv_mutex)=1, ldv_mutex=2, open_called=0] [L43] RET mutex_lock() VAL [ldv_mutex=2, open_called=0] [L44] CALL mutex_lock() VAL [\old(ldv_mutex)=2, ldv_mutex=2, open_called=0] [L18] (ldv_mutex == 1) ? 0 : __blast_assert() VAL [\old(ldv_mutex)=2, ldv_mutex=2, open_called=0] [L18] CALL __blast_assert() VAL [\old(ldv_mutex)=2, ldv_mutex=2, open_called=0] [L6] reach_error() VAL [\old(ldv_mutex)=2, ldv_mutex=2, open_called=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 507 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 305 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 119 IncrementalHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 202 mSDtfsCounter, 119 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=4, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 234 SizeOfPredicates, 0 NumberOfNonLiveVariables, 90 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 4/13 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-08 13:48:24,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE