./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_shallow_copy-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_shallow_copy-2.i -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 6b0035e4df062aac8021cee981905a3c98f2d4e312e33b913ded157af60b9640 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 08:06:59,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 08:06:59,923 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 08:06:59,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 08:06:59,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 08:06:59,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 08:06:59,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 08:06:59,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 08:06:59,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 08:06:59,949 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 08:06:59,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 08:06:59,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 08:06:59,950 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 08:06:59,950 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 08:06:59,951 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 08:06:59,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 08:06:59,951 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 08:06:59,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 08:06:59,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 08:06:59,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 08:06:59,952 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 08:06:59,953 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 08:06:59,953 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 08:06:59,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 08:06:59,953 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 08:06:59,953 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 08:06:59,954 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 08:06:59,954 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 08:06:59,954 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 08:06:59,954 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 08:06:59,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 08:06:59,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 08:06:59,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 08:06:59,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:06:59,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 08:06:59,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 08:06:59,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 08:06:59,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 08:06:59,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 08:06:59,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 08:06:59,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 08:06:59,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 08:06:59,957 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 -> 6b0035e4df062aac8021cee981905a3c98f2d4e312e33b913ded157af60b9640 [2024-11-09 08:07:00,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 08:07:00,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 08:07:00,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 08:07:00,187 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 08:07:00,188 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 08:07:00,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_shallow_copy-2.i [2024-11-09 08:07:01,405 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 08:07:01,619 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 08:07:01,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_shallow_copy-2.i [2024-11-09 08:07:01,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf0bd1609/9867424e4f2641528334fb662f98ffb1/FLAG2c4cb7000 [2024-11-09 08:07:01,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf0bd1609/9867424e4f2641528334fb662f98ffb1 [2024-11-09 08:07:01,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 08:07:01,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 08:07:01,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 08:07:01,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 08:07:01,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 08:07:01,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:07:01" (1/1) ... [2024-11-09 08:07:01,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cf3e329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:01, skipping insertion in model container [2024-11-09 08:07:01,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:07:01" (1/1) ... [2024-11-09 08:07:01,680 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 08:07:01,959 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 08:07:01,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:07:01,977 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 08:07:02,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:07:02,044 INFO L204 MainTranslator]: Completed translation [2024-11-09 08:07:02,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:02 WrapperNode [2024-11-09 08:07:02,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 08:07:02,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 08:07:02,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 08:07:02,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 08:07:02,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:02" (1/1) ... [2024-11-09 08:07:02,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:02" (1/1) ... [2024-11-09 08:07:02,084 INFO L138 Inliner]: procedures = 114, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2024-11-09 08:07:02,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 08:07:02,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 08:07:02,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 08:07:02,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 08:07:02,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:02" (1/1) ... [2024-11-09 08:07:02,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:02" (1/1) ... [2024-11-09 08:07:02,104 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:02" (1/1) ... [2024-11-09 08:07:02,114 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-11-09 08:07:02,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:02" (1/1) ... [2024-11-09 08:07:02,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:02" (1/1) ... [2024-11-09 08:07:02,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:02" (1/1) ... [2024-11-09 08:07:02,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:02" (1/1) ... [2024-11-09 08:07:02,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:02" (1/1) ... [2024-11-09 08:07:02,123 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:02" (1/1) ... [2024-11-09 08:07:02,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 08:07:02,125 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 08:07:02,125 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 08:07:02,125 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 08:07:02,125 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:02" (1/1) ... [2024-11-09 08:07:02,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:07:02,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:07:02,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 08:07:02,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 08:07:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_node [2024-11-09 08:07:02,205 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_node [2024-11-09 08:07:02,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 08:07:02,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 08:07:02,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 08:07:02,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 08:07:02,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 08:07:02,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 08:07:02,290 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 08:07:02,292 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 08:07:02,418 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-11-09 08:07:02,418 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 08:07:02,428 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 08:07:02,428 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 08:07:02,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:07:02 BoogieIcfgContainer [2024-11-09 08:07:02,428 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 08:07:02,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 08:07:02,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 08:07:02,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 08:07:02,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:07:01" (1/3) ... [2024-11-09 08:07:02,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e11c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:07:02, skipping insertion in model container [2024-11-09 08:07:02,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:02" (2/3) ... [2024-11-09 08:07:02,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e11c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:07:02, skipping insertion in model container [2024-11-09 08:07:02,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:07:02" (3/3) ... [2024-11-09 08:07:02,436 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_shallow_copy-2.i [2024-11-09 08:07:02,450 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 08:07:02,450 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-09 08:07:02,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 08:07:02,496 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;@2265146d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 08:07:02,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-09 08:07:02,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:07:02,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 08:07:02,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:02,508 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:02,509 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-09 08:07:02,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:02,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1794625018, now seen corresponding path program 1 times [2024-11-09 08:07:02,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:02,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730476648] [2024-11-09 08:07:02,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:02,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:02,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:07:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:02,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 08:07:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:03,106 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:07:03,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:03,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730476648] [2024-11-09 08:07:03,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730476648] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:07:03,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561764116] [2024-11-09 08:07:03,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:03,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:07:03,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:07:03,110 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:07:03,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 08:07:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:03,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 08:07:03,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:07:03,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:07:03,266 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alloc_node_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |alloc_node_~temp~0#1.base| (select |c_#valid| |alloc_node_~temp~0#1.base|))) (= (select |c_old(#valid)| |alloc_node_~temp~0#1.base|) 0))) is different from true [2024-11-09 08:07:03,317 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 08:07:03,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 08:07:03,324 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 08:07:03,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:07:03,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561764116] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:07:03,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:07:03,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2024-11-09 08:07:03,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886585606] [2024-11-09 08:07:03,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:07:03,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 08:07:03,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:03,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 08:07:03,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-11-09 08:07:03,407 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 08:07:03,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:03,558 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-11-09 08:07:03,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:07:03,560 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 16 [2024-11-09 08:07:03,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:03,565 INFO L225 Difference]: With dead ends: 31 [2024-11-09 08:07:03,565 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 08:07:03,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2024-11-09 08:07:03,569 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:03,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 57 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 28 Unchecked, 0.1s Time] [2024-11-09 08:07:03,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 08:07:03,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-09 08:07:03,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 24 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:07:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2024-11-09 08:07:03,602 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 16 [2024-11-09 08:07:03,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:03,603 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2024-11-09 08:07:03,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 08:07:03,604 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2024-11-09 08:07:03,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 08:07:03,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:03,605 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:03,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 08:07:03,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-09 08:07:03,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-09 08:07:03,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:03,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1794625017, now seen corresponding path program 1 times [2024-11-09 08:07:03,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:03,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764855956] [2024-11-09 08:07:03,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:03,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:03,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:07:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:04,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 08:07:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:04,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:07:04,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:04,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764855956] [2024-11-09 08:07:04,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764855956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:07:04,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180425982] [2024-11-09 08:07:04,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:04,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:07:04,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:07:04,090 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:07:04,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 08:07:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:04,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 08:07:04,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:07:04,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:07:04,290 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:07:04,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 08:07:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:07:04,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:07:08,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:07:08,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180425982] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:07:08,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:07:08,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2024-11-09 08:07:08,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876149084] [2024-11-09 08:07:08,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:07:08,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 08:07:08,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:08,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 08:07:08,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-09 08:07:08,520 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 12 states have internal predecessors, (27), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 08:07:08,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:08,691 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2024-11-09 08:07:08,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 08:07:08,691 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.6875) internal successors, (27), 12 states have internal predecessors, (27), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 16 [2024-11-09 08:07:08,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:08,692 INFO L225 Difference]: With dead ends: 25 [2024-11-09 08:07:08,692 INFO L226 Difference]: Without dead ends: 25 [2024-11-09 08:07:08,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2024-11-09 08:07:08,693 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 23 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:08,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 73 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:07:08,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-09 08:07:08,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-11-09 08:07:08,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 20 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:07:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2024-11-09 08:07:08,697 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 16 [2024-11-09 08:07:08,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:08,697 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2024-11-09 08:07:08,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.6875) internal successors, (27), 12 states have internal predecessors, (27), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 08:07:08,698 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2024-11-09 08:07:08,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 08:07:08,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:08,698 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:08,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 08:07:08,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-09 08:07:08,903 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-09 08:07:08,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:08,903 INFO L85 PathProgramCache]: Analyzing trace with hash 78968552, now seen corresponding path program 1 times [2024-11-09 08:07:08,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:08,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936824797] [2024-11-09 08:07:08,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:08,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:08,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:07:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:08,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 08:07:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:07:09,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:09,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936824797] [2024-11-09 08:07:09,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936824797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:09,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:09,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 08:07:09,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503422773] [2024-11-09 08:07:09,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:09,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 08:07:09,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:09,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 08:07:09,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:07:09,004 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:07:09,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:09,058 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2024-11-09 08:07:09,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:07:09,058 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-09 08:07:09,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:09,059 INFO L225 Difference]: With dead ends: 23 [2024-11-09 08:07:09,059 INFO L226 Difference]: Without dead ends: 23 [2024-11-09 08:07:09,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 08:07:09,060 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:09,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 59 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:09,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-09 08:07:09,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-09 08:07:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:07:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-11-09 08:07:09,063 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2024-11-09 08:07:09,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:09,063 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-11-09 08:07:09,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:07:09,063 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-11-09 08:07:09,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 08:07:09,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:09,064 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:09,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 08:07:09,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-09 08:07:09,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:09,065 INFO L85 PathProgramCache]: Analyzing trace with hash 78968553, now seen corresponding path program 1 times [2024-11-09 08:07:09,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:09,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663108301] [2024-11-09 08:07:09,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:09,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:09,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:07:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:09,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 08:07:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:09,205 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:07:09,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:09,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663108301] [2024-11-09 08:07:09,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663108301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:09,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:09,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 08:07:09,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830428689] [2024-11-09 08:07:09,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:09,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 08:07:09,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:09,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 08:07:09,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:07:09,207 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:07:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:09,259 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2024-11-09 08:07:09,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:07:09,260 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-09 08:07:09,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:09,261 INFO L225 Difference]: With dead ends: 22 [2024-11-09 08:07:09,261 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 08:07:09,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 08:07:09,262 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:09,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:09,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 08:07:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-09 08:07:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:07:09,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2024-11-09 08:07:09,265 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2024-11-09 08:07:09,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:09,265 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2024-11-09 08:07:09,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:07:09,265 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2024-11-09 08:07:09,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 08:07:09,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:09,266 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:09,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 08:07:09,266 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-09 08:07:09,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:09,267 INFO L85 PathProgramCache]: Analyzing trace with hash 570997579, now seen corresponding path program 1 times [2024-11-09 08:07:09,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:09,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035585753] [2024-11-09 08:07:09,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:09,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:09,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:07:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:09,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 08:07:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:07:09,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:09,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035585753] [2024-11-09 08:07:09,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035585753] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:07:09,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918067155] [2024-11-09 08:07:09,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:09,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:07:09,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:07:09,360 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:07:09,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 08:07:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:09,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 08:07:09,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:07:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:07:09,446 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:07:09,514 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:07:09,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918067155] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:07:09,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:07:09,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2024-11-09 08:07:09,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631253637] [2024-11-09 08:07:09,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:07:09,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:07:09,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:09,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:07:09,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:07:09,516 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:07:09,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:09,561 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2024-11-09 08:07:09,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:07:09,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-09 08:07:09,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:09,563 INFO L225 Difference]: With dead ends: 21 [2024-11-09 08:07:09,563 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 08:07:09,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:07:09,564 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:09,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:09,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 08:07:09,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-09 08:07:09,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:07:09,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-09 08:07:09,569 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 23 [2024-11-09 08:07:09,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:09,569 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-09 08:07:09,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:07:09,569 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-09 08:07:09,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 08:07:09,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:09,569 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:09,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 08:07:09,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:07:09,770 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-09 08:07:09,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:09,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1027138706, now seen corresponding path program 1 times [2024-11-09 08:07:09,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:09,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074600221] [2024-11-09 08:07:09,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:09,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 08:07:09,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 08:07:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 08:07:09,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 08:07:09,805 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 08:07:09,806 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (11 of 12 remaining) [2024-11-09 08:07:09,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2024-11-09 08:07:09,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2024-11-09 08:07:09,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2024-11-09 08:07:09,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2024-11-09 08:07:09,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2024-11-09 08:07:09,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2024-11-09 08:07:09,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2024-11-09 08:07:09,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 12 remaining) [2024-11-09 08:07:09,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (2 of 12 remaining) [2024-11-09 08:07:09,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (1 of 12 remaining) [2024-11-09 08:07:09,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (0 of 12 remaining) [2024-11-09 08:07:09,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 08:07:09,812 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-09 08:07:09,836 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 08:07:09,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 08:07:09 BoogieIcfgContainer [2024-11-09 08:07:09,838 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 08:07:09,839 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 08:07:09,839 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 08:07:09,839 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 08:07:09,839 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:07:02" (3/4) ... [2024-11-09 08:07:09,841 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 08:07:09,842 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 08:07:09,843 INFO L158 Benchmark]: Toolchain (without parser) took 8200.08ms. Allocated memory was 142.6MB in the beginning and 188.7MB in the end (delta: 46.1MB). Free memory was 68.5MB in the beginning and 103.8MB in the end (delta: -35.4MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-11-09 08:07:09,843 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 142.6MB. Free memory is still 92.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 08:07:09,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.03ms. Allocated memory was 142.6MB in the beginning and 188.7MB in the end (delta: 46.1MB). Free memory was 68.3MB in the beginning and 153.2MB in the end (delta: -84.8MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2024-11-09 08:07:09,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.47ms. Allocated memory is still 188.7MB. Free memory was 153.2MB in the beginning and 152.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 08:07:09,844 INFO L158 Benchmark]: Boogie Preprocessor took 37.94ms. Allocated memory is still 188.7MB. Free memory was 151.1MB in the beginning and 150.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 08:07:09,844 INFO L158 Benchmark]: RCFGBuilder took 304.03ms. Allocated memory is still 188.7MB. Free memory was 150.1MB in the beginning and 136.4MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 08:07:09,844 INFO L158 Benchmark]: TraceAbstraction took 7408.19ms. Allocated memory is still 188.7MB. Free memory was 135.4MB in the beginning and 104.9MB in the end (delta: 30.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-09 08:07:09,844 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 188.7MB. Free memory was 104.9MB in the beginning and 103.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 08:07:09,846 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.16ms. Allocated memory is still 142.6MB. Free memory is still 92.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.03ms. Allocated memory was 142.6MB in the beginning and 188.7MB in the end (delta: 46.1MB). Free memory was 68.3MB in the beginning and 153.2MB in the end (delta: -84.8MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.47ms. Allocated memory is still 188.7MB. Free memory was 153.2MB in the beginning and 152.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.94ms. Allocated memory is still 188.7MB. Free memory was 151.1MB in the beginning and 150.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 304.03ms. Allocated memory is still 188.7MB. Free memory was 150.1MB in the beginning and 136.4MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7408.19ms. Allocated memory is still 188.7MB. Free memory was 135.4MB in the beginning and 104.9MB in the end (delta: 30.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 188.7MB. Free memory was 104.9MB in the beginning and 103.8MB 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: 568]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 568. Possible FailurePath: [L569] CALL, EXPR alloc_node() [L562] struct node* temp = (struct node*) malloc(sizeof(struct node)); [L563] COND FALSE !(((void *)0) == temp) VAL [temp={-2:0}] [L566] return temp; VAL [\result={-2:0}] [L569] RET, EXPR alloc_node() [L569] struct node* s = alloc_node(); [L570] CALL, EXPR alloc_node() [L562] struct node* temp = (struct node*) malloc(sizeof(struct node)); [L563] COND FALSE !(((void *)0) == temp) VAL [temp={-1:0}] [L566] return temp; VAL [\result={-1:0}] [L570] RET, EXPR alloc_node() VAL [s={-2:0}] [L570] s->next = alloc_node() [L571] EXPR s->next [L571] *s = *(s->next) [L571] *s = *(s->next) [L572] free(s) [L572] free(s) [L572] free(s) [L573] return 0; VAL [\result=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 305 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 28 IncrementalHoareTripleChecker+Unchecked, 237 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 479 IncrementalHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 68 mSDtfsCounter, 479 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 40, 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, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 173 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 177 ConstructedInterpolants, 13 QuantifiedInterpolants, 1096 SizeOfPredicates, 2 NumberOfNonLiveVariables, 239 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 18/50 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-09 08:07:09,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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/list-ext3-properties/sll_shallow_copy-2.i -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 6b0035e4df062aac8021cee981905a3c98f2d4e312e33b913ded157af60b9640 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 08:07:11,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 08:07:11,700 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 08:07:11,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 08:07:11,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 08:07:11,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 08:07:11,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 08:07:11,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 08:07:11,738 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 08:07:11,739 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 08:07:11,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 08:07:11,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 08:07:11,743 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 08:07:11,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 08:07:11,743 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 08:07:11,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 08:07:11,745 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 08:07:11,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 08:07:11,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 08:07:11,746 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 08:07:11,746 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 08:07:11,750 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 08:07:11,750 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 08:07:11,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 08:07:11,750 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 08:07:11,751 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 08:07:11,751 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 08:07:11,751 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 08:07:11,751 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 08:07:11,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 08:07:11,751 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 08:07:11,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 08:07:11,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 08:07:11,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 08:07:11,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 08:07:11,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:07:11,752 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 08:07:11,752 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 08:07:11,753 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 08:07:11,753 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 08:07:11,753 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 08:07:11,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 08:07:11,754 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 08:07:11,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 08:07:11,754 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 -> 6b0035e4df062aac8021cee981905a3c98f2d4e312e33b913ded157af60b9640 [2024-11-09 08:07:12,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 08:07:12,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 08:07:12,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 08:07:12,043 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 08:07:12,043 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 08:07:12,044 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_shallow_copy-2.i [2024-11-09 08:07:13,316 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 08:07:13,539 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 08:07:13,540 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_shallow_copy-2.i [2024-11-09 08:07:13,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9de57415/c6cbb2b19ef443d39b45d334b4490f35/FLAG09239b607 [2024-11-09 08:07:13,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9de57415/c6cbb2b19ef443d39b45d334b4490f35 [2024-11-09 08:07:13,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 08:07:13,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 08:07:13,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 08:07:13,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 08:07:13,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 08:07:13,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:07:13" (1/1) ... [2024-11-09 08:07:13,571 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5edc5f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:13, skipping insertion in model container [2024-11-09 08:07:13,572 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:07:13" (1/1) ... [2024-11-09 08:07:13,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 08:07:13,860 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 08:07:13,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:07:13,878 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 08:07:13,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:07:13,936 INFO L204 MainTranslator]: Completed translation [2024-11-09 08:07:13,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:13 WrapperNode [2024-11-09 08:07:13,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 08:07:13,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 08:07:13,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 08:07:13,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 08:07:13,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:13" (1/1) ... [2024-11-09 08:07:13,974 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:13" (1/1) ... [2024-11-09 08:07:13,988 INFO L138 Inliner]: procedures = 115, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2024-11-09 08:07:13,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 08:07:13,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 08:07:13,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 08:07:13,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 08:07:13,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:13" (1/1) ... [2024-11-09 08:07:13,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:13" (1/1) ... [2024-11-09 08:07:14,000 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:13" (1/1) ... [2024-11-09 08:07:14,014 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-11-09 08:07:14,015 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:13" (1/1) ... [2024-11-09 08:07:14,015 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:13" (1/1) ... [2024-11-09 08:07:14,019 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:13" (1/1) ... [2024-11-09 08:07:14,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:13" (1/1) ... [2024-11-09 08:07:14,026 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:13" (1/1) ... [2024-11-09 08:07:14,029 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:13" (1/1) ... [2024-11-09 08:07:14,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 08:07:14,033 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 08:07:14,033 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 08:07:14,033 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 08:07:14,034 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:13" (1/1) ... [2024-11-09 08:07:14,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:07:14,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:07:14,062 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 08:07:14,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 08:07:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_node [2024-11-09 08:07:14,106 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_node [2024-11-09 08:07:14,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 08:07:14,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 08:07:14,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 08:07:14,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 08:07:14,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 08:07:14,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 08:07:14,185 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 08:07:14,187 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 08:07:14,333 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-11-09 08:07:14,333 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 08:07:14,342 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 08:07:14,342 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 08:07:14,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:07:14 BoogieIcfgContainer [2024-11-09 08:07:14,343 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 08:07:14,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 08:07:14,344 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 08:07:14,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 08:07:14,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:07:13" (1/3) ... [2024-11-09 08:07:14,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3443ff58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:07:14, skipping insertion in model container [2024-11-09 08:07:14,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:13" (2/3) ... [2024-11-09 08:07:14,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3443ff58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:07:14, skipping insertion in model container [2024-11-09 08:07:14,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:07:14" (3/3) ... [2024-11-09 08:07:14,348 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_shallow_copy-2.i [2024-11-09 08:07:14,360 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 08:07:14,360 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-09 08:07:14,390 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 08:07:14,395 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;@1a8244b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 08:07:14,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-09 08:07:14,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:07:14,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 08:07:14,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:14,404 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:14,404 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-09 08:07:14,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:14,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1794625018, now seen corresponding path program 1 times [2024-11-09 08:07:14,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 08:07:14,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453225882] [2024-11-09 08:07:14,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:14,419 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-09 08:07:14,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 08:07:14,422 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-09 08:07:14,423 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-09 08:07:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:14,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 08:07:14,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:07:14,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 08:07:14,710 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alloc_node_~temp~0#1.base| (_ BitVec 32))) (= (store |c_old(#valid)| |alloc_node_~temp~0#1.base| (_ bv1 1)) |c_#valid|)) is different from true [2024-11-09 08:07:14,749 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 08:07:14,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-09 08:07:14,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 08:07:14,771 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:07:14,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:07:14,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 08:07:14,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453225882] [2024-11-09 08:07:14,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453225882] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:07:14,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:07:14,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2024-11-09 08:07:14,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681922602] [2024-11-09 08:07:14,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:07:14,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 08:07:14,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 08:07:15,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 08:07:15,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2024-11-09 08:07:15,008 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 08:07:15,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:15,236 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-11-09 08:07:15,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:07:15,240 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 16 [2024-11-09 08:07:15,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:15,245 INFO L225 Difference]: With dead ends: 31 [2024-11-09 08:07:15,245 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 08:07:15,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2024-11-09 08:07:15,250 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:15,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 59 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 28 Unchecked, 0.2s Time] [2024-11-09 08:07:15,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 08:07:15,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-09 08:07:15,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 24 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:07:15,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2024-11-09 08:07:15,287 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 16 [2024-11-09 08:07:15,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:15,289 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2024-11-09 08:07:15,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 08:07:15,290 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2024-11-09 08:07:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 08:07:15,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:15,291 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:15,295 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-09 08:07:15,491 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-09 08:07:15,492 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-09 08:07:15,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:15,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1794625017, now seen corresponding path program 1 times [2024-11-09 08:07:15,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 08:07:15,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641261732] [2024-11-09 08:07:15,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:15,493 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-09 08:07:15,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 08:07:15,496 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-09 08:07:15,497 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-09 08:07:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:15,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 08:07:15,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:07:15,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 08:07:15,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:07:15,720 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alloc_node_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |alloc_node_~temp~0#1.base|)) (= (store |c_old(#length)| |alloc_node_~temp~0#1.base| (select |c_#length| |alloc_node_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-09 08:07:15,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:07:15,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:07:15,766 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 08:07:15,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 08:07:15,782 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 08:07:15,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:07:15,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 08:07:15,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641261732] [2024-11-09 08:07:15,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641261732] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:07:15,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1997172102] [2024-11-09 08:07:15,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:15,936 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 08:07:15,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 08:07:15,938 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 08:07:15,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-09 08:07:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:16,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 08:07:16,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:07:16,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 08:07:16,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:07:16,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:07:16,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:07:16,141 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 08:07:16,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 08:07:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 08:07:16,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:07:20,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1997172102] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:07:20,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:07:20,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-09 08:07:20,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991802234] [2024-11-09 08:07:20,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:07:20,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 08:07:20,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 08:07:20,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 08:07:20,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-11-09 08:07:20,265 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:07:20,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:20,473 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2024-11-09 08:07:20,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:07:20,474 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-11-09 08:07:20,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:20,474 INFO L225 Difference]: With dead ends: 24 [2024-11-09 08:07:20,474 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 08:07:20,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=29, Invalid=106, Unknown=1, NotChecked=20, Total=156 [2024-11-09 08:07:20,475 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:20,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 38 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 20 Unchecked, 0.1s Time] [2024-11-09 08:07:20,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 08:07:20,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 08:07:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 20 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:07:20,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2024-11-09 08:07:20,483 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 16 [2024-11-09 08:07:20,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:20,483 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2024-11-09 08:07:20,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:07:20,483 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2024-11-09 08:07:20,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 08:07:20,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:20,484 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:20,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-09 08:07:20,687 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 (3)] Forceful destruction successful, exit code 0 [2024-11-09 08:07:20,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-09 08:07:20,885 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-09 08:07:20,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:20,885 INFO L85 PathProgramCache]: Analyzing trace with hash 78968552, now seen corresponding path program 1 times [2024-11-09 08:07:20,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 08:07:20,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684794971] [2024-11-09 08:07:20,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:20,886 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-09 08:07:20,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 08:07:20,889 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-09 08:07:20,890 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-09 08:07:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:20,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 08:07:20,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:07:20,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 08:07:20,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 08:07:20,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 08:07:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:07:21,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:07:21,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 08:07:21,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684794971] [2024-11-09 08:07:21,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684794971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:21,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:21,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:07:21,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318413918] [2024-11-09 08:07:21,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:21,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:07:21,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 08:07:21,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:07:21,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:07:21,002 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:07:21,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:21,120 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2024-11-09 08:07:21,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:07:21,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-09 08:07:21,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:21,121 INFO L225 Difference]: With dead ends: 23 [2024-11-09 08:07:21,121 INFO L226 Difference]: Without dead ends: 23 [2024-11-09 08:07:21,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:07:21,122 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:21,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:07:21,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-09 08:07:21,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-09 08:07:21,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:07:21,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-11-09 08:07:21,125 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2024-11-09 08:07:21,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:21,126 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-11-09 08:07:21,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:07:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-11-09 08:07:21,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 08:07:21,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:21,126 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:21,130 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 (5)] Ended with exit code 0 [2024-11-09 08:07:21,327 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-09 08:07:21,327 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-09 08:07:21,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:21,328 INFO L85 PathProgramCache]: Analyzing trace with hash 78968553, now seen corresponding path program 1 times [2024-11-09 08:07:21,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 08:07:21,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154679351] [2024-11-09 08:07:21,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:21,329 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-09 08:07:21,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 08:07:21,331 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-09 08:07:21,332 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-09 08:07:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:21,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 08:07:21,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:07:21,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:07:21,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 08:07:21,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:07:21,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 08:07:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:07:21,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:07:21,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 08:07:21,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154679351] [2024-11-09 08:07:21,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154679351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:21,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:21,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:07:21,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378825597] [2024-11-09 08:07:21,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:21,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:07:21,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 08:07:21,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:07:21,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:07:21,500 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:07:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:21,599 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2024-11-09 08:07:21,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:07:21,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-09 08:07:21,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:21,600 INFO L225 Difference]: With dead ends: 22 [2024-11-09 08:07:21,600 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 08:07:21,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:07:21,601 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:21,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:07:21,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 08:07:21,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-09 08:07:21,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:07:21,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2024-11-09 08:07:21,609 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2024-11-09 08:07:21,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:21,609 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2024-11-09 08:07:21,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:07:21,610 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2024-11-09 08:07:21,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 08:07:21,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:21,610 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:21,614 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-09 08:07:21,810 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-09 08:07:21,811 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-09 08:07:21,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:21,811 INFO L85 PathProgramCache]: Analyzing trace with hash 570997579, now seen corresponding path program 1 times [2024-11-09 08:07:21,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 08:07:21,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318686340] [2024-11-09 08:07:21,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:21,812 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-09 08:07:21,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 08:07:21,817 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-09 08:07:21,818 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-09 08:07:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:21,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 08:07:21,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:07:22,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:07:22,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:07:22,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:07:22,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 08:07:22,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318686340] [2024-11-09 08:07:22,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318686340] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:07:22,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:07:22,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2024-11-09 08:07:22,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635979400] [2024-11-09 08:07:22,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:07:22,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 08:07:22,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 08:07:22,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 08:07:22,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-09 08:07:22,187 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:07:22,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:22,289 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2024-11-09 08:07:22,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:07:22,289 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 23 [2024-11-09 08:07:22,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:22,290 INFO L225 Difference]: With dead ends: 22 [2024-11-09 08:07:22,290 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 08:07:22,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-09 08:07:22,291 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:22,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:07:22,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 08:07:22,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-11-09 08:07:22,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:07:22,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-09 08:07:22,293 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 23 [2024-11-09 08:07:22,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:22,293 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-09 08:07:22,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:07:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-09 08:07:22,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 08:07:22,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:22,294 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:22,298 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-09 08:07:22,497 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-09 08:07:22,497 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-09 08:07:22,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:22,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1027138706, now seen corresponding path program 1 times [2024-11-09 08:07:22,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 08:07:22,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397143466] [2024-11-09 08:07:22,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:22,498 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-09 08:07:22,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 08:07:22,500 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-09 08:07:22,500 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-09 08:07:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 08:07:22,552 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 08:07:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 08:07:22,604 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 08:07:22,604 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 08:07:22,605 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (11 of 12 remaining) [2024-11-09 08:07:22,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2024-11-09 08:07:22,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2024-11-09 08:07:22,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2024-11-09 08:07:22,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2024-11-09 08:07:22,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2024-11-09 08:07:22,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2024-11-09 08:07:22,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2024-11-09 08:07:22,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 12 remaining) [2024-11-09 08:07:22,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (2 of 12 remaining) [2024-11-09 08:07:22,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (1 of 12 remaining) [2024-11-09 08:07:22,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (0 of 12 remaining) [2024-11-09 08:07:22,619 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 (8)] Forceful destruction successful, exit code 0 [2024-11-09 08:07:22,809 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-09 08:07:22,812 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-09 08:07:22,826 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 08:07:22,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 08:07:22 BoogieIcfgContainer [2024-11-09 08:07:22,829 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 08:07:22,829 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 08:07:22,829 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 08:07:22,829 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 08:07:22,830 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:07:14" (3/4) ... [2024-11-09 08:07:22,832 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 08:07:22,833 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 08:07:22,833 INFO L158 Benchmark]: Toolchain (without parser) took 9269.12ms. Allocated memory was 94.4MB in the beginning and 121.6MB in the end (delta: 27.3MB). Free memory was 65.2MB in the beginning and 76.4MB in the end (delta: -11.2MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-11-09 08:07:22,833 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 62.9MB. Free memory is still 43.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 08:07:22,834 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.99ms. Allocated memory is still 94.4MB. Free memory was 64.9MB in the beginning and 46.1MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 08:07:22,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.94ms. Allocated memory is still 94.4MB. Free memory was 46.1MB in the beginning and 71.3MB in the end (delta: -25.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 08:07:22,834 INFO L158 Benchmark]: Boogie Preprocessor took 42.49ms. Allocated memory is still 94.4MB. Free memory was 71.3MB in the beginning and 69.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 08:07:22,834 INFO L158 Benchmark]: RCFGBuilder took 309.49ms. Allocated memory is still 94.4MB. Free memory was 69.2MB in the beginning and 55.1MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 08:07:22,834 INFO L158 Benchmark]: TraceAbstraction took 8485.03ms. Allocated memory was 94.4MB in the beginning and 121.6MB in the end (delta: 27.3MB). Free memory was 54.6MB in the beginning and 76.4MB in the end (delta: -21.8MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-11-09 08:07:22,834 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 121.6MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 08:07:22,836 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.71ms. Allocated memory is still 62.9MB. Free memory is still 43.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.99ms. Allocated memory is still 94.4MB. Free memory was 64.9MB in the beginning and 46.1MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.94ms. Allocated memory is still 94.4MB. Free memory was 46.1MB in the beginning and 71.3MB in the end (delta: -25.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.49ms. Allocated memory is still 94.4MB. Free memory was 71.3MB in the beginning and 69.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 309.49ms. Allocated memory is still 94.4MB. Free memory was 69.2MB in the beginning and 55.1MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8485.03ms. Allocated memory was 94.4MB in the beginning and 121.6MB in the end (delta: 27.3MB). Free memory was 54.6MB in the beginning and 76.4MB in the end (delta: -21.8MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 121.6MB. Free memory is still 76.4MB. 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: 568]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 568. Possible FailurePath: [L569] CALL, EXPR alloc_node() [L562] struct node* temp = (struct node*) malloc(sizeof(struct node)); [L563] COND FALSE !(((void *)0) == temp) VAL [temp={1:0}] [L566] return temp; VAL [\result={1:0}] [L569] RET, EXPR alloc_node() [L569] struct node* s = alloc_node(); [L570] CALL, EXPR alloc_node() [L562] struct node* temp = (struct node*) malloc(sizeof(struct node)); [L563] COND FALSE !(((void *)0) == temp) VAL [temp={2:0}] [L566] return temp; VAL [\result={2:0}] [L570] RET, EXPR alloc_node() VAL [s={1:0}] [L570] s->next = alloc_node() [L571] EXPR s->next [L571] *s = *(s->next) [L571] *s = *(s->next) [L572] free(s) [L572] free(s) [L572] free(s) [L573] return 0; VAL [\result=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 254 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 48 IncrementalHoareTripleChecker+Unchecked, 184 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 428 IncrementalHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 70 mSDtfsCounter, 428 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 103 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 38, 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, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 140 ConstructedInterpolants, 22 QuantifiedInterpolants, 958 SizeOfPredicates, 10 NumberOfNonLiveVariables, 351 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 16/40 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-09 08:07:22,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample