./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_14-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_14-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:51:50,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:51:50,945 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:51:50,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:51:50,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:51:50,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:51:50,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:51:50,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:51:50,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:51:50,974 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:51:50,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:51:50,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:51:50,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:51:50,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:51:50,978 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:51:50,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:51:50,978 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:51:50,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:51:50,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:51:50,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:51:50,979 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:51:50,981 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:51:50,982 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:51:50,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:51:50,982 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:51:50,982 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:51:50,982 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:51:50,983 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:51:50,983 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:51:50,983 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:51:50,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:51:50,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:51:50,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:51:50,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:51:50,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:51:50,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:51:50,985 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:51:50,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:51:50,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:51:50,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:51:50,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:51:50,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:51:50,989 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c [2024-11-17 00:51:51,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:51:51,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:51:51,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:51:51,250 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:51:51,251 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:51:51,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-2.c [2024-11-17 00:51:52,606 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:51:52,773 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:51:52,774 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c [2024-11-17 00:51:52,785 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c1906266/cab978f3535946f0b02d41d351281eda/FLAG7df9de9b9 [2024-11-17 00:51:53,171 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c1906266/cab978f3535946f0b02d41d351281eda [2024-11-17 00:51:53,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:51:53,175 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:51:53,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:51:53,177 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:51:53,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:51:53,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:51:53" (1/1) ... [2024-11-17 00:51:53,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7159ff98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:53, skipping insertion in model container [2024-11-17 00:51:53,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:51:53" (1/1) ... [2024-11-17 00:51:53,206 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:51:53,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:51:53,390 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:51:53,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:51:53,426 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:51:53,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:53 WrapperNode [2024-11-17 00:51:53,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:51:53,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:51:53,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:51:53,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:51:53,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:53" (1/1) ... [2024-11-17 00:51:53,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:53" (1/1) ... [2024-11-17 00:51:53,466 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 198 [2024-11-17 00:51:53,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:51:53,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:51:53,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:51:53,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:51:53,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:53" (1/1) ... [2024-11-17 00:51:53,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:53" (1/1) ... [2024-11-17 00:51:53,481 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:53" (1/1) ... [2024-11-17 00:51:53,501 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-17 00:51:53,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:53" (1/1) ... [2024-11-17 00:51:53,502 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:53" (1/1) ... [2024-11-17 00:51:53,509 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:53" (1/1) ... [2024-11-17 00:51:53,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:53" (1/1) ... [2024-11-17 00:51:53,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:53" (1/1) ... [2024-11-17 00:51:53,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:53" (1/1) ... [2024-11-17 00:51:53,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:51:53,516 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:51:53,517 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:51:53,517 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:51:53,518 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:53" (1/1) ... [2024-11-17 00:51:53,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:51:53,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:51:53,553 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-17 00:51:53,557 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-17 00:51:53,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:51:53,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:51:53,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:51:53,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:51:53,676 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:51:53,678 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:51:53,916 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-17 00:51:53,917 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:51:53,928 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:51:53,928 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:51:53,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:51:53 BoogieIcfgContainer [2024-11-17 00:51:53,929 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:51:53,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:51:53,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:51:53,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:51:53,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:51:53" (1/3) ... [2024-11-17 00:51:53,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da3c0c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:51:53, skipping insertion in model container [2024-11-17 00:51:53,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:53" (2/3) ... [2024-11-17 00:51:53,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da3c0c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:51:53, skipping insertion in model container [2024-11-17 00:51:53,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:51:53" (3/3) ... [2024-11-17 00:51:53,935 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14-2.c [2024-11-17 00:51:53,949 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:51:53,949 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 00:51:53,983 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:51:53,988 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=None, 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;@7e66ea60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:51:53,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 00:51:53,992 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 57 states have internal predecessors, (102), 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-17 00:51:53,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:51:53,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:51:53,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:51:53,997 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:51:54,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:51:54,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1058514900, now seen corresponding path program 1 times [2024-11-17 00:51:54,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:51:54,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227760321] [2024-11-17 00:51:54,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:51:54,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:51:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:51:54,140 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-17 00:51:54,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:51:54,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227760321] [2024-11-17 00:51:54,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227760321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:51:54,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:51:54,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:51:54,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590133784] [2024-11-17 00:51:54,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:51:54,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 00:51:54,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:51:54,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 00:51:54,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:51:54,173 INFO L87 Difference]: Start difference. First operand has 58 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 57 states have internal predecessors, (102), 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-17 00:51:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:51:54,185 INFO L93 Difference]: Finished difference Result 57 states and 98 transitions. [2024-11-17 00:51:54,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 00:51:54,188 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 6 [2024-11-17 00:51:54,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:51:54,194 INFO L225 Difference]: With dead ends: 57 [2024-11-17 00:51:54,194 INFO L226 Difference]: Without dead ends: 54 [2024-11-17 00:51:54,195 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-17 00:51:54,198 INFO L432 NwaCegarLoop]: 98 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, 98 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-17 00:51:54,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:51:54,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-17 00:51:54,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-17 00:51:54,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 53 states have internal predecessors, (95), 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-17 00:51:54,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 95 transitions. [2024-11-17 00:51:54,225 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 95 transitions. Word has length 6 [2024-11-17 00:51:54,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:51:54,226 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 95 transitions. [2024-11-17 00:51:54,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-17 00:51:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 95 transitions. [2024-11-17 00:51:54,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:51:54,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:51:54,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:51:54,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:51:54,227 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:51:54,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:51:54,227 INFO L85 PathProgramCache]: Analyzing trace with hash -572418085, now seen corresponding path program 1 times [2024-11-17 00:51:54,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:51:54,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514974364] [2024-11-17 00:51:54,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:51:54,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:51:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:51:54,294 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-17 00:51:54,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:51:54,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514974364] [2024-11-17 00:51:54,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514974364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:51:54,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:51:54,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:51:54,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125481088] [2024-11-17 00:51:54,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:51:54,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:51:54,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:51:54,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:51:54,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:51:54,297 INFO L87 Difference]: Start difference. First operand 54 states and 95 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-17 00:51:54,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:51:54,308 INFO L93 Difference]: Finished difference Result 53 states and 94 transitions. [2024-11-17 00:51:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:51:54,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2024-11-17 00:51:54,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:51:54,309 INFO L225 Difference]: With dead ends: 53 [2024-11-17 00:51:54,309 INFO L226 Difference]: Without dead ends: 50 [2024-11-17 00:51:54,310 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-17 00:51:54,311 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 87 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:51:54,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 94 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:51:54,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-17 00:51:54,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-17 00:51:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 49 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-17 00:51:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 91 transitions. [2024-11-17 00:51:54,317 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 91 transitions. Word has length 8 [2024-11-17 00:51:54,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:51:54,317 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 91 transitions. [2024-11-17 00:51:54,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-17 00:51:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 91 transitions. [2024-11-17 00:51:54,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:51:54,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:51:54,318 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, 1, 1, 1] [2024-11-17 00:51:54,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:51:54,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:51:54,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:51:54,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1791973248, now seen corresponding path program 1 times [2024-11-17 00:51:54,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:51:54,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22197123] [2024-11-17 00:51:54,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:51:54,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:51:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:51:54,406 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-17 00:51:54,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:51:54,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22197123] [2024-11-17 00:51:54,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22197123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:51:54,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:51:54,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:51:54,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708334334] [2024-11-17 00:51:54,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:51:54,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:51:54,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:51:54,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:51:54,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:51:54,408 INFO L87 Difference]: Start difference. First operand 50 states and 91 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-17 00:51:54,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:51:54,437 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2024-11-17 00:51:54,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:51:54,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 23 [2024-11-17 00:51:54,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:51:54,439 INFO L225 Difference]: With dead ends: 97 [2024-11-17 00:51:54,439 INFO L226 Difference]: Without dead ends: 97 [2024-11-17 00:51:54,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-17 00:51:54,440 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 70 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:51:54,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:51:54,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-17 00:51:54,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 65. [2024-11-17 00:51:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.875) internal successors, (120), 64 states have internal predecessors, (120), 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-17 00:51:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 120 transitions. [2024-11-17 00:51:54,452 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 120 transitions. Word has length 23 [2024-11-17 00:51:54,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:51:54,452 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 120 transitions. [2024-11-17 00:51:54,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-17 00:51:54,453 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 120 transitions. [2024-11-17 00:51:54,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:51:54,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:51:54,453 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, 1, 1, 1] [2024-11-17 00:51:54,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:51:54,454 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:51:54,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:51:54,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1792000156, now seen corresponding path program 1 times [2024-11-17 00:51:54,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:51:54,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943917067] [2024-11-17 00:51:54,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:51:54,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:51:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:51:54,505 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-17 00:51:54,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:51:54,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943917067] [2024-11-17 00:51:54,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943917067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:51:54,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:51:54,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:51:54,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271492900] [2024-11-17 00:51:54,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:51:54,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:51:54,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:51:54,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:51:54,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:51:54,508 INFO L87 Difference]: Start difference. First operand 65 states and 120 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-17 00:51:54,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:51:54,529 INFO L93 Difference]: Finished difference Result 98 states and 177 transitions. [2024-11-17 00:51:54,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:51:54,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 23 [2024-11-17 00:51:54,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:51:54,531 INFO L225 Difference]: With dead ends: 98 [2024-11-17 00:51:54,531 INFO L226 Difference]: Without dead ends: 98 [2024-11-17 00:51:54,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-17 00:51:54,532 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 73 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:51:54,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 229 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:51:54,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-17 00:51:54,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2024-11-17 00:51:54,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.8617021276595744) internal successors, (175), 94 states have internal predecessors, (175), 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-17 00:51:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 175 transitions. [2024-11-17 00:51:54,539 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 175 transitions. Word has length 23 [2024-11-17 00:51:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:51:54,540 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 175 transitions. [2024-11-17 00:51:54,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-17 00:51:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 175 transitions. [2024-11-17 00:51:54,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:51:54,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:51:54,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, 1, 1, 1] [2024-11-17 00:51:54,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:51:54,541 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:51:54,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:51:54,542 INFO L85 PathProgramCache]: Analyzing trace with hash 794900895, now seen corresponding path program 1 times [2024-11-17 00:51:54,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:51:54,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022287892] [2024-11-17 00:51:54,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:51:54,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:51:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:51:54,586 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-17 00:51:54,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:51:54,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022287892] [2024-11-17 00:51:54,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022287892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:51:54,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:51:54,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:51:54,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078324500] [2024-11-17 00:51:54,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:51:54,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:51:54,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:51:54,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:51:54,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:51:54,588 INFO L87 Difference]: Start difference. First operand 95 states and 175 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-17 00:51:54,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:51:54,610 INFO L93 Difference]: Finished difference Result 101 states and 178 transitions. [2024-11-17 00:51:54,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:51:54,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 23 [2024-11-17 00:51:54,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:51:54,611 INFO L225 Difference]: With dead ends: 101 [2024-11-17 00:51:54,611 INFO L226 Difference]: Without dead ends: 101 [2024-11-17 00:51:54,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-17 00:51:54,615 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 71 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:51:54,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 203 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:51:54,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-17 00:51:54,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-11-17 00:51:54,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.8144329896907216) internal successors, (176), 97 states have internal predecessors, (176), 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-17 00:51:54,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 176 transitions. [2024-11-17 00:51:54,621 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 176 transitions. Word has length 23 [2024-11-17 00:51:54,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:51:54,621 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 176 transitions. [2024-11-17 00:51:54,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-17 00:51:54,622 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 176 transitions. [2024-11-17 00:51:54,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:51:54,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:51:54,622 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, 1, 1, 1] [2024-11-17 00:51:54,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:51:54,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:51:54,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:51:54,624 INFO L85 PathProgramCache]: Analyzing trace with hash 794927803, now seen corresponding path program 1 times [2024-11-17 00:51:54,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:51:54,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403245526] [2024-11-17 00:51:54,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:51:54,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:51:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:51:54,696 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-17 00:51:54,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:51:54,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403245526] [2024-11-17 00:51:54,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403245526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:51:54,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:51:54,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:51:54,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860322903] [2024-11-17 00:51:54,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:51:54,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:51:54,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:51:54,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:51:54,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:51:54,699 INFO L87 Difference]: Start difference. First operand 98 states and 176 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-17 00:51:54,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:51:54,712 INFO L93 Difference]: Finished difference Result 132 states and 233 transitions. [2024-11-17 00:51:54,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:51:54,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 23 [2024-11-17 00:51:54,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:51:54,714 INFO L225 Difference]: With dead ends: 132 [2024-11-17 00:51:54,714 INFO L226 Difference]: Without dead ends: 132 [2024-11-17 00:51:54,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-17 00:51:54,715 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 72 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:51:54,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 131 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:51:54,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-17 00:51:54,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2024-11-17 00:51:54,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.8046875) internal successors, (231), 128 states have internal predecessors, (231), 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-17 00:51:54,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 231 transitions. [2024-11-17 00:51:54,721 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 231 transitions. Word has length 23 [2024-11-17 00:51:54,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:51:54,722 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 231 transitions. [2024-11-17 00:51:54,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-17 00:51:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 231 transitions. [2024-11-17 00:51:54,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:51:54,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:51:54,723 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, 1, 1, 1] [2024-11-17 00:51:54,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:51:54,723 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:51:54,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:51:54,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2146729796, now seen corresponding path program 1 times [2024-11-17 00:51:54,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:51:54,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820026552] [2024-11-17 00:51:54,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:51:54,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:51:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 00:51:54,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 00:51:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 00:51:54,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 00:51:54,779 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 00:51:54,780 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-17 00:51:54,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-17 00:51:54,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:51:54,786 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:51:54,845 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 00:51:54,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:51:54 BoogieIcfgContainer [2024-11-17 00:51:54,848 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 00:51:54,849 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 00:51:54,849 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 00:51:54,850 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 00:51:54,850 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:51:53" (3/4) ... [2024-11-17 00:51:54,853 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 00:51:54,854 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 00:51:54,854 INFO L158 Benchmark]: Toolchain (without parser) took 1679.39ms. Allocated memory is still 207.6MB. Free memory was 139.4MB in the beginning and 88.3MB in the end (delta: 51.0MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. [2024-11-17 00:51:54,854 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 207.6MB. Free memory is still 167.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:51:54,854 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.66ms. Allocated memory is still 207.6MB. Free memory was 139.1MB in the beginning and 125.4MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 00:51:54,855 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.38ms. Allocated memory is still 207.6MB. Free memory was 125.4MB in the beginning and 123.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:51:54,855 INFO L158 Benchmark]: Boogie Preprocessor took 44.29ms. Allocated memory is still 207.6MB. Free memory was 123.6MB in the beginning and 121.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:51:54,855 INFO L158 Benchmark]: IcfgBuilder took 412.47ms. Allocated memory is still 207.6MB. Free memory was 121.8MB in the beginning and 164.9MB in the end (delta: -43.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-17 00:51:54,855 INFO L158 Benchmark]: TraceAbstraction took 918.18ms. Allocated memory is still 207.6MB. Free memory was 163.8MB in the beginning and 89.4MB in the end (delta: 74.4MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2024-11-17 00:51:54,856 INFO L158 Benchmark]: Witness Printer took 4.78ms. Allocated memory is still 207.6MB. Free memory was 89.4MB in the beginning and 88.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:51:54,857 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.22ms. Allocated memory is still 207.6MB. Free memory is still 167.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.66ms. Allocated memory is still 207.6MB. Free memory was 139.1MB in the beginning and 125.4MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.38ms. Allocated memory is still 207.6MB. Free memory was 125.4MB in the beginning and 123.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.29ms. Allocated memory is still 207.6MB. Free memory was 123.6MB in the beginning and 121.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 412.47ms. Allocated memory is still 207.6MB. Free memory was 121.8MB in the beginning and 164.9MB in the end (delta: -43.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 918.18ms. Allocated memory is still 207.6MB. Free memory was 163.8MB in the beginning and 89.4MB in the end (delta: 74.4MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Witness Printer took 4.78ms. Allocated memory is still 207.6MB. Free memory was 89.4MB in the beginning and 88.3MB in the end (delta: 1.0MB). There was no memory consumed. 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 - UnprovableResult [Line: 3]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 3. Possible FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; VAL [p10=1, p11=1, p12=1, p13=1, p14=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=0, p7=1, p8=1, p9=1] [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=0, p7=1, p8=1, p9=1] [L88] COND FALSE !(p1 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=0, p7=1, p8=1, p9=1] [L92] COND FALSE !(p2 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=0, p7=1, p8=1, p9=1] [L96] COND TRUE p3 != 0 [L97] lk3 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=0, p7=1, p8=1, p9=1] [L100] COND TRUE p4 != 0 [L101] lk4 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=0, p7=1, p8=1, p9=1] [L104] COND TRUE p5 != 0 [L105] lk5 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=0, p7=1, p8=1, p9=1] [L108] COND FALSE !(p6 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=0, p7=1, p8=1, p9=1] [L112] COND TRUE p7 != 0 [L113] lk7 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=1, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=0, p7=1, p8=1, p9=1] [L116] COND TRUE p8 != 0 [L117] lk8 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=0, p7=1, p8=1, p9=1] [L120] COND TRUE p9 != 0 [L121] lk9 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=1, lk8=1, lk9=1, p10=1, p11=1, p12=1, p13=1, p14=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=0, p7=1, p8=1, p9=1] [L124] COND TRUE p10 != 0 [L125] lk10 = 1 VAL [lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=1, lk8=1, lk9=1, p10=1, p11=1, p12=1, p13=1, p14=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=0, p7=1, p8=1, p9=1] [L128] COND TRUE p11 != 0 [L129] lk11 = 1 VAL [lk10=1, lk11=1, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=1, lk8=1, lk9=1, p10=1, p11=1, p12=1, p13=1, p14=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=0, p7=1, p8=1, p9=1] [L132] COND TRUE p12 != 0 [L133] lk12 = 1 VAL [lk10=1, lk11=1, lk12=1, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=1, lk8=1, lk9=1, p10=1, p11=1, p12=1, p13=1, p14=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=0, p7=1, p8=1, p9=1] [L136] COND TRUE p13 != 0 [L137] lk13 = 1 VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=1, lk8=1, lk9=1, p10=1, p11=1, p12=1, p13=1, p14=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=0, p7=1, p8=1, p9=1] [L140] COND FALSE !(p14 != 0) VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=1, lk8=1, lk9=1, p10=1, p11=1, p12=1, p13=1, p14=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=0, p7=1, p8=1, p9=1] [L146] COND FALSE !(p1 != 0) VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=1, lk8=1, lk9=1, p10=1, p11=1, p12=1, p13=1, p14=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=0, p7=1, p8=1, p9=1] [L151] COND FALSE !(p2 != 0) VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=1, lk8=1, lk9=1, p10=1, p11=1, p12=1, p13=1, p14=0, p1=0, p3=1, p4=1, p5=1, p6=0, p7=1, p8=1, p9=1] [L219] CALL reach_error() [L3] __assert_fail("0", "test_locks_14-2.c", 3, "reach_error") - UnprovableResult [Line: 6]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 58 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 373 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 373 mSDsluCounter, 934 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 290 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 644 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=6, InterpolantAutomatonStates: 17, 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, 6 MinimizatonAttempts, 41 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 254 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 could not prove your program: unable to determine feasibility of some traces [2024-11-17 00:51:54,879 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_14-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:51:56,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:51:56,939 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 00:51:56,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:51:56,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:51:56,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:51:56,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:51:56,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:51:56,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:51:56,968 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:51:56,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:51:56,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:51:56,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:51:56,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:51:56,969 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:51:56,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:51:56,969 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:51:56,969 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:51:56,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:51:56,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:51:56,974 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:51:56,975 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:51:56,975 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:51:56,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:51:56,976 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:51:56,976 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 00:51:56,977 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:51:56,977 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 00:51:56,977 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:51:56,977 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:51:56,977 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:51:56,977 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:51:56,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:51:56,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:51:56,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:51:56,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:51:56,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:51:56,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:51:56,978 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 00:51:56,978 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 00:51:56,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:51:56,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:51:56,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:51:56,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:51:56,980 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c [2024-11-17 00:51:57,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:51:57,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:51:57,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:51:57,299 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:51:57,300 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:51:57,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-2.c [2024-11-17 00:51:58,640 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:51:58,807 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:51:58,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c [2024-11-17 00:51:58,820 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cfc9069f/548d3125a28f4fe4ad6f15879abf974f/FLAG8e03977c1 [2024-11-17 00:51:59,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cfc9069f/548d3125a28f4fe4ad6f15879abf974f [2024-11-17 00:51:59,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:51:59,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:51:59,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:51:59,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:51:59,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:51:59,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:51:59" (1/1) ... [2024-11-17 00:51:59,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d1f3544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:59, skipping insertion in model container [2024-11-17 00:51:59,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:51:59" (1/1) ... [2024-11-17 00:51:59,241 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:51:59,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:51:59,442 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:51:59,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:51:59,486 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:51:59,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:59 WrapperNode [2024-11-17 00:51:59,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:51:59,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:51:59,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:51:59,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:51:59,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:59" (1/1) ... [2024-11-17 00:51:59,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:59" (1/1) ... [2024-11-17 00:51:59,523 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 183 [2024-11-17 00:51:59,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:51:59,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:51:59,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:51:59,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:51:59,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:59" (1/1) ... [2024-11-17 00:51:59,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:59" (1/1) ... [2024-11-17 00:51:59,540 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:59" (1/1) ... [2024-11-17 00:51:59,558 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-17 00:51:59,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:59" (1/1) ... [2024-11-17 00:51:59,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:59" (1/1) ... [2024-11-17 00:51:59,564 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:59" (1/1) ... [2024-11-17 00:51:59,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:59" (1/1) ... [2024-11-17 00:51:59,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:59" (1/1) ... [2024-11-17 00:51:59,571 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:59" (1/1) ... [2024-11-17 00:51:59,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:51:59,573 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:51:59,574 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:51:59,574 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:51:59,577 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:59" (1/1) ... [2024-11-17 00:51:59,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:51:59,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:51:59,606 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-17 00:51:59,609 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-17 00:51:59,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:51:59,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:51:59,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:51:59,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 00:51:59,733 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:51:59,735 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:52:00,006 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-17 00:52:00,006 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:52:00,024 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:52:00,025 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:52:00,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:52:00 BoogieIcfgContainer [2024-11-17 00:52:00,025 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:52:00,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:52:00,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:52:00,029 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:52:00,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:51:59" (1/3) ... [2024-11-17 00:52:00,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b702a62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:52:00, skipping insertion in model container [2024-11-17 00:52:00,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:51:59" (2/3) ... [2024-11-17 00:52:00,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b702a62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:52:00, skipping insertion in model container [2024-11-17 00:52:00,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:52:00" (3/3) ... [2024-11-17 00:52:00,032 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14-2.c [2024-11-17 00:52:00,046 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:52:00,047 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 00:52:00,094 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:52:00,099 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=None, 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;@4b5ccdf2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:52:00,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 00:52:00,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 57 states have internal predecessors, (102), 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-17 00:52:00,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:52:00,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:00,111 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:52:00,112 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:00,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:00,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1058514900, now seen corresponding path program 1 times [2024-11-17 00:52:00,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:52:00,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425360025] [2024-11-17 00:52:00,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:00,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:52:00,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:52:00,132 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:52:00,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 00:52:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:00,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-17 00:52:00,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:52:00,206 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-17 00:52:00,206 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:52:00,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:52:00,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425360025] [2024-11-17 00:52:00,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425360025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:00,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:00,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:52:00,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913169008] [2024-11-17 00:52:00,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:00,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 00:52:00,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:52:00,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 00:52:00,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:52:00,243 INFO L87 Difference]: Start difference. First operand has 58 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 57 states have internal predecessors, (102), 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-17 00:52:00,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:00,260 INFO L93 Difference]: Finished difference Result 57 states and 98 transitions. [2024-11-17 00:52:00,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 00:52:00,263 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 6 [2024-11-17 00:52:00,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:00,269 INFO L225 Difference]: With dead ends: 57 [2024-11-17 00:52:00,269 INFO L226 Difference]: Without dead ends: 54 [2024-11-17 00:52:00,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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-17 00:52:00,274 INFO L432 NwaCegarLoop]: 98 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, 98 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-17 00:52:00,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:00,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-17 00:52:00,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-17 00:52:00,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 53 states have internal predecessors, (95), 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-17 00:52:00,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 95 transitions. [2024-11-17 00:52:00,305 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 95 transitions. Word has length 6 [2024-11-17 00:52:00,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:00,305 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 95 transitions. [2024-11-17 00:52:00,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-17 00:52:00,306 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 95 transitions. [2024-11-17 00:52:00,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:52:00,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:00,307 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:00,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-17 00:52:00,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:52:00,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:00,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:00,509 INFO L85 PathProgramCache]: Analyzing trace with hash -572418085, now seen corresponding path program 1 times [2024-11-17 00:52:00,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:52:00,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926065394] [2024-11-17 00:52:00,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:00,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:52:00,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:52:00,511 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:52:00,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-17 00:52:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:00,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 00:52:00,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:52:00,588 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-17 00:52:00,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:52:00,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:52:00,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926065394] [2024-11-17 00:52:00,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926065394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:00,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:00,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:52:00,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329546501] [2024-11-17 00:52:00,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:00,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:00,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:52:00,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:00,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:00,594 INFO L87 Difference]: Start difference. First operand 54 states and 95 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-17 00:52:00,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:00,602 INFO L93 Difference]: Finished difference Result 53 states and 94 transitions. [2024-11-17 00:52:00,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:00,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2024-11-17 00:52:00,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:00,603 INFO L225 Difference]: With dead ends: 53 [2024-11-17 00:52:00,604 INFO L226 Difference]: Without dead ends: 50 [2024-11-17 00:52:00,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-17 00:52:00,605 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 87 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:00,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 94 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:00,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-17 00:52:00,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-17 00:52:00,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 49 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-17 00:52:00,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 91 transitions. [2024-11-17 00:52:00,610 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 91 transitions. Word has length 8 [2024-11-17 00:52:00,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:00,610 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 91 transitions. [2024-11-17 00:52:00,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-17 00:52:00,611 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 91 transitions. [2024-11-17 00:52:00,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:52:00,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:00,612 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, 1, 1, 1] [2024-11-17 00:52:00,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-17 00:52:00,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:52:00,813 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:00,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:00,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1791973248, now seen corresponding path program 1 times [2024-11-17 00:52:00,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:52:00,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137855198] [2024-11-17 00:52:00,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:00,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:52:00,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:52:00,818 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:52:00,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 00:52:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:00,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 00:52:00,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:52:00,910 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-17 00:52:00,911 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:52:00,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:52:00,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137855198] [2024-11-17 00:52:00,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137855198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:00,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:00,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:00,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205521840] [2024-11-17 00:52:00,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:00,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:00,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:52:00,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:00,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:00,915 INFO L87 Difference]: Start difference. First operand 50 states and 91 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-17 00:52:00,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:00,939 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2024-11-17 00:52:00,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:00,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 23 [2024-11-17 00:52:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:00,941 INFO L225 Difference]: With dead ends: 97 [2024-11-17 00:52:00,941 INFO L226 Difference]: Without dead ends: 97 [2024-11-17 00:52:00,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-17 00:52:00,942 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 70 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:00,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:00,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-17 00:52:00,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 65. [2024-11-17 00:52:00,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.875) internal successors, (120), 64 states have internal predecessors, (120), 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-17 00:52:00,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 120 transitions. [2024-11-17 00:52:00,951 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 120 transitions. Word has length 23 [2024-11-17 00:52:00,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:00,952 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 120 transitions. [2024-11-17 00:52:00,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-17 00:52:00,952 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 120 transitions. [2024-11-17 00:52:00,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:52:00,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:00,953 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, 1, 1, 1] [2024-11-17 00:52:00,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-17 00:52:01,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:52:01,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:01,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:01,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1792000156, now seen corresponding path program 1 times [2024-11-17 00:52:01,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:52:01,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643036543] [2024-11-17 00:52:01,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:01,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:52:01,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:52:01,158 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:52:01,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 00:52:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:01,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 00:52:01,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:52:01,247 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-17 00:52:01,247 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:52:01,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:52:01,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643036543] [2024-11-17 00:52:01,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643036543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:01,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:01,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:01,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032382654] [2024-11-17 00:52:01,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:01,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:01,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:52:01,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:01,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:01,249 INFO L87 Difference]: Start difference. First operand 65 states and 120 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-17 00:52:01,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:01,263 INFO L93 Difference]: Finished difference Result 98 states and 177 transitions. [2024-11-17 00:52:01,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:01,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 23 [2024-11-17 00:52:01,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:01,264 INFO L225 Difference]: With dead ends: 98 [2024-11-17 00:52:01,264 INFO L226 Difference]: Without dead ends: 98 [2024-11-17 00:52:01,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-17 00:52:01,266 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 73 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:01,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 229 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:01,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-17 00:52:01,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2024-11-17 00:52:01,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.8617021276595744) internal successors, (175), 94 states have internal predecessors, (175), 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-17 00:52:01,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 175 transitions. [2024-11-17 00:52:01,272 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 175 transitions. Word has length 23 [2024-11-17 00:52:01,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:01,273 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 175 transitions. [2024-11-17 00:52:01,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-17 00:52:01,273 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 175 transitions. [2024-11-17 00:52:01,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:52:01,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:01,277 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, 1, 1, 1] [2024-11-17 00:52:01,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-17 00:52:01,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:52:01,479 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:01,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:01,479 INFO L85 PathProgramCache]: Analyzing trace with hash 794900895, now seen corresponding path program 1 times [2024-11-17 00:52:01,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:52:01,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633974111] [2024-11-17 00:52:01,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:01,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:52:01,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:52:01,482 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:52:01,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-17 00:52:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:01,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 00:52:01,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:52:01,538 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-17 00:52:01,539 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:52:01,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:52:01,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633974111] [2024-11-17 00:52:01,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633974111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:01,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:01,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:01,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342646088] [2024-11-17 00:52:01,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:01,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:01,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:52:01,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:01,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:01,541 INFO L87 Difference]: Start difference. First operand 95 states and 175 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-17 00:52:01,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:01,563 INFO L93 Difference]: Finished difference Result 101 states and 178 transitions. [2024-11-17 00:52:01,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:01,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 23 [2024-11-17 00:52:01,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:01,564 INFO L225 Difference]: With dead ends: 101 [2024-11-17 00:52:01,565 INFO L226 Difference]: Without dead ends: 101 [2024-11-17 00:52:01,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-17 00:52:01,568 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 71 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:01,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 203 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:01,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-17 00:52:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-11-17 00:52:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.8144329896907216) internal successors, (176), 97 states have internal predecessors, (176), 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-17 00:52:01,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 176 transitions. [2024-11-17 00:52:01,580 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 176 transitions. Word has length 23 [2024-11-17 00:52:01,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:01,580 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 176 transitions. [2024-11-17 00:52:01,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-17 00:52:01,581 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 176 transitions. [2024-11-17 00:52:01,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:52:01,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:01,581 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, 1, 1, 1] [2024-11-17 00:52:01,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-17 00:52:01,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:52:01,785 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:01,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:01,786 INFO L85 PathProgramCache]: Analyzing trace with hash 794927803, now seen corresponding path program 1 times [2024-11-17 00:52:01,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:52:01,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124362322] [2024-11-17 00:52:01,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:01,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:52:01,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:52:01,789 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:52:01,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-17 00:52:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:01,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 00:52:01,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:52:01,857 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-17 00:52:01,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:52:01,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:52:01,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124362322] [2024-11-17 00:52:01,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124362322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:01,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:01,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:01,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731649048] [2024-11-17 00:52:01,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:01,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:01,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:52:01,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:01,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:01,859 INFO L87 Difference]: Start difference. First operand 98 states and 176 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-17 00:52:01,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:01,870 INFO L93 Difference]: Finished difference Result 132 states and 233 transitions. [2024-11-17 00:52:01,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:01,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 23 [2024-11-17 00:52:01,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:01,874 INFO L225 Difference]: With dead ends: 132 [2024-11-17 00:52:01,874 INFO L226 Difference]: Without dead ends: 132 [2024-11-17 00:52:01,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-17 00:52:01,875 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 72 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:01,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 131 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:01,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-17 00:52:01,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2024-11-17 00:52:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.8046875) internal successors, (231), 128 states have internal predecessors, (231), 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-17 00:52:01,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 231 transitions. [2024-11-17 00:52:01,889 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 231 transitions. Word has length 23 [2024-11-17 00:52:01,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:01,889 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 231 transitions. [2024-11-17 00:52:01,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-17 00:52:01,889 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 231 transitions. [2024-11-17 00:52:01,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:52:01,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:01,890 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, 1, 1, 1] [2024-11-17 00:52:01,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-17 00:52:02,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:52:02,091 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:02,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:02,092 INFO L85 PathProgramCache]: Analyzing trace with hash -2146729796, now seen corresponding path program 1 times [2024-11-17 00:52:02,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:52:02,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1577713685] [2024-11-17 00:52:02,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:02,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:52:02,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:52:02,093 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:52:02,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-17 00:52:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 00:52:02,119 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 00:52:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 00:52:02,152 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-17 00:52:02,152 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 00:52:02,153 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-17 00:52:02,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-17 00:52:02,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-17 00:52:02,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:52:02,358 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:02,399 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 00:52:02,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:52:02 BoogieIcfgContainer [2024-11-17 00:52:02,401 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 00:52:02,402 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 00:52:02,402 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 00:52:02,402 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 00:52:02,406 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:52:00" (3/4) ... [2024-11-17 00:52:02,409 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 00:52:02,410 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 00:52:02,412 INFO L158 Benchmark]: Toolchain (without parser) took 3201.85ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 32.6MB in the beginning and 33.5MB in the end (delta: -945.6kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 00:52:02,413 INFO L158 Benchmark]: CDTParser took 1.16ms. Allocated memory is still 44.0MB. Free memory was 23.9MB in the beginning and 23.8MB in the end (delta: 54.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:52:02,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.93ms. Allocated memory is still 65.0MB. Free memory was 32.4MB in the beginning and 34.2MB in the end (delta: -1.8MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-11-17 00:52:02,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.93ms. Allocated memory is still 65.0MB. Free memory was 34.2MB in the beginning and 32.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:52:02,413 INFO L158 Benchmark]: Boogie Preprocessor took 48.29ms. Allocated memory is still 65.0MB. Free memory was 32.2MB in the beginning and 30.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:52:02,414 INFO L158 Benchmark]: IcfgBuilder took 452.01ms. Allocated memory is still 65.0MB. Free memory was 30.4MB in the beginning and 28.1MB in the end (delta: 2.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-17 00:52:02,414 INFO L158 Benchmark]: TraceAbstraction took 2374.41ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 27.5MB in the beginning and 34.1MB in the end (delta: -6.6MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2024-11-17 00:52:02,414 INFO L158 Benchmark]: Witness Printer took 8.26ms. Allocated memory is still 79.7MB. Free memory was 34.1MB in the beginning and 33.5MB in the end (delta: 545.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:52:02,415 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16ms. Allocated memory is still 44.0MB. Free memory was 23.9MB in the beginning and 23.8MB in the end (delta: 54.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.93ms. Allocated memory is still 65.0MB. Free memory was 32.4MB in the beginning and 34.2MB in the end (delta: -1.8MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.93ms. Allocated memory is still 65.0MB. Free memory was 34.2MB in the beginning and 32.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.29ms. Allocated memory is still 65.0MB. Free memory was 32.2MB in the beginning and 30.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 452.01ms. Allocated memory is still 65.0MB. Free memory was 30.4MB in the beginning and 28.1MB in the end (delta: 2.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2374.41ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 27.5MB in the beginning and 34.1MB in the end (delta: -6.6MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Witness Printer took 8.26ms. Allocated memory is still 79.7MB. Free memory was 34.1MB in the beginning and 33.5MB in the end (delta: 545.2kB). Peak memory consumption was 2.1MB. 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 - UnprovableResult [Line: 3]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 3. Possible FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0] [L88] COND FALSE !(p1 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0] [L92] COND FALSE !(p2 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0] [L96] COND TRUE p3 != 0 [L97] lk3 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=2] [L100] COND TRUE p4 != 0 [L101] lk4 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=2, p4=2] [L104] COND TRUE p5 != 0 [L105] lk5 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=2, p4=2, p5=2] [L108] COND FALSE !(p6 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=2, p4=2, p5=2, p6=0] [L112] COND TRUE p7 != 0 [L113] lk7 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=1, lk8=0, lk9=0, p1=0, p2=0, p3=2, p4=2, p5=2, p6=0, p7=2] [L116] COND TRUE p8 != 0 [L117] lk8 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=1, lk8=1, lk9=0, p1=0, p2=0, p3=2, p4=2, p5=2, p6=0, p7=2, p8=2] [L120] COND TRUE p9 != 0 [L121] lk9 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=1, lk8=1, lk9=1, p1=0, p2=0, p3=2, p4=2, p5=2, p6=0, p7=2, p8=2, p9=2] [L124] COND TRUE p10 != 0 [L125] lk10 = 1 VAL [lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=1, lk8=1, lk9=1, p10=2, p1=0, p2=0, p3=2, p4=2, p5=2, p6=0, p7=2, p8=2, p9=2] [L128] COND TRUE p11 != 0 [L129] lk11 = 1 VAL [lk10=1, lk11=1, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=1, lk8=1, lk9=1, p10=2, p11=2, p1=0, p2=0, p3=2, p4=2, p5=2, p6=0, p7=2, p8=2, p9=2] [L132] COND TRUE p12 != 0 [L133] lk12 = 1 VAL [lk10=1, lk11=1, lk12=1, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=1, lk8=1, lk9=1, p10=2, p11=2, p12=2, p1=0, p2=0, p3=2, p4=2, p5=2, p6=0, p7=2, p8=2, p9=2] [L136] COND TRUE p13 != 0 [L137] lk13 = 1 VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=1, lk8=1, lk9=1, p10=2, p11=2, p12=2, p13=2, p1=0, p2=0, p3=2, p4=2, p5=2, p6=0, p7=2, p8=2, p9=2] [L140] COND FALSE !(p14 != 0) VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=1, lk8=1, lk9=1, p10=2, p11=2, p12=2, p13=2, p14=0, p1=0, p2=0, p3=2, p4=2, p5=2, p6=0, p7=2, p8=2, p9=2] [L146] COND FALSE !(p1 != 0) VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=1, lk8=1, lk9=1, p10=2, p11=2, p12=2, p13=2, p14=0, p1=0, p2=0, p3=2, p4=2, p5=2, p6=0, p7=2, p8=2, p9=2] [L151] COND FALSE !(p2 != 0) VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=1, lk8=1, lk9=1, p10=2, p11=2, p12=2, p13=2, p14=0, p1=0, p3=2, p4=2, p5=2, p6=0, p7=2, p8=2, p9=2] [L219] CALL reach_error() [L3] __assert_fail("0", "test_locks_14-2.c", 3, "reach_error") - UnprovableResult [Line: 6]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 58 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 373 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 373 mSDsluCounter, 934 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 290 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 644 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=6, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 41 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 254 SizeOfPredicates, 0 NumberOfNonLiveVariables, 274 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 could not prove your program: unable to determine feasibility of some traces [2024-11-17 00:52:02,448 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 Result: UNKNOWN: Overapproximated counterexample