./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/b.11-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 8ef6a70edb4426b11650a0154f4234f5ac775ab47d29a5a4fff3db3968295222 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:33:43,737 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:33:43,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-22 18:33:43,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:33:43,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:33:43,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:33:43,819 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:33:43,819 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:33:43,820 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:33:43,820 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:33:43,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:33:43,820 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:33:43,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:33:43,821 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:33:43,821 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:33:43,821 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:33:43,822 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:33:43,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:33:43,824 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:33:43,824 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:33:43,826 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:33:43,827 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:33:43,828 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:33:43,828 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:33:43,828 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:33:43,828 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:33:43,828 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:33:43,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:33:43,829 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:33:43,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:33:43,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:33:43,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:33:43,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:33:43,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:33:43,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:33:43,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:33:43,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:33:43,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:33:43,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:33:43,831 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8ef6a70edb4426b11650a0154f4234f5ac775ab47d29a5a4fff3db3968295222 [2024-11-22 18:33:44,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:33:44,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:33:44,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:33:44,049 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:33:44,050 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:33:44,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i [2024-11-22 18:33:45,301 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:33:45,472 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:33:45,472 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i [2024-11-22 18:33:45,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f4ad497d/e2f625bc83ab4e638cf630976402eb83/FLAG68f952b34 [2024-11-22 18:33:45,494 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f4ad497d/e2f625bc83ab4e638cf630976402eb83 [2024-11-22 18:33:45,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:33:45,497 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:33:45,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:33:45,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:33:45,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:33:45,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:33:45" (1/1) ... [2024-11-22 18:33:45,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72f4c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:45, skipping insertion in model container [2024-11-22 18:33:45,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:33:45" (1/1) ... [2024-11-22 18:33:45,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:33:45,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:33:45,743 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:33:45,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:33:45,799 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:33:45,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:45 WrapperNode [2024-11-22 18:33:45,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:33:45,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:33:45,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:33:45,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:33:45,806 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:33:45" (1/1) ... [2024-11-22 18:33:45,815 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:33:45" (1/1) ... [2024-11-22 18:33:45,830 INFO L138 Inliner]: procedures = 111, calls = 34, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 117 [2024-11-22 18:33:45,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:33:45,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:33:45,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:33:45,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:33:45,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:45" (1/1) ... [2024-11-22 18:33:45,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:45" (1/1) ... [2024-11-22 18:33:45,841 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:45" (1/1) ... [2024-11-22 18:33:45,851 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [2, 12, 8]. 55 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 6 writes are split as follows [1, 3, 2]. [2024-11-22 18:33:45,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:45" (1/1) ... [2024-11-22 18:33:45,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:45" (1/1) ... [2024-11-22 18:33:45,854 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:45" (1/1) ... [2024-11-22 18:33:45,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:45" (1/1) ... [2024-11-22 18:33:45,858 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:45" (1/1) ... [2024-11-22 18:33:45,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:45" (1/1) ... [2024-11-22 18:33:45,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:33:45,861 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:33:45,861 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:33:45,861 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:33:45,862 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:45" (1/1) ... [2024-11-22 18:33:45,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:33:45,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:33:45,888 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:33:45,891 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:33:45,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 18:33:45,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 18:33:45,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 18:33:45,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 18:33:45,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 18:33:45,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 18:33:45,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 18:33:45,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:33:45,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:33:45,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:33:46,015 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:33:46,017 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:33:46,274 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-11-22 18:33:46,274 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:33:46,285 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:33:46,285 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 18:33:46,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:33:46 BoogieIcfgContainer [2024-11-22 18:33:46,286 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:33:46,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:33:46,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:33:46,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:33:46,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:33:45" (1/3) ... [2024-11-22 18:33:46,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7f6454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:33:46, skipping insertion in model container [2024-11-22 18:33:46,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:45" (2/3) ... [2024-11-22 18:33:46,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7f6454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:33:46, skipping insertion in model container [2024-11-22 18:33:46,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:33:46" (3/3) ... [2024-11-22 18:33:46,295 INFO L112 eAbstractionObserver]: Analyzing ICFG b.11-alloca.i [2024-11-22 18:33:46,308 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:33:46,308 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2024-11-22 18:33:46,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:33:46,386 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;@634613fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:33:46,386 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2024-11-22 18:33:46,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 46 states have (on average 2.152173913043478) internal successors, (99), 91 states have internal predecessors, (99), 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:33:46,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-22 18:33:46,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:46,398 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-22 18:33:46,399 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:33:46,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:46,404 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-22 18:33:46,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:46,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714466993] [2024-11-22 18:33:46,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:46,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:46,763 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:33:46,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:46,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714466993] [2024-11-22 18:33:46,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714466993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:46,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:46,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:33:46,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908331616] [2024-11-22 18:33:46,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:46,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:33:46,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:46,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:33:46,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:33:46,799 INFO L87 Difference]: Start difference. First operand has 92 states, 46 states have (on average 2.152173913043478) internal successors, (99), 91 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:46,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:46,908 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2024-11-22 18:33:46,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:33:46,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-22 18:33:46,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:46,917 INFO L225 Difference]: With dead ends: 80 [2024-11-22 18:33:46,917 INFO L226 Difference]: Without dead ends: 78 [2024-11-22 18:33:46,918 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:33:46,923 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 67 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:33:46,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 42 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:33:46,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-22 18:33:46,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-22 18:33:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 77 states have internal predecessors, (84), 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:33:46,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2024-11-22 18:33:46,949 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 3 [2024-11-22 18:33:46,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:46,949 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2024-11-22 18:33:46,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:46,950 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2024-11-22 18:33:46,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-22 18:33:46,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:46,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-22 18:33:46,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 18:33:46,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:33:46,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:46,951 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-22 18:33:46,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:46,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175247269] [2024-11-22 18:33:46,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:46,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:47,100 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:33:47,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:47,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175247269] [2024-11-22 18:33:47,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175247269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:47,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:47,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:33:47,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916479667] [2024-11-22 18:33:47,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:47,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:33:47,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:47,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:33:47,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:33:47,104 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:47,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:47,167 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2024-11-22 18:33:47,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:33:47,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-22 18:33:47,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:47,168 INFO L225 Difference]: With dead ends: 66 [2024-11-22 18:33:47,169 INFO L226 Difference]: Without dead ends: 66 [2024-11-22 18:33:47,169 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:33:47,170 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 68 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:33:47,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 42 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:33:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-22 18:33:47,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-22 18:33:47,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.6) internal successors, (72), 65 states have internal predecessors, (72), 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:33:47,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2024-11-22 18:33:47,177 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 3 [2024-11-22 18:33:47,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:47,177 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2024-11-22 18:33:47,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:47,177 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2024-11-22 18:33:47,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-22 18:33:47,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:47,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-22 18:33:47,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 18:33:47,179 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:33:47,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:47,180 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2024-11-22 18:33:47,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:47,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204257667] [2024-11-22 18:33:47,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:47,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:47,237 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:33:47,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:47,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204257667] [2024-11-22 18:33:47,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204257667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:47,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:47,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:33:47,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320110376] [2024-11-22 18:33:47,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:47,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:33:47,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:47,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:33:47,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:33:47,240 INFO L87 Difference]: Start difference. First operand 66 states and 72 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:33:47,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:47,301 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2024-11-22 18:33:47,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:33:47,301 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:33:47,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:47,302 INFO L225 Difference]: With dead ends: 58 [2024-11-22 18:33:47,302 INFO L226 Difference]: Without dead ends: 58 [2024-11-22 18:33:47,302 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:33:47,303 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:33:47,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 31 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:33:47,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-22 18:33:47,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-22 18:33:47,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 57 states have internal predecessors, (64), 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:33:47,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2024-11-22 18:33:47,312 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 4 [2024-11-22 18:33:47,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:47,313 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2024-11-22 18:33:47,313 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:33:47,313 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2024-11-22 18:33:47,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-22 18:33:47,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:47,313 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-22 18:33:47,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 18:33:47,313 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:33:47,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:47,314 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2024-11-22 18:33:47,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:47,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587710148] [2024-11-22 18:33:47,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:47,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:47,379 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:33:47,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:47,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587710148] [2024-11-22 18:33:47,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587710148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:47,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:47,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:33:47,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584130275] [2024-11-22 18:33:47,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:47,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:33:47,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:47,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:33:47,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:33:47,381 INFO L87 Difference]: Start difference. First operand 58 states and 64 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:33:47,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:47,414 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2024-11-22 18:33:47,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:33:47,415 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:33:47,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:47,416 INFO L225 Difference]: With dead ends: 50 [2024-11-22 18:33:47,416 INFO L226 Difference]: Without dead ends: 50 [2024-11-22 18:33:47,416 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:33:47,417 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 51 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:33:47,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 34 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:33:47,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-22 18:33:47,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-22 18:33:47,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 49 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-11-22 18:33:47,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-11-22 18:33:47,420 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 4 [2024-11-22 18:33:47,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:47,420 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-11-22 18:33:47,420 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:33:47,420 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-11-22 18:33:47,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 18:33:47,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:47,420 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 18:33:47,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 18:33:47,421 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:33:47,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:47,421 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2024-11-22 18:33:47,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:47,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864771303] [2024-11-22 18:33:47,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:47,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:47,442 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:33:47,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:47,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864771303] [2024-11-22 18:33:47,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864771303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:47,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:47,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:33:47,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834212939] [2024-11-22 18:33:47,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:47,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:33:47,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:47,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:33:47,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:33:47,445 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 3 states, 2 states have (on average 2.5) 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:33:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:47,474 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2024-11-22 18:33:47,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:33:47,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) 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:33:47,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:47,475 INFO L225 Difference]: With dead ends: 48 [2024-11-22 18:33:47,475 INFO L226 Difference]: Without dead ends: 48 [2024-11-22 18:33:47,475 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:33:47,476 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:33:47,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 30 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:33:47,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-22 18:33:47,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-22 18:33:47,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 1.2) internal successors, (54), 47 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-11-22 18:33:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-11-22 18:33:47,479 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 5 [2024-11-22 18:33:47,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:47,479 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-11-22 18:33:47,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) 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:33:47,479 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2024-11-22 18:33:47,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 18:33:47,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:47,480 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 18:33:47,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 18:33:47,480 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:33:47,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:47,481 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2024-11-22 18:33:47,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:47,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771656497] [2024-11-22 18:33:47,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:47,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:47,536 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:33:47,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:47,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771656497] [2024-11-22 18:33:47,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771656497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:47,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:47,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:33:47,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293428105] [2024-11-22 18:33:47,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:47,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:33:47,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:47,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:33:47,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:33:47,538 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 3 states, 2 states have (on average 2.5) 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:33:47,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:47,596 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-11-22 18:33:47,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:33:47,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) 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:33:47,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:47,598 INFO L225 Difference]: With dead ends: 46 [2024-11-22 18:33:47,598 INFO L226 Difference]: Without dead ends: 46 [2024-11-22 18:33:47,598 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:33:47,599 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 44 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:33:47,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 33 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:33:47,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-22 18:33:47,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-22 18:33:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1555555555555554) 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-11-22 18:33:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-11-22 18:33:47,603 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 5 [2024-11-22 18:33:47,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:47,603 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-11-22 18:33:47,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) 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:33:47,603 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-11-22 18:33:47,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 18:33:47,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:47,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:33:47,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 18:33:47,604 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:33:47,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:47,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1871414585, now seen corresponding path program 1 times [2024-11-22 18:33:47,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:47,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067826100] [2024-11-22 18:33:47,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:47,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:47,634 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:33:47,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:47,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067826100] [2024-11-22 18:33:47,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067826100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:47,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:47,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:33:47,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193899336] [2024-11-22 18:33:47,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:47,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:33:47,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:47,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:33:47,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:33:47,637 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:33:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:47,653 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2024-11-22 18:33:47,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:33:47,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2024-11-22 18:33:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:47,656 INFO L225 Difference]: With dead ends: 48 [2024-11-22 18:33:47,656 INFO L226 Difference]: Without dead ends: 48 [2024-11-22 18:33:47,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:33:47,657 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:33:47,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:33:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-22 18:33:47,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-22 18:33:47,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 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-11-22 18:33:47,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-11-22 18:33:47,662 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 17 [2024-11-22 18:33:47,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:47,662 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-11-22 18:33:47,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:33:47,663 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2024-11-22 18:33:47,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 18:33:47,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:47,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:33:47,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 18:33:47,664 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:33:47,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:47,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1427552950, now seen corresponding path program 1 times [2024-11-22 18:33:47,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:47,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390091903] [2024-11-22 18:33:47,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:47,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:47,710 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:33:47,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:47,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390091903] [2024-11-22 18:33:47,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390091903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:47,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:47,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:33:47,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506463382] [2024-11-22 18:33:47,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:47,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:33:47,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:47,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:33:47,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:33:47,715 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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:33:47,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:47,733 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2024-11-22 18:33:47,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:33:47,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 20 [2024-11-22 18:33:47,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:47,734 INFO L225 Difference]: With dead ends: 50 [2024-11-22 18:33:47,734 INFO L226 Difference]: Without dead ends: 50 [2024-11-22 18:33:47,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:33:47,735 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:33:47,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:33:47,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-22 18:33:47,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-22 18:33:47,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 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-11-22 18:33:47,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-11-22 18:33:47,739 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 20 [2024-11-22 18:33:47,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:47,742 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-11-22 18:33:47,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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:33:47,742 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-11-22 18:33:47,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 18:33:47,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:47,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:33:47,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 18:33:47,743 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:33:47,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:47,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1815083264, now seen corresponding path program 1 times [2024-11-22 18:33:47,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:47,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94808295] [2024-11-22 18:33:47,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:47,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:47,906 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:33:47,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:47,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94808295] [2024-11-22 18:33:47,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94808295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:47,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:47,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 18:33:47,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313394649] [2024-11-22 18:33:47,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:47,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:33:47,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:47,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:33:47,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:33:47,907 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:48,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:48,006 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2024-11-22 18:33:48,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:33:48,007 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-22 18:33:48,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:48,007 INFO L225 Difference]: With dead ends: 89 [2024-11-22 18:33:48,007 INFO L226 Difference]: Without dead ends: 89 [2024-11-22 18:33:48,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:33:48,008 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 37 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:33:48,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 311 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:33:48,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-22 18:33:48,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2024-11-22 18:33:48,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.1604938271604939) internal successors, (94), 81 states have internal predecessors, (94), 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:33:48,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2024-11-22 18:33:48,016 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 21 [2024-11-22 18:33:48,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:48,017 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2024-11-22 18:33:48,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:48,017 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2024-11-22 18:33:48,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 18:33:48,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:48,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:33:48,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 18:33:48,018 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:33:48,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:48,019 INFO L85 PathProgramCache]: Analyzing trace with hash 843963646, now seen corresponding path program 1 times [2024-11-22 18:33:48,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:48,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563130801] [2024-11-22 18:33:48,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:48,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:48,217 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:33:48,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:48,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563130801] [2024-11-22 18:33:48,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563130801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:48,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:48,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:33:48,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953722076] [2024-11-22 18:33:48,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:48,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:33:48,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:48,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:33:48,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:33:48,219 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:48,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:48,254 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2024-11-22 18:33:48,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:33:48,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-22 18:33:48,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:48,255 INFO L225 Difference]: With dead ends: 81 [2024-11-22 18:33:48,255 INFO L226 Difference]: Without dead ends: 0 [2024-11-22 18:33:48,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:33:48,256 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 29 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:33:48,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 53 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:33:48,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-22 18:33:48,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-22 18:33:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:33:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-22 18:33:48,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2024-11-22 18:33:48,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:48,258 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-22 18:33:48,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:48,258 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-22 18:33:48,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-22 18:33:48,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 45 remaining) [2024-11-22 18:33:48,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 45 remaining) [2024-11-22 18:33:48,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 45 remaining) [2024-11-22 18:33:48,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 45 remaining) [2024-11-22 18:33:48,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 45 remaining) [2024-11-22 18:33:48,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 45 remaining) [2024-11-22 18:33:48,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 45 remaining) [2024-11-22 18:33:48,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 45 remaining) [2024-11-22 18:33:48,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 45 remaining) [2024-11-22 18:33:48,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 45 remaining) [2024-11-22 18:33:48,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 45 remaining) [2024-11-22 18:33:48,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 45 remaining) [2024-11-22 18:33:48,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 45 remaining) [2024-11-22 18:33:48,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 45 remaining) [2024-11-22 18:33:48,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 45 remaining) [2024-11-22 18:33:48,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 45 remaining) [2024-11-22 18:33:48,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 45 remaining) [2024-11-22 18:33:48,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 45 remaining) [2024-11-22 18:33:48,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 45 remaining) [2024-11-22 18:33:48,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 45 remaining) [2024-11-22 18:33:48,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 45 remaining) [2024-11-22 18:33:48,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 45 remaining) [2024-11-22 18:33:48,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 45 remaining) [2024-11-22 18:33:48,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 45 remaining) [2024-11-22 18:33:48,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 45 remaining) [2024-11-22 18:33:48,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 45 remaining) [2024-11-22 18:33:48,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 45 remaining) [2024-11-22 18:33:48,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 45 remaining) [2024-11-22 18:33:48,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 45 remaining) [2024-11-22 18:33:48,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 45 remaining) [2024-11-22 18:33:48,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 45 remaining) [2024-11-22 18:33:48,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 45 remaining) [2024-11-22 18:33:48,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 45 remaining) [2024-11-22 18:33:48,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 45 remaining) [2024-11-22 18:33:48,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 45 remaining) [2024-11-22 18:33:48,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 45 remaining) [2024-11-22 18:33:48,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 45 remaining) [2024-11-22 18:33:48,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 45 remaining) [2024-11-22 18:33:48,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 45 remaining) [2024-11-22 18:33:48,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 45 remaining) [2024-11-22 18:33:48,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 45 remaining) [2024-11-22 18:33:48,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 45 remaining) [2024-11-22 18:33:48,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 45 remaining) [2024-11-22 18:33:48,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 45 remaining) [2024-11-22 18:33:48,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (0 of 45 remaining) [2024-11-22 18:33:48,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 18:33:48,268 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:33:48,271 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 18:33:48,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 06:33:48 BoogieIcfgContainer [2024-11-22 18:33:48,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 18:33:48,275 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 18:33:48,275 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 18:33:48,275 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 18:33:48,275 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:33:46" (3/4) ... [2024-11-22 18:33:48,277 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-22 18:33:48,285 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-22 18:33:48,285 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-22 18:33:48,285 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-22 18:33:48,285 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 18:33:48,356 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 18:33:48,356 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-22 18:33:48,356 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 18:33:48,357 INFO L158 Benchmark]: Toolchain (without parser) took 2859.18ms. Allocated memory was 146.8MB in the beginning and 184.5MB in the end (delta: 37.7MB). Free memory was 89.2MB in the beginning and 101.4MB in the end (delta: -12.2MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2024-11-22 18:33:48,357 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 146.8MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 18:33:48,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.66ms. Allocated memory is still 146.8MB. Free memory was 88.6MB in the beginning and 70.3MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-22 18:33:48,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.99ms. Allocated memory is still 146.8MB. Free memory was 70.3MB in the beginning and 68.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 18:33:48,357 INFO L158 Benchmark]: Boogie Preprocessor took 29.38ms. Allocated memory is still 146.8MB. Free memory was 68.3MB in the beginning and 66.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 18:33:48,358 INFO L158 Benchmark]: RCFGBuilder took 425.30ms. Allocated memory is still 146.8MB. Free memory was 66.2MB in the beginning and 44.6MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-22 18:33:48,358 INFO L158 Benchmark]: TraceAbstraction took 1986.06ms. Allocated memory was 146.8MB in the beginning and 184.5MB in the end (delta: 37.7MB). Free memory was 44.0MB in the beginning and 106.7MB in the end (delta: -62.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 18:33:48,358 INFO L158 Benchmark]: Witness Printer took 81.68ms. Allocated memory is still 184.5MB. Free memory was 106.7MB in the beginning and 101.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 18:33:48,359 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 146.8MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.66ms. Allocated memory is still 146.8MB. Free memory was 88.6MB in the beginning and 70.3MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.99ms. Allocated memory is still 146.8MB. Free memory was 70.3MB in the beginning and 68.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.38ms. Allocated memory is still 146.8MB. Free memory was 68.3MB in the beginning and 66.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 425.30ms. Allocated memory is still 146.8MB. Free memory was 66.2MB in the beginning and 44.6MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1986.06ms. Allocated memory was 146.8MB in the beginning and 184.5MB in the end (delta: 37.7MB). Free memory was 44.0MB in the beginning and 106.7MB in the end (delta: -62.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 81.68ms. Allocated memory is still 184.5MB. Free memory was 106.7MB in the beginning and 101.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 92 locations, 45 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 390 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 390 mSDsluCounter, 847 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 445 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 451 IncrementalHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 402 mSDtfsCounter, 451 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=0, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 671 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 45 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-22 18:33:48,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE