./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/reverse_array_alloca_unsafe.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/reverse_array_alloca_unsafe.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 67e6429a6543f453ac429a23a8d2fcad0657c53add4186ba92445fb458193f20 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:31:59,626 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:31:59,678 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 10:31:59,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:31:59,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:31:59,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:31:59,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:31:59,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:31:59,712 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:31:59,712 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:31:59,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:31:59,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:31:59,713 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:31:59,713 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:31:59,717 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:31:59,718 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:31:59,718 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:31:59,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:31:59,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:31:59,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:31:59,719 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:31:59,720 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:31:59,721 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:31:59,721 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:31:59,721 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:31:59,721 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:31:59,721 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:31:59,722 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:31:59,722 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:31:59,722 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:31:59,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:31:59,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:31:59,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:31:59,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:31:59,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:31:59,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:31:59,723 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:31:59,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:31:59,723 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:31:59,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:31:59,724 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:31:59,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:31:59,726 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 -> 67e6429a6543f453ac429a23a8d2fcad0657c53add4186ba92445fb458193f20 [2024-10-13 10:31:59,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:31:59,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:31:59,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:32:00,000 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:32:00,001 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:32:00,002 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/reverse_array_alloca_unsafe.i [2024-10-13 10:32:01,476 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:32:01,659 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:32:01,660 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/reverse_array_alloca_unsafe.i [2024-10-13 10:32:01,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4f7c09c8/605489bbe644429b8ac2487a8c2986f7/FLAGa77e5622e [2024-10-13 10:32:02,035 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4f7c09c8/605489bbe644429b8ac2487a8c2986f7 [2024-10-13 10:32:02,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:32:02,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:32:02,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:32:02,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:32:02,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:32:02,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:32:02" (1/1) ... [2024-10-13 10:32:02,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18cd19af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:02, skipping insertion in model container [2024-10-13 10:32:02,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:32:02" (1/1) ... [2024-10-13 10:32:02,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:32:02,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:32:02,354 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:32:02,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:32:02,405 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:32:02,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:02 WrapperNode [2024-10-13 10:32:02,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:32:02,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:32:02,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:32:02,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:32:02,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:02" (1/1) ... [2024-10-13 10:32:02,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:02" (1/1) ... [2024-10-13 10:32:02,501 INFO L138 Inliner]: procedures = 116, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 83 [2024-10-13 10:32:02,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:32:02,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:32:02,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:32:02,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:32:02,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:02" (1/1) ... [2024-10-13 10:32:02,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:02" (1/1) ... [2024-10-13 10:32:02,515 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:02" (1/1) ... [2024-10-13 10:32:02,525 INFO L175 MemorySlicer]: Split 11 memory accesses to 1 slices as follows [11]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 5 writes are split as follows [5]. [2024-10-13 10:32:02,525 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:02" (1/1) ... [2024-10-13 10:32:02,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:02" (1/1) ... [2024-10-13 10:32:02,529 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:02" (1/1) ... [2024-10-13 10:32:02,531 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:02" (1/1) ... [2024-10-13 10:32:02,532 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:02" (1/1) ... [2024-10-13 10:32:02,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:02" (1/1) ... [2024-10-13 10:32:02,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:32:02,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:32:02,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:32:02,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:32:02,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:02" (1/1) ... [2024-10-13 10:32:02,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:32:02,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:32:02,560 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-10-13 10:32:02,564 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-10-13 10:32:02,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 10:32:02,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 10:32:02,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:32:02,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:32:02,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:32:02,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:32:02,701 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:32:02,704 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:32:02,892 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2024-10-13 10:32:02,893 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:32:02,935 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:32:02,939 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-13 10:32:02,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:32:02 BoogieIcfgContainer [2024-10-13 10:32:02,940 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:32:02,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:32:02,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:32:02,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:32:02,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:32:02" (1/3) ... [2024-10-13 10:32:02,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@429af0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:32:02, skipping insertion in model container [2024-10-13 10:32:02,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:02" (2/3) ... [2024-10-13 10:32:02,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@429af0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:32:02, skipping insertion in model container [2024-10-13 10:32:02,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:32:02" (3/3) ... [2024-10-13 10:32:02,955 INFO L112 eAbstractionObserver]: Analyzing ICFG reverse_array_alloca_unsafe.i [2024-10-13 10:32:02,978 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:32:02,979 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-10-13 10:32:03,017 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:32:03,022 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;@7a60676f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:32:03,022 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-10-13 10:32:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 24 states have (on average 2.375) internal successors, (57), 47 states have internal predecessors, (57), 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-13 10:32:03,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:32:03,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:32:03,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:32:03,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-13 10:32:03,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:32:03,037 INFO L85 PathProgramCache]: Analyzing trace with hash 32994964, now seen corresponding path program 1 times [2024-10-13 10:32:03,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:32:03,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189099787] [2024-10-13 10:32:03,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:32:03,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:32:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:32:03,222 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-13 10:32:03,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:32:03,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189099787] [2024-10-13 10:32:03,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189099787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:32:03,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:32:03,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:32:03,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867531135] [2024-10-13 10:32:03,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:32:03,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:32:03,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:32:03,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:32:03,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:32:03,258 INFO L87 Difference]: Start difference. First operand has 48 states, 24 states have (on average 2.375) internal successors, (57), 47 states have internal predecessors, (57), 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 3.0) internal successors, (6), 3 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-13 10:32:03,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:32:03,318 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-10-13 10:32:03,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:32:03,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-13 10:32:03,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:32:03,325 INFO L225 Difference]: With dead ends: 43 [2024-10-13 10:32:03,326 INFO L226 Difference]: Without dead ends: 42 [2024-10-13 10:32:03,327 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-10-13 10:32:03,330 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:32:03,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 46 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:32:03,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-13 10:32:03,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-13 10:32:03,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 2.0) internal successors, (48), 41 states have internal predecessors, (48), 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-13 10:32:03,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-10-13 10:32:03,355 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 6 [2024-10-13 10:32:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:32:03,356 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-10-13 10:32:03,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-13 10:32:03,356 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-10-13 10:32:03,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:32:03,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:32:03,356 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:32:03,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:32:03,357 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-13 10:32:03,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:32:03,357 INFO L85 PathProgramCache]: Analyzing trace with hash 32994965, now seen corresponding path program 1 times [2024-10-13 10:32:03,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:32:03,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186837611] [2024-10-13 10:32:03,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:32:03,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:32:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:32:03,453 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-13 10:32:03,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:32:03,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186837611] [2024-10-13 10:32:03,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186837611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:32:03,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:32:03,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:32:03,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336919310] [2024-10-13 10:32:03,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:32:03,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:32:03,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:32:03,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:32:03,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:32:03,458 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-13 10:32:03,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:32:03,489 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-10-13 10:32:03,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:32:03,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-13 10:32:03,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:32:03,490 INFO L225 Difference]: With dead ends: 43 [2024-10-13 10:32:03,490 INFO L226 Difference]: Without dead ends: 43 [2024-10-13 10:32:03,490 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-10-13 10:32:03,491 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:32:03,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 51 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:32:03,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-13 10:32:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-13 10:32:03,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.96) internal successors, (49), 42 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-10-13 10:32:03,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-10-13 10:32:03,495 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 6 [2024-10-13 10:32:03,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:32:03,496 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-10-13 10:32:03,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-13 10:32:03,496 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-10-13 10:32:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:32:03,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:32:03,496 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:32:03,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:32:03,497 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-13 10:32:03,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:32:03,497 INFO L85 PathProgramCache]: Analyzing trace with hash 33054547, now seen corresponding path program 1 times [2024-10-13 10:32:03,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:32:03,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406764627] [2024-10-13 10:32:03,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:32:03,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:32:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:32:03,665 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-13 10:32:03,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:32:03,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406764627] [2024-10-13 10:32:03,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406764627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:32:03,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:32:03,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:32:03,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157472665] [2024-10-13 10:32:03,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:32:03,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:32:03,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:32:03,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:32:03,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:32:03,667 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-13 10:32:03,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:32:03,804 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2024-10-13 10:32:03,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:32:03,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-13 10:32:03,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:32:03,806 INFO L225 Difference]: With dead ends: 60 [2024-10-13 10:32:03,807 INFO L226 Difference]: Without dead ends: 60 [2024-10-13 10:32:03,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:32:03,808 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 18 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:32:03,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 116 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:32:03,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-13 10:32:03,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 46. [2024-10-13 10:32:03,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 45 states have internal predecessors, (52), 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-13 10:32:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-10-13 10:32:03,816 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 6 [2024-10-13 10:32:03,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:32:03,817 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-10-13 10:32:03,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-13 10:32:03,818 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-10-13 10:32:03,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:32:03,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:32:03,818 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:32:03,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:32:03,818 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-13 10:32:03,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:32:03,819 INFO L85 PathProgramCache]: Analyzing trace with hash 34842007, now seen corresponding path program 1 times [2024-10-13 10:32:03,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:32:03,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338591466] [2024-10-13 10:32:03,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:32:03,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:32:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:32:04,044 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-13 10:32:04,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:32:04,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338591466] [2024-10-13 10:32:04,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338591466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:32:04,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:32:04,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:32:04,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919165124] [2024-10-13 10:32:04,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:32:04,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:32:04,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:32:04,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:32:04,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:32:04,048 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-13 10:32:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:32:04,133 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2024-10-13 10:32:04,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:32:04,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-13 10:32:04,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:32:04,135 INFO L225 Difference]: With dead ends: 48 [2024-10-13 10:32:04,135 INFO L226 Difference]: Without dead ends: 48 [2024-10-13 10:32:04,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:32:04,136 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 43 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:32:04,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 86 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:32:04,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-13 10:32:04,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-10-13 10:32:04,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 46 states have internal predecessors, (54), 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-13 10:32:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2024-10-13 10:32:04,139 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 6 [2024-10-13 10:32:04,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:32:04,139 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2024-10-13 10:32:04,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-13 10:32:04,140 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2024-10-13 10:32:04,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:32:04,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:32:04,140 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-13 10:32:04,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:32:04,141 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-13 10:32:04,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:32:04,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1700741590, now seen corresponding path program 1 times [2024-10-13 10:32:04,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:32:04,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198463639] [2024-10-13 10:32:04,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:32:04,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:32:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:32:04,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:32:04,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:32:04,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198463639] [2024-10-13 10:32:04,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198463639] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:32:04,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331758459] [2024-10-13 10:32:04,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:32:04,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:32:04,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:32:04,213 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-10-13 10:32:04,218 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-10-13 10:32:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:32:04,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:32:04,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:32:04,330 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-13 10:32:04,330 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:32:04,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331758459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:32:04,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:32:04,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-13 10:32:04,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966855807] [2024-10-13 10:32:04,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:32:04,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:32:04,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:32:04,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:32:04,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:32:04,332 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:32:04,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:32:04,377 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2024-10-13 10:32:04,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:32:04,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-13 10:32:04,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:32:04,378 INFO L225 Difference]: With dead ends: 60 [2024-10-13 10:32:04,378 INFO L226 Difference]: Without dead ends: 60 [2024-10-13 10:32:04,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:32:04,379 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 13 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:32:04,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 109 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:32:04,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-13 10:32:04,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2024-10-13 10:32:04,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 48 states have internal predecessors, (56), 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-13 10:32:04,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2024-10-13 10:32:04,383 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 8 [2024-10-13 10:32:04,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:32:04,383 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2024-10-13 10:32:04,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:32:04,383 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2024-10-13 10:32:04,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:32:04,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:32:04,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:32:04,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 10:32:04,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:32:04,588 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-13 10:32:04,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:32:04,588 INFO L85 PathProgramCache]: Analyzing trace with hash -876621223, now seen corresponding path program 1 times [2024-10-13 10:32:04,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:32:04,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570362772] [2024-10-13 10:32:04,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:32:04,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:32:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:32:04,628 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-13 10:32:04,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:32:04,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570362772] [2024-10-13 10:32:04,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570362772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:32:04,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:32:04,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:32:04,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123564273] [2024-10-13 10:32:04,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:32:04,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:32:04,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:32:04,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:32:04,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:32:04,632 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:32:04,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:32:04,691 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2024-10-13 10:32:04,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:32:04,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-13 10:32:04,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:32:04,692 INFO L225 Difference]: With dead ends: 66 [2024-10-13 10:32:04,692 INFO L226 Difference]: Without dead ends: 66 [2024-10-13 10:32:04,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-13 10:32:04,693 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 38 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:32:04,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 77 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:32:04,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-13 10:32:04,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2024-10-13 10:32:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 50 states have internal predecessors, (58), 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-13 10:32:04,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2024-10-13 10:32:04,700 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 8 [2024-10-13 10:32:04,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:32:04,701 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2024-10-13 10:32:04,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:32:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2024-10-13 10:32:04,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:32:04,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:32:04,702 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-13 10:32:04,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:32:04,702 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-13 10:32:04,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:32:04,702 INFO L85 PathProgramCache]: Analyzing trace with hash -876476646, now seen corresponding path program 1 times [2024-10-13 10:32:04,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:32:04,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033248552] [2024-10-13 10:32:04,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:32:04,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:32:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 10:32:04,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 10:32:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 10:32:04,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 10:32:04,743 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 10:32:04,744 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 23 remaining) [2024-10-13 10:32:04,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2024-10-13 10:32:04,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2024-10-13 10:32:04,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2024-10-13 10:32:04,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2024-10-13 10:32:04,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2024-10-13 10:32:04,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2024-10-13 10:32:04,748 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2024-10-13 10:32:04,748 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2024-10-13 10:32:04,748 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2024-10-13 10:32:04,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2024-10-13 10:32:04,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 23 remaining) [2024-10-13 10:32:04,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2024-10-13 10:32:04,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2024-10-13 10:32:04,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2024-10-13 10:32:04,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 23 remaining) [2024-10-13 10:32:04,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2024-10-13 10:32:04,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2024-10-13 10:32:04,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 23 remaining) [2024-10-13 10:32:04,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 23 remaining) [2024-10-13 10:32:04,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 23 remaining) [2024-10-13 10:32:04,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 23 remaining) [2024-10-13 10:32:04,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (0 of 23 remaining) [2024-10-13 10:32:04,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:32:04,753 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:32:04,770 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 10:32:04,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:32:04 BoogieIcfgContainer [2024-10-13 10:32:04,772 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 10:32:04,772 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 10:32:04,772 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 10:32:04,773 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 10:32:04,773 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:32:02" (3/4) ... [2024-10-13 10:32:04,773 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-13 10:32:04,798 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 10:32:04,798 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 10:32:04,799 INFO L158 Benchmark]: Toolchain (without parser) took 2760.11ms. Allocated memory is still 184.5MB. Free memory was 115.2MB in the beginning and 88.2MB in the end (delta: 27.1MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. [2024-10-13 10:32:04,799 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory was 145.2MB in the beginning and 145.1MB in the end (delta: 188.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:32:04,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.74ms. Allocated memory is still 184.5MB. Free memory was 115.0MB in the beginning and 96.8MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 10:32:04,799 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.31ms. Allocated memory is still 184.5MB. Free memory was 96.8MB in the beginning and 155.9MB in the end (delta: -59.2MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-10-13 10:32:04,799 INFO L158 Benchmark]: Boogie Preprocessor took 32.65ms. Allocated memory is still 184.5MB. Free memory was 155.9MB in the beginning and 153.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:32:04,800 INFO L158 Benchmark]: RCFGBuilder took 404.96ms. Allocated memory is still 184.5MB. Free memory was 153.8MB in the beginning and 134.0MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 10:32:04,800 INFO L158 Benchmark]: TraceAbstraction took 1830.56ms. Allocated memory is still 184.5MB. Free memory was 132.9MB in the beginning and 90.3MB in the end (delta: 42.6MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2024-10-13 10:32:04,800 INFO L158 Benchmark]: Witness Printer took 25.82ms. Allocated memory is still 184.5MB. Free memory was 90.3MB in the beginning and 88.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:32:04,801 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.10ms. Allocated memory is still 184.5MB. Free memory was 145.2MB in the beginning and 145.1MB in the end (delta: 188.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.74ms. Allocated memory is still 184.5MB. Free memory was 115.0MB in the beginning and 96.8MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.31ms. Allocated memory is still 184.5MB. Free memory was 96.8MB in the beginning and 155.9MB in the end (delta: -59.2MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.65ms. Allocated memory is still 184.5MB. Free memory was 155.9MB in the beginning and 153.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 404.96ms. Allocated memory is still 184.5MB. Free memory was 153.8MB in the beginning and 134.0MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1830.56ms. Allocated memory is still 184.5MB. Free memory was 132.9MB in the beginning and 90.3MB in the end (delta: 42.6MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. * Witness Printer took 25.82ms. Allocated memory is still 184.5MB. Free memory was 90.3MB in the beginning and 88.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: [L515] int i, j, tmp; [L516] int length = __VERIFIER_nondet_int(); [L517] COND FALSE !(length < 1) VAL [length=1073741824] [L518] COND TRUE length % 2 == 0 [L518] length++ VAL [length=1073741825] [L519] int *arr = __builtin_alloca (length*sizeof(int)); [L521] int i = 0; VAL [arr={2:0}, i=0, length=1073741825] [L521] COND TRUE i < length [L523] arr[i] = __VERIFIER_nondet_int() [L521] i++ VAL [arr={2:0}, i=1, length=1073741825] [L521] COND TRUE i < length [L523] arr[i] = __VERIFIER_nondet_int() - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 514]: 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, 48 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 141 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 485 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 259 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 378 IncrementalHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 226 mSDtfsCounter, 378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=6, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 41 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 41 ConstructedInterpolants, 0 QuantifiedInterpolants, 193 SizeOfPredicates, 2 NumberOfNonLiveVariables, 47 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 3/4 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-13 10:32:04,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)