./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/scopes3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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/memsafety-ext3/scopes3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f8b4bb9a8f404cd020a4d6119f922da096d098a1547934faf4c16f394bfab92c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:44:45,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:44:45,936 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 18:44:45,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:44:45,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:44:45,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:44:45,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:44:45,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:44:45,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:44:45,978 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:44:45,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:44:45,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:44:45,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:44:45,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:44:45,979 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:44:45,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:44:45,980 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:44:45,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:44:45,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:44:45,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:44:45,984 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:44:45,987 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:44:45,987 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:44:45,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:44:45,988 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:44:45,988 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:44:45,988 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:44:45,988 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:44:45,988 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:44:45,989 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:44:45,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:44:45,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:44:45,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:44:45,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:44:45,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:44:45,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:44:45,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:44:45,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:44:45,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:44:45,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:44:45,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:44:45,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:44:45,993 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 -> f8b4bb9a8f404cd020a4d6119f922da096d098a1547934faf4c16f394bfab92c [2024-11-22 18:44:46,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:44:46,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:44:46,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:44:46,288 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:44:46,289 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:44:46,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/scopes3.c [2024-11-22 18:44:47,642 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:44:47,835 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:44:47,837 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/scopes3.c [2024-11-22 18:44:47,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cb92a2fe/714f85194cf9466e9c1c843090d685c4/FLAGa11027037 [2024-11-22 18:44:47,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cb92a2fe/714f85194cf9466e9c1c843090d685c4 [2024-11-22 18:44:47,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:44:47,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:44:47,875 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:44:47,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:44:47,882 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:44:47,883 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:44:47" (1/1) ... [2024-11-22 18:44:47,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba7a8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:47, skipping insertion in model container [2024-11-22 18:44:47,884 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:44:47" (1/1) ... [2024-11-22 18:44:47,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:44:48,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:44:48,126 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:44:48,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:44:48,157 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:44:48,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:48 WrapperNode [2024-11-22 18:44:48,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:44:48,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:44:48,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:44:48,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:44:48,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:48" (1/1) ... [2024-11-22 18:44:48,174 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:48" (1/1) ... [2024-11-22 18:44:48,192 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2024-11-22 18:44:48,192 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:44:48,193 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:44:48,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:44:48,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:44:48,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:48" (1/1) ... [2024-11-22 18:44:48,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:48" (1/1) ... [2024-11-22 18:44:48,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:48" (1/1) ... [2024-11-22 18:44:48,217 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 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-22 18:44:48,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:48" (1/1) ... [2024-11-22 18:44:48,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:48" (1/1) ... [2024-11-22 18:44:48,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:48" (1/1) ... [2024-11-22 18:44:48,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:48" (1/1) ... [2024-11-22 18:44:48,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:48" (1/1) ... [2024-11-22 18:44:48,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:48" (1/1) ... [2024-11-22 18:44:48,230 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:44:48,235 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:44:48,235 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:44:48,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:44:48,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:48" (1/1) ... [2024-11-22 18:44:48,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:44:48,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:44:48,271 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-22 18:44:48,278 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-22 18:44:48,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 18:44:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:44:48,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:44:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 18:44:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:44:48,384 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:44:48,387 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:44:48,525 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-22 18:44:48,525 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:44:48,539 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:44:48,540 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 18:44:48,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:44:48 BoogieIcfgContainer [2024-11-22 18:44:48,542 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:44:48,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:44:48,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:44:48,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:44:48,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:44:47" (1/3) ... [2024-11-22 18:44:48,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e22f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:44:48, skipping insertion in model container [2024-11-22 18:44:48,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:48" (2/3) ... [2024-11-22 18:44:48,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e22f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:44:48, skipping insertion in model container [2024-11-22 18:44:48,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:44:48" (3/3) ... [2024-11-22 18:44:48,552 INFO L112 eAbstractionObserver]: Analyzing ICFG scopes3.c [2024-11-22 18:44:48,567 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:44:48,567 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-11-22 18:44:48,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:44:48,608 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;@7f75b5f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:44:48,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-22 18:44:48,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:44:48,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-22 18:44:48,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:44:48,618 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-22 18:44:48,619 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-11-22 18:44:48,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:44:48,625 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-11-22 18:44:48,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:44:48,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601867491] [2024-11-22 18:44:48,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:48,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:44:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:48,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:44:48,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:44:48,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601867491] [2024-11-22 18:44:48,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601867491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:44:48,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:44:48,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:44:48,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132235285] [2024-11-22 18:44:48,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:44:48,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:44:48,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:44:48,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:44:48,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:44:48,928 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 16 states have internal predecessors, (18), 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 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:44:48,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:44:48,975 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-11-22 18:44:48,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:44:48,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-22 18:44:48,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:44:48,984 INFO L225 Difference]: With dead ends: 16 [2024-11-22 18:44:48,985 INFO L226 Difference]: Without dead ends: 14 [2024-11-22 18:44:48,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:44:48,990 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:44:48,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:44:49,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-22 18:44:49,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-22 18:44:49,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.4) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:44:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-11-22 18:44:49,018 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 4 [2024-11-22 18:44:49,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:44:49,019 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-11-22 18:44:49,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:44:49,019 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-11-22 18:44:49,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-22 18:44:49,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:44:49,020 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-22 18:44:49,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 18:44:49,021 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-11-22 18:44:49,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:44:49,022 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2024-11-22 18:44:49,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:44:49,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124161929] [2024-11-22 18:44:49,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:49,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:44:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:44:49,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:44:49,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124161929] [2024-11-22 18:44:49,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124161929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:44:49,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:44:49,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:44:49,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095826982] [2024-11-22 18:44:49,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:44:49,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:44:49,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:44:49,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:44:49,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:44:49,136 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:44:49,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:44:49,162 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-11-22 18:44:49,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:44:49,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-22 18:44:49,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:44:49,163 INFO L225 Difference]: With dead ends: 16 [2024-11-22 18:44:49,163 INFO L226 Difference]: Without dead ends: 16 [2024-11-22 18:44:49,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:44:49,165 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:44:49,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 19 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:44:49,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-22 18:44:49,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-22 18:44:49,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:44:49,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-22 18:44:49,173 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 4 [2024-11-22 18:44:49,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:44:49,173 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-22 18:44:49,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:44:49,174 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-11-22 18:44:49,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 18:44:49,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:44:49,175 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 18:44:49,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 18:44:49,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-11-22 18:44:49,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:44:49,178 INFO L85 PathProgramCache]: Analyzing trace with hash 28697063, now seen corresponding path program 1 times [2024-11-22 18:44:49,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:44:49,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336704601] [2024-11-22 18:44:49,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:49,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:44:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:49,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:44:49,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:44:49,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336704601] [2024-11-22 18:44:49,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336704601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:44:49,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:44:49,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:44:49,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162949736] [2024-11-22 18:44:49,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:44:49,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:44:49,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:44:49,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:44:49,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:44:49,209 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-11-22 18:44:49,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:44:49,219 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-11-22 18:44:49,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:44:49,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-11-22 18:44:49,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:44:49,220 INFO L225 Difference]: With dead ends: 16 [2024-11-22 18:44:49,221 INFO L226 Difference]: Without dead ends: 16 [2024-11-22 18:44:49,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:44:49,222 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:44:49,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 17 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:44:49,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-22 18:44:49,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2024-11-22 18:44:49,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 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-11-22 18:44:49,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-22 18:44:49,226 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 5 [2024-11-22 18:44:49,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:44:49,226 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-22 18:44:49,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-11-22 18:44:49,227 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-22 18:44:49,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 18:44:49,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:44:49,228 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:44:49,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 18:44:49,228 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-11-22 18:44:49,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:44:49,229 INFO L85 PathProgramCache]: Analyzing trace with hash -392422972, now seen corresponding path program 1 times [2024-11-22 18:44:49,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:44:49,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523194936] [2024-11-22 18:44:49,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:49,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:44:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:44:49,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:44:49,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523194936] [2024-11-22 18:44:49,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523194936] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:44:49,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431514024] [2024-11-22 18:44:49,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:49,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:44:49,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:44:49,292 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-22 18:44:49,294 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-22 18:44:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:49,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 18:44:49,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:44:49,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:44:49,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:44:49,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:44:49,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431514024] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:44:49,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:44:49,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-22 18:44:49,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640040099] [2024-11-22 18:44:49,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:44:49,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:44:49,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:44:49,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:44:49,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:44:49,453 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-11-22 18:44:49,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:44:49,492 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2024-11-22 18:44:49,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:44:49,493 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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) Word has length 9 [2024-11-22 18:44:49,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:44:49,494 INFO L225 Difference]: With dead ends: 25 [2024-11-22 18:44:49,494 INFO L226 Difference]: Without dead ends: 25 [2024-11-22 18:44:49,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:44:49,496 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:44:49,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 31 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:44:49,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-22 18:44:49,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-22 18:44:49,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 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-11-22 18:44:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2024-11-22 18:44:49,501 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 9 [2024-11-22 18:44:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:44:49,501 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2024-11-22 18:44:49,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-11-22 18:44:49,502 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2024-11-22 18:44:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 18:44:49,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:44:49,503 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1] [2024-11-22 18:44:49,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 18:44:49,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:44:49,708 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-11-22 18:44:49,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:44:49,709 INFO L85 PathProgramCache]: Analyzing trace with hash 519338587, now seen corresponding path program 2 times [2024-11-22 18:44:49,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:44:49,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016508881] [2024-11-22 18:44:49,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:44:49,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:44:49,745 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:44:49,749 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:44:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:44:49,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:44:49,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016508881] [2024-11-22 18:44:49,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016508881] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:44:49,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068457524] [2024-11-22 18:44:49,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:44:49,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:44:49,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:44:49,934 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-22 18:44:49,937 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-22 18:44:50,014 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:44:50,015 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:44:50,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 18:44:50,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:44:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:44:50,069 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:44:50,164 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:44:50,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068457524] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:44:50,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:44:50,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-22 18:44:50,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879435136] [2024-11-22 18:44:50,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:44:50,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 18:44:50,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:44:50,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 18:44:50,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-22 18:44:50,169 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:44:50,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:44:50,215 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2024-11-22 18:44:50,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 18:44:50,215 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 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 21 [2024-11-22 18:44:50,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:44:50,216 INFO L225 Difference]: With dead ends: 49 [2024-11-22 18:44:50,216 INFO L226 Difference]: Without dead ends: 49 [2024-11-22 18:44:50,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-22 18:44:50,218 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:44:50,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 40 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:44:50,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-22 18:44:50,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-22 18:44:50,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 48 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:44:50,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2024-11-22 18:44:50,225 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 21 [2024-11-22 18:44:50,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:44:50,225 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2024-11-22 18:44:50,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:44:50,226 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2024-11-22 18:44:50,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-22 18:44:50,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:44:50,227 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1] [2024-11-22 18:44:50,234 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-22 18:44:50,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:44:50,429 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-11-22 18:44:50,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:44:50,429 INFO L85 PathProgramCache]: Analyzing trace with hash 649821193, now seen corresponding path program 3 times [2024-11-22 18:44:50,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:44:50,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836669133] [2024-11-22 18:44:50,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 18:44:50,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:44:50,589 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-22 18:44:50,589 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 18:44:50,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 18:44:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 18:44:50,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 18:44:50,675 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 18:44:50,676 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 5 remaining) [2024-11-22 18:44:50,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2024-11-22 18:44:50,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2024-11-22 18:44:50,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2024-11-22 18:44:50,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-11-22 18:44:50,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 18:44:50,682 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-11-22 18:44:50,715 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 18:44:50,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 06:44:50 BoogieIcfgContainer [2024-11-22 18:44:50,718 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 18:44:50,718 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 18:44:50,719 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 18:44:50,719 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 18:44:50,719 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:44:48" (3/4) ... [2024-11-22 18:44:50,720 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 18:44:50,783 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 18:44:50,783 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 18:44:50,784 INFO L158 Benchmark]: Toolchain (without parser) took 2911.57ms. Allocated memory was 174.1MB in the beginning and 218.1MB in the end (delta: 44.0MB). Free memory was 105.2MB in the beginning and 148.1MB in the end (delta: -43.0MB). Peak memory consumption was 530.5kB. Max. memory is 16.1GB. [2024-11-22 18:44:50,784 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 174.1MB. Free memory was 142.5MB in the beginning and 142.5MB in the end (delta: 16.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 18:44:50,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.88ms. Allocated memory is still 174.1MB. Free memory was 104.7MB in the beginning and 138.6MB in the end (delta: -34.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-22 18:44:50,785 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.12ms. Allocated memory is still 174.1MB. Free memory was 138.6MB in the beginning and 137.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 18:44:50,785 INFO L158 Benchmark]: Boogie Preprocessor took 41.20ms. Allocated memory is still 174.1MB. Free memory was 137.4MB in the beginning and 136.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 18:44:50,785 INFO L158 Benchmark]: RCFGBuilder took 306.91ms. Allocated memory is still 174.1MB. Free memory was 136.2MB in the beginning and 126.0MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-22 18:44:50,785 INFO L158 Benchmark]: TraceAbstraction took 2174.38ms. Allocated memory was 174.1MB in the beginning and 218.1MB in the end (delta: 44.0MB). Free memory was 124.8MB in the beginning and 151.3MB in the end (delta: -26.5MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-11-22 18:44:50,786 INFO L158 Benchmark]: Witness Printer took 64.89ms. Allocated memory is still 218.1MB. Free memory was 151.3MB in the beginning and 148.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 18:44:50,790 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.20ms. Allocated memory is still 174.1MB. Free memory was 142.5MB in the beginning and 142.5MB in the end (delta: 16.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.88ms. Allocated memory is still 174.1MB. Free memory was 104.7MB in the beginning and 138.6MB in the end (delta: -34.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.12ms. Allocated memory is still 174.1MB. Free memory was 138.6MB in the beginning and 137.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.20ms. Allocated memory is still 174.1MB. Free memory was 137.4MB in the beginning and 136.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 306.91ms. Allocated memory is still 174.1MB. Free memory was 136.2MB in the beginning and 126.0MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2174.38ms. Allocated memory was 174.1MB in the beginning and 218.1MB in the end (delta: 44.0MB). Free memory was 124.8MB in the beginning and 151.3MB in the end (delta: -26.5MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * Witness Printer took 64.89ms. Allocated memory is still 218.1MB. Free memory was 151.3MB in the beginning and 148.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. 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: [L2] int* p; [L3] int i = 0; VAL [i=0] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=0, p={3:0}] [L6] p[0] = 1 [L3] i++ VAL [i=1, p={3:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=1, p={4:0}] [L6] p[0] = 1 [L3] i++ VAL [i=2, p={4:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=2, p={5:0}] [L6] p[0] = 1 [L3] i++ VAL [i=3, p={5:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=3, p={6:0}] [L6] p[0] = 1 [L3] i++ VAL [i=4, p={6:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=4, p={7:0}] [L6] p[0] = 1 [L3] i++ VAL [i=5, p={7:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=5, p={8:0}] [L6] p[0] = 1 [L3] i++ VAL [i=6, p={8:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=6, p={9:0}] [L6] p[0] = 1 [L3] i++ VAL [i=7, p={9:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=7, p={10:0}] [L6] p[0] = 1 [L3] i++ VAL [i=8, p={10:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=8, p={11:0}] [L6] p[0] = 1 [L3] i++ VAL [i=9, p={11:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=9, p={2:0}] [L6] p[0] = 1 [L3] i++ VAL [i=10, p={2:0}] [L3] COND FALSE !(i < 10) VAL [p={2:0}] [L8] p[0] = 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: -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 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, 17 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 125 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 70 IncrementalHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 57 mSDtfsCounter, 70 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=5, InterpolantAutomatonStates: 27, 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 240 SizeOfPredicates, 0 NumberOfNonLiveVariables, 172 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 0/87 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-22 18:44:50,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)