./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/realloc1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/realloc1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 ac04f74b68086890b55eca7e645e90e8df8a67932fce57d15e9ba2378d355360 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:01:13,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:01:13,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:01:13,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:01:13,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:01:13,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:01:13,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:01:13,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:01:13,784 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:01:13,785 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:01:13,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:01:13,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:01:13,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:01:13,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:01:13,789 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:01:13,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:01:13,790 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:01:13,790 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:01:13,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:01:13,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:01:13,791 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:01:13,792 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:01:13,792 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:01:13,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:01:13,793 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:01:13,793 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:01:13,793 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:01:13,794 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:01:13,794 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:01:13,794 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:01:13,794 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:01:13,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:01:13,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:01:13,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:01:13,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:01:13,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:01:13,797 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:01:13,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:01:13,798 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:01:13,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:01:13,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:01:13,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:01:13,799 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-clean/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-clean/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 -> ac04f74b68086890b55eca7e645e90e8df8a67932fce57d15e9ba2378d355360 [2024-10-11 18:01:14,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:01:14,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:01:14,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:01:14,067 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:01:14,067 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:01:14,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/realloc1.c [2024-10-11 18:01:15,485 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:01:15,707 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:01:15,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/realloc1.c [2024-10-11 18:01:15,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5f45743c6/3a978c87ca1d4e7cb148e01976a3eb1d/FLAG851415b03 [2024-10-11 18:01:15,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5f45743c6/3a978c87ca1d4e7cb148e01976a3eb1d [2024-10-11 18:01:15,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:01:15,738 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:01:15,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:01:15,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:01:15,749 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:01:15,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:01:15" (1/1) ... [2024-10-11 18:01:15,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5babb0bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:15, skipping insertion in model container [2024-10-11 18:01:15,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:01:15" (1/1) ... [2024-10-11 18:01:15,773 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:01:15,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:01:15,952 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:01:15,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:01:15,978 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:01:15,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:15 WrapperNode [2024-10-11 18:01:15,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:01:15,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:01:15,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:01:15,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:01:15,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:15" (1/1) ... [2024-10-11 18:01:15,999 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:15" (1/1) ... [2024-10-11 18:01:16,014 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2024-10-11 18:01:16,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:01:16,015 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:01:16,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:01:16,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:01:16,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:15" (1/1) ... [2024-10-11 18:01:16,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:15" (1/1) ... [2024-10-11 18:01:16,025 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:15" (1/1) ... [2024-10-11 18:01:16,031 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-10-11 18:01:16,032 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:15" (1/1) ... [2024-10-11 18:01:16,032 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:15" (1/1) ... [2024-10-11 18:01:16,036 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:15" (1/1) ... [2024-10-11 18:01:16,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:15" (1/1) ... [2024-10-11 18:01:16,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:15" (1/1) ... [2024-10-11 18:01:16,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:15" (1/1) ... [2024-10-11 18:01:16,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:01:16,044 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:01:16,044 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:01:16,044 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:01:16,045 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:15" (1/1) ... [2024-10-11 18:01:16,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:01:16,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:16,087 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:01:16,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:01:16,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 18:01:16,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:01:16,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:01:16,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:01:16,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 18:01:16,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:01:16,230 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:01:16,236 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:01:16,416 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-10-11 18:01:16,416 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:01:16,450 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:01:16,450 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 18:01:16,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:01:16 BoogieIcfgContainer [2024-10-11 18:01:16,451 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:01:16,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:01:16,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:01:16,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:01:16,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:01:15" (1/3) ... [2024-10-11 18:01:16,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e7fc764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:01:16, skipping insertion in model container [2024-10-11 18:01:16,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:15" (2/3) ... [2024-10-11 18:01:16,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e7fc764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:01:16, skipping insertion in model container [2024-10-11 18:01:16,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:01:16" (3/3) ... [2024-10-11 18:01:16,463 INFO L112 eAbstractionObserver]: Analyzing ICFG realloc1.c [2024-10-11 18:01:16,482 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:01:16,483 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-11 18:01:16,540 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:01:16,549 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;@362f13a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:01:16,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 18:01:16,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:16,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 18:01:16,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:16,566 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 18:01:16,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2024-10-11 18:01:16,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:16,575 INFO L85 PathProgramCache]: Analyzing trace with hash 77202, now seen corresponding path program 1 times [2024-10-11 18:01:16,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:16,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980107730] [2024-10-11 18:01:16,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:16,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:16,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:16,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980107730] [2024-10-11 18:01:16,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980107730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:16,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:16,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:01:16,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920978061] [2024-10-11 18:01:16,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:16,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:01:16,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:16,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:01:16,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:01:16,862 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:16,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:16,919 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2024-10-11 18:01:16,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:01:16,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 18:01:16,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:16,937 INFO L225 Difference]: With dead ends: 23 [2024-10-11 18:01:16,938 INFO L226 Difference]: Without dead ends: 22 [2024-10-11 18:01:16,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:01:16,945 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:16,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 15 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:01:16,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-11 18:01:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2024-10-11 18:01:16,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-10-11 18:01:16,982 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 3 [2024-10-11 18:01:16,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:16,983 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-10-11 18:01:16,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:16,983 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-10-11 18:01:16,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 18:01:16,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:16,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 18:01:16,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:01:16,986 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2024-10-11 18:01:16,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:16,987 INFO L85 PathProgramCache]: Analyzing trace with hash 77203, now seen corresponding path program 1 times [2024-10-11 18:01:16,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:16,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909302514] [2024-10-11 18:01:16,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:16,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:17,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:17,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:17,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909302514] [2024-10-11 18:01:17,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909302514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:17,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:17,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:01:17,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711157019] [2024-10-11 18:01:17,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:17,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:01:17,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:17,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:01:17,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:01:17,155 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:17,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:17,217 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-10-11 18:01:17,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:01:17,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 18:01:17,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:17,219 INFO L225 Difference]: With dead ends: 21 [2024-10-11 18:01:17,219 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 18:01:17,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:01:17,221 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:17,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:01:17,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 18:01:17,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-11 18:01:17,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-10-11 18:01:17,247 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 3 [2024-10-11 18:01:17,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:17,249 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-10-11 18:01:17,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:17,250 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-10-11 18:01:17,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:01:17,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:17,251 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1] [2024-10-11 18:01:17,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:01:17,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2024-10-11 18:01:17,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:17,254 INFO L85 PathProgramCache]: Analyzing trace with hash 74228924, now seen corresponding path program 1 times [2024-10-11 18:01:17,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:17,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101317696] [2024-10-11 18:01:17,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:17,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:17,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:17,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:17,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101317696] [2024-10-11 18:01:17,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101317696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:17,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:17,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:01:17,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162214786] [2024-10-11 18:01:17,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:17,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:01:17,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:17,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:01:17,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:01:17,471 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:17,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:17,519 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-10-11 18:01:17,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:01:17,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 18:01:17,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:17,521 INFO L225 Difference]: With dead ends: 20 [2024-10-11 18:01:17,521 INFO L226 Difference]: Without dead ends: 20 [2024-10-11 18:01:17,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:01:17,522 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:17,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:01:17,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-11 18:01:17,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2024-10-11 18:01:17,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.5) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:17,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-10-11 18:01:17,527 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 5 [2024-10-11 18:01:17,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:17,528 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-10-11 18:01:17,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:17,528 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-10-11 18:01:17,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 18:01:17,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:17,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 18:01:17,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:01:17,529 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2024-10-11 18:01:17,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:17,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1993872336, now seen corresponding path program 1 times [2024-10-11 18:01:17,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:17,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117189864] [2024-10-11 18:01:17,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:17,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:17,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:01:17,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:17,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117189864] [2024-10-11 18:01:17,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117189864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:17,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:17,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:01:17,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613159728] [2024-10-11 18:01:17,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:17,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:01:17,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:17,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:01:17,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:01:17,586 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:17,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:17,602 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2024-10-11 18:01:17,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:01:17,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 18:01:17,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:17,607 INFO L225 Difference]: With dead ends: 21 [2024-10-11 18:01:17,608 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 18:01:17,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:01:17,609 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:17,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 18 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:01:17,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 18:01:17,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-10-11 18:01:17,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:17,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-10-11 18:01:17,621 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 6 [2024-10-11 18:01:17,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:17,621 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-10-11 18:01:17,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:17,621 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-10-11 18:01:17,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 18:01:17,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:17,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:17,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:01:17,622 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2024-10-11 18:01:17,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:17,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1680500218, now seen corresponding path program 1 times [2024-10-11 18:01:17,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:17,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510535326] [2024-10-11 18:01:17,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:17,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:01:17,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:17,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510535326] [2024-10-11 18:01:17,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510535326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:17,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:17,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:01:17,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87795105] [2024-10-11 18:01:17,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:17,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:01:17,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:17,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:01:17,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:01:17,686 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:17,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:17,717 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-10-11 18:01:17,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:01:17,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 18:01:17,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:17,719 INFO L225 Difference]: With dead ends: 20 [2024-10-11 18:01:17,719 INFO L226 Difference]: Without dead ends: 20 [2024-10-11 18:01:17,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:01:17,720 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:17,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 13 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:01:17,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-11 18:01:17,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2024-10-11 18:01:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:17,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-10-11 18:01:17,730 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 7 [2024-10-11 18:01:17,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:17,730 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-10-11 18:01:17,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:17,730 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-10-11 18:01:17,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 18:01:17,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:17,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:17,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:01:17,732 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2024-10-11 18:01:17,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:17,733 INFO L85 PathProgramCache]: Analyzing trace with hash -53004407, now seen corresponding path program 1 times [2024-10-11 18:01:17,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:17,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270528199] [2024-10-11 18:01:17,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:17,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:17,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:17,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:17,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270528199] [2024-10-11 18:01:17,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270528199] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:17,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621981085] [2024-10-11 18:01:17,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:17,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:17,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:17,782 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:17,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:01:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:17,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 18:01:17,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:17,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:17,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:17,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:17,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621981085] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:17,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:17,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-10-11 18:01:17,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179939008] [2024-10-11 18:01:17,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:17,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:01:17,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:17,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:01:17,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:01:17,908 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:17,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:17,940 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2024-10-11 18:01:17,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:01:17,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 18:01:17,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:17,943 INFO L225 Difference]: With dead ends: 23 [2024-10-11 18:01:17,943 INFO L226 Difference]: Without dead ends: 23 [2024-10-11 18:01:17,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:01:17,945 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:17,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:01:17,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-11 18:01:17,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-11 18:01:17,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:17,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2024-10-11 18:01:17,950 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 9 [2024-10-11 18:01:17,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:17,950 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2024-10-11 18:01:17,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:17,951 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2024-10-11 18:01:17,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:01:17,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:17,951 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:17,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:18,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:18,153 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2024-10-11 18:01:18,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:18,154 INFO L85 PathProgramCache]: Analyzing trace with hash 499810820, now seen corresponding path program 2 times [2024-10-11 18:01:18,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:18,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546381231] [2024-10-11 18:01:18,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:18,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:18,253 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:18,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:18,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546381231] [2024-10-11 18:01:18,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546381231] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:18,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858372646] [2024-10-11 18:01:18,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:01:18,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:18,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:18,256 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:18,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:01:18,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:01:18,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:01:18,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 18:01:18,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:18,365 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:18,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858372646] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:18,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:18,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-11 18:01:18,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180253454] [2024-10-11 18:01:18,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:18,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:01:18,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:18,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:01:18,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:01:18,474 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:18,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:18,531 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2024-10-11 18:01:18,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:01:18,533 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 18:01:18,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:18,534 INFO L225 Difference]: With dead ends: 35 [2024-10-11 18:01:18,534 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 18:01:18,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:01:18,535 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:18,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:01:18,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 18:01:18,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-11 18:01:18,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2024-10-11 18:01:18,542 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 15 [2024-10-11 18:01:18,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:18,545 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2024-10-11 18:01:18,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:18,546 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2024-10-11 18:01:18,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:01:18,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:18,547 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:18,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:18,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:18,748 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2024-10-11 18:01:18,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:18,749 INFO L85 PathProgramCache]: Analyzing trace with hash 965029434, now seen corresponding path program 3 times [2024-10-11 18:01:18,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:18,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212377308] [2024-10-11 18:01:18,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:18,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 18:01:18,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 18:01:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 18:01:18,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 18:01:18,874 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 18:01:18,876 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 8 remaining) [2024-10-11 18:01:18,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 8 remaining) [2024-10-11 18:01:18,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2024-10-11 18:01:18,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (4 of 8 remaining) [2024-10-11 18:01:18,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (3 of 8 remaining) [2024-10-11 18:01:18,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (2 of 8 remaining) [2024-10-11 18:01:18,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 8 remaining) [2024-10-11 18:01:18,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-10-11 18:01:18,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 18:01:18,881 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2024-10-11 18:01:18,921 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 18:01:18,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:01:18 BoogieIcfgContainer [2024-10-11 18:01:18,926 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 18:01:18,928 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 18:01:18,928 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 18:01:18,928 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 18:01:18,929 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:01:16" (3/4) ... [2024-10-11 18:01:18,930 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 18:01:18,965 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 18:01:18,966 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 18:01:18,966 INFO L158 Benchmark]: Toolchain (without parser) took 3229.58ms. Allocated memory was 182.5MB in the beginning and 260.0MB in the end (delta: 77.6MB). Free memory was 133.3MB in the beginning and 147.2MB in the end (delta: -14.0MB). Peak memory consumption was 66.5MB. Max. memory is 16.1GB. [2024-10-11 18:01:18,967 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:01:18,967 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.39ms. Allocated memory is still 182.5MB. Free memory was 133.0MB in the beginning and 121.3MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 18:01:18,967 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.24ms. Allocated memory is still 182.5MB. Free memory was 121.3MB in the beginning and 119.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 18:01:18,968 INFO L158 Benchmark]: Boogie Preprocessor took 27.69ms. Allocated memory is still 182.5MB. Free memory was 119.8MB in the beginning and 118.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:01:18,969 INFO L158 Benchmark]: RCFGBuilder took 407.34ms. Allocated memory is still 182.5MB. Free memory was 118.3MB in the beginning and 105.1MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 18:01:18,969 INFO L158 Benchmark]: TraceAbstraction took 2471.15ms. Allocated memory was 182.5MB in the beginning and 260.0MB in the end (delta: 77.6MB). Free memory was 104.0MB in the beginning and 150.4MB in the end (delta: -46.4MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2024-10-11 18:01:18,969 INFO L158 Benchmark]: Witness Printer took 38.28ms. Allocated memory is still 260.0MB. Free memory was 149.3MB in the beginning and 147.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 18:01:18,971 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.12ms. Allocated memory is still 182.5MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.39ms. Allocated memory is still 182.5MB. Free memory was 133.0MB in the beginning and 121.3MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.24ms. Allocated memory is still 182.5MB. Free memory was 121.3MB in the beginning and 119.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.69ms. Allocated memory is still 182.5MB. Free memory was 119.8MB in the beginning and 118.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 407.34ms. Allocated memory is still 182.5MB. Free memory was 118.3MB in the beginning and 105.1MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2471.15ms. Allocated memory was 182.5MB in the beginning and 260.0MB in the end (delta: 77.6MB). Free memory was 104.0MB in the beginning and 150.4MB in the end (delta: -46.4MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. * Witness Printer took 38.28ms. Allocated memory is still 260.0MB. Free memory was 149.3MB in the beginning and 147.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L8] char* p = malloc(10 * sizeof(int)); [L10] int i = 0; VAL [i=0, p={-1:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() [L10] i++ VAL [i=1, p={-1:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() [L10] i++ VAL [i=2, p={-1:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() [L10] i++ VAL [i=3, p={-1:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() [L10] i++ VAL [i=4, p={-1:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() [L10] i++ VAL [i=5, p={-1:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() [L10] i++ VAL [i=6, p={-1:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() [L10] i++ VAL [i=7, p={-1:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() [L10] i++ VAL [i=8, p={-1:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() [L10] i++ VAL [i=9, p={-1:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() [L10] i++ VAL [i=10, p={-1:0}] [L10] COND FALSE !(i < 10) VAL [p={-1:0}] [L14] free(p) VAL [p={-1:0}] [L14] free(p) VAL [p={-1:0}] [L14] free(p) [L16] p[2] - 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: 14]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that free always succeeds Unable to prove that free 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: 7]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 157 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 120 IncrementalHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 100 mSDtfsCounter, 120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=7, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 256 SizeOfPredicates, 0 NumberOfNonLiveVariables, 125 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 4/55 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 18:01:18,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)