./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/termination-memory-alloca/a.06-alloca.i --full-output --preprocessor.use.memory.slicer true --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6ae2ee47 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 ../../../trunk/examples/svcomp/termination-memory-alloca/a.06-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 0e00bd958aa9fbd5730471fb19c0f431fb9410b6f9738fcfd6ac5e9594f9dc7f --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 17:11:21,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 17:11:21,656 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2023-11-22 17:11:21,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 17:11:21,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 17:11:21,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 17:11:21,680 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 17:11:21,680 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 17:11:21,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 17:11:21,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 17:11:21,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 17:11:21,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 17:11:21,682 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 17:11:21,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 17:11:21,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 17:11:21,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 17:11:21,684 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-22 17:11:21,684 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-22 17:11:21,684 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-22 17:11:21,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 17:11:21,685 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 17:11:21,686 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-22 17:11:21,686 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 17:11:21,686 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 17:11:21,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 17:11:21,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 17:11:21,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 17:11:21,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 17:11:21,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 17:11:21,689 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 17:11:21,689 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 17:11:21,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 17:11:21,690 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 17:11:21,690 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 17:11:21,690 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 17:11:21,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 17:11:21,691 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 -> 0e00bd958aa9fbd5730471fb19c0f431fb9410b6f9738fcfd6ac5e9594f9dc7f Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 17:11:21,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 17:11:22,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 17:11:22,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 17:11:22,055 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 17:11:22,056 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 17:11:22,058 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/termination-memory-alloca/a.06-alloca.i [2023-11-22 17:11:23,258 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 17:11:23,526 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 17:11:23,526 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/termination-memory-alloca/a.06-alloca.i [2023-11-22 17:11:23,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e43953b0/73835894a27a4c86a4e2236a04e3aaa8/FLAGc2da5a838 [2023-11-22 17:11:23,551 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e43953b0/73835894a27a4c86a4e2236a04e3aaa8 [2023-11-22 17:11:23,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 17:11:23,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 17:11:23,556 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 17:11:23,556 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 17:11:23,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 17:11:23,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:11:23" (1/1) ... [2023-11-22 17:11:23,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c318ff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:23, skipping insertion in model container [2023-11-22 17:11:23,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:11:23" (1/1) ... [2023-11-22 17:11:23,592 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 17:11:23,842 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 17:11:23,855 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 17:11:23,910 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 17:11:23,943 INFO L206 MainTranslator]: Completed translation [2023-11-22 17:11:23,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:23 WrapperNode [2023-11-22 17:11:23,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 17:11:23,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 17:11:23,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 17:11:23,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 17:11:23,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:23" (1/1) ... [2023-11-22 17:11:23,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:23" (1/1) ... [2023-11-22 17:11:23,984 INFO L138 Inliner]: procedures = 111, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 126 [2023-11-22 17:11:23,984 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 17:11:23,985 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 17:11:23,985 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 17:11:23,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 17:11:23,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:23" (1/1) ... [2023-11-22 17:11:23,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:23" (1/1) ... [2023-11-22 17:11:24,004 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:23" (1/1) ... [2023-11-22 17:11:24,018 INFO L189 HeapSplitter]: Split 20 memory accesses to 4 slices as follows [2, 7, 9, 2] [2023-11-22 17:11:24,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:23" (1/1) ... [2023-11-22 17:11:24,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:23" (1/1) ... [2023-11-22 17:11:24,025 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:23" (1/1) ... [2023-11-22 17:11:24,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:23" (1/1) ... [2023-11-22 17:11:24,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:23" (1/1) ... [2023-11-22 17:11:24,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:23" (1/1) ... [2023-11-22 17:11:24,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 17:11:24,035 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 17:11:24,035 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 17:11:24,035 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 17:11:24,036 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:23" (1/1) ... [2023-11-22 17:11:24,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 17:11:24,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 17:11:24,078 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 17:11:24,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 17:11:24,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-22 17:11:24,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-22 17:11:24,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-22 17:11:24,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-22 17:11:24,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-22 17:11:24,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-22 17:11:24,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-22 17:11:24,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-22 17:11:24,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 17:11:24,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 17:11:24,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 17:11:24,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 17:11:24,227 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 17:11:24,229 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 17:11:24,554 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 17:11:24,608 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 17:11:24,608 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-22 17:11:24,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:11:24 BoogieIcfgContainer [2023-11-22 17:11:24,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 17:11:24,611 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 17:11:24,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 17:11:24,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 17:11:24,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 05:11:23" (1/3) ... [2023-11-22 17:11:24,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa8b0b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:11:24, skipping insertion in model container [2023-11-22 17:11:24,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:23" (2/3) ... [2023-11-22 17:11:24,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa8b0b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:11:24, skipping insertion in model container [2023-11-22 17:11:24,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:11:24" (3/3) ... [2023-11-22 17:11:24,618 INFO L112 eAbstractionObserver]: Analyzing ICFG a.06-alloca.i [2023-11-22 17:11:24,634 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 17:11:24,634 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-11-22 17:11:24,672 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 17:11:24,678 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@73bfe158, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 17:11:24,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-11-22 17:11:24,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 75 states have internal predecessors, (83), 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) [2023-11-22 17:11:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-22 17:11:24,686 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:11:24,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-22 17:11:24,687 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-22 17:11:24,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:11:24,692 INFO L85 PathProgramCache]: Analyzing trace with hash 5398, now seen corresponding path program 1 times [2023-11-22 17:11:24,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:11:24,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120857392] [2023-11-22 17:11:24,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:11:24,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:11:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:11:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:11:25,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:11:25,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120857392] [2023-11-22 17:11:25,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120857392] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:11:25,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:11:25,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-22 17:11:25,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398892461] [2023-11-22 17:11:25,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:11:25,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 17:11:25,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:11:25,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 17:11:25,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:25,154 INFO L87 Difference]: Start difference. First operand has 76 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 75 states have internal predecessors, (83), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-22 17:11:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:11:25,253 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2023-11-22 17:11:25,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 17:11:25,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-22 17:11:25,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:11:25,266 INFO L225 Difference]: With dead ends: 74 [2023-11-22 17:11:25,266 INFO L226 Difference]: Without dead ends: 73 [2023-11-22 17:11:25,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:25,272 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:11:25,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 38 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:11:25,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-22 17:11:25,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-11-22 17:11:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 34 states have (on average 2.323529411764706) internal successors, (79), 72 states have internal predecessors, (79), 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) [2023-11-22 17:11:25,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2023-11-22 17:11:25,312 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 2 [2023-11-22 17:11:25,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:11:25,313 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2023-11-22 17:11:25,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-22 17:11:25,315 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2023-11-22 17:11:25,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-22 17:11:25,315 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:11:25,316 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-22 17:11:25,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 17:11:25,316 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-22 17:11:25,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:11:25,318 INFO L85 PathProgramCache]: Analyzing trace with hash 5399, now seen corresponding path program 1 times [2023-11-22 17:11:25,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:11:25,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111600902] [2023-11-22 17:11:25,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:11:25,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:11:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:11:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:11:25,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:11:25,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111600902] [2023-11-22 17:11:25,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111600902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:11:25,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:11:25,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-22 17:11:25,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111523038] [2023-11-22 17:11:25,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:11:25,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 17:11:25,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:11:25,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 17:11:25,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:25,574 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-22 17:11:25,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:11:25,651 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2023-11-22 17:11:25,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 17:11:25,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-22 17:11:25,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:11:25,656 INFO L225 Difference]: With dead ends: 71 [2023-11-22 17:11:25,656 INFO L226 Difference]: Without dead ends: 71 [2023-11-22 17:11:25,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:25,659 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 74 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:11:25,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 39 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:11:25,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-22 17:11:25,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-11-22 17:11:25,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 34 states have (on average 2.264705882352941) internal successors, (77), 70 states have internal predecessors, (77), 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) [2023-11-22 17:11:25,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2023-11-22 17:11:25,668 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 2 [2023-11-22 17:11:25,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:11:25,668 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2023-11-22 17:11:25,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-22 17:11:25,669 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2023-11-22 17:11:25,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-22 17:11:25,669 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:11:25,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-22 17:11:25,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 17:11:25,670 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-22 17:11:25,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:11:25,670 INFO L85 PathProgramCache]: Analyzing trace with hash 167314, now seen corresponding path program 1 times [2023-11-22 17:11:25,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:11:25,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017471626] [2023-11-22 17:11:25,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:11:25,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:11:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:11:25,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:11:25,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:11:25,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017471626] [2023-11-22 17:11:25,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017471626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:11:25,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:11:25,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-22 17:11:25,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953766247] [2023-11-22 17:11:25,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:11:25,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 17:11:25,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:11:25,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 17:11:25,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:25,741 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:11:25,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:11:25,794 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2023-11-22 17:11:25,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 17:11:25,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-22 17:11:25,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:11:25,795 INFO L225 Difference]: With dead ends: 62 [2023-11-22 17:11:25,796 INFO L226 Difference]: Without dead ends: 62 [2023-11-22 17:11:25,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:25,809 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 17:11:25,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 29 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 17:11:25,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-22 17:11:25,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-22 17:11:25,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 2.0) internal successors, (68), 61 states have internal predecessors, (68), 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) [2023-11-22 17:11:25,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2023-11-22 17:11:25,815 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 3 [2023-11-22 17:11:25,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:11:25,815 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2023-11-22 17:11:25,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:11:25,816 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2023-11-22 17:11:25,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-22 17:11:25,816 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:11:25,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-22 17:11:25,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 17:11:25,817 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-22 17:11:25,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:11:25,818 INFO L85 PathProgramCache]: Analyzing trace with hash 167315, now seen corresponding path program 1 times [2023-11-22 17:11:25,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:11:25,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845314055] [2023-11-22 17:11:25,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:11:25,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:11:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:11:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:11:25,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:11:25,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845314055] [2023-11-22 17:11:25,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845314055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:11:25,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:11:25,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-22 17:11:25,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135178988] [2023-11-22 17:11:25,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:11:25,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 17:11:25,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:11:25,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 17:11:25,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:25,897 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:11:25,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:11:25,941 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2023-11-22 17:11:25,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 17:11:25,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-22 17:11:25,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:11:25,942 INFO L225 Difference]: With dead ends: 53 [2023-11-22 17:11:25,942 INFO L226 Difference]: Without dead ends: 53 [2023-11-22 17:11:25,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:25,944 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 55 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 17:11:25,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 30 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 17:11:25,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-22 17:11:25,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-22 17:11:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 52 states have internal predecessors, (59), 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) [2023-11-22 17:11:25,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2023-11-22 17:11:25,948 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 3 [2023-11-22 17:11:25,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:11:25,949 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2023-11-22 17:11:25,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:11:25,949 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2023-11-22 17:11:25,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-22 17:11:25,950 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:11:25,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-22 17:11:25,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 17:11:25,950 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-22 17:11:25,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:11:25,951 INFO L85 PathProgramCache]: Analyzing trace with hash 5186713, now seen corresponding path program 1 times [2023-11-22 17:11:25,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:11:25,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306783788] [2023-11-22 17:11:25,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:11:25,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:11:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:11:25,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:11:25,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:11:25,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306783788] [2023-11-22 17:11:25,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306783788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:11:25,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:11:25,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-22 17:11:25,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601181387] [2023-11-22 17:11:25,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:11:25,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 17:11:25,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:11:25,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 17:11:25,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:25,993 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2023-11-22 17:11:26,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:11:26,031 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2023-11-22 17:11:26,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 17:11:26,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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 [2023-11-22 17:11:26,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:11:26,032 INFO L225 Difference]: With dead ends: 46 [2023-11-22 17:11:26,032 INFO L226 Difference]: Without dead ends: 46 [2023-11-22 17:11:26,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:26,034 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 17:11:26,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 22 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 17:11:26,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-22 17:11:26,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-11-22 17:11:26,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.5294117647058822) 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) [2023-11-22 17:11:26,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2023-11-22 17:11:26,038 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 4 [2023-11-22 17:11:26,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:11:26,038 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2023-11-22 17:11:26,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2023-11-22 17:11:26,038 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2023-11-22 17:11:26,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-22 17:11:26,039 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:11:26,039 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-22 17:11:26,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 17:11:26,039 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-22 17:11:26,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:11:26,040 INFO L85 PathProgramCache]: Analyzing trace with hash 5186714, now seen corresponding path program 1 times [2023-11-22 17:11:26,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:11:26,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939151051] [2023-11-22 17:11:26,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:11:26,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:11:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:11:26,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:11:26,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:11:26,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939151051] [2023-11-22 17:11:26,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939151051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:11:26,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:11:26,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-22 17:11:26,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896204128] [2023-11-22 17:11:26,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:11:26,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 17:11:26,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:11:26,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 17:11:26,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:26,117 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2023-11-22 17:11:26,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:11:26,162 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2023-11-22 17:11:26,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 17:11:26,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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 [2023-11-22 17:11:26,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:11:26,165 INFO L225 Difference]: With dead ends: 39 [2023-11-22 17:11:26,166 INFO L226 Difference]: Without dead ends: 39 [2023-11-22 17:11:26,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:26,168 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 40 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 17:11:26,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 23 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 17:11:26,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-22 17:11:26,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-22 17:11:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 38 states have internal predecessors, (45), 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) [2023-11-22 17:11:26,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2023-11-22 17:11:26,176 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 4 [2023-11-22 17:11:26,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:11:26,180 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2023-11-22 17:11:26,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2023-11-22 17:11:26,181 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2023-11-22 17:11:26,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-22 17:11:26,181 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:11:26,181 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-22 17:11:26,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-22 17:11:26,182 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-22 17:11:26,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:11:26,183 INFO L85 PathProgramCache]: Analyzing trace with hash 160788085, now seen corresponding path program 1 times [2023-11-22 17:11:26,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:11:26,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282724782] [2023-11-22 17:11:26,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:11:26,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:11:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:11:26,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:11:26,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:11:26,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282724782] [2023-11-22 17:11:26,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282724782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:11:26,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:11:26,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-22 17:11:26,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344874848] [2023-11-22 17:11:26,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:11:26,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 17:11:26,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:11:26,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 17:11:26,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:26,239 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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) [2023-11-22 17:11:26,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:11:26,275 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2023-11-22 17:11:26,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 17:11:26,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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 [2023-11-22 17:11:26,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:11:26,276 INFO L225 Difference]: With dead ends: 37 [2023-11-22 17:11:26,276 INFO L226 Difference]: Without dead ends: 37 [2023-11-22 17:11:26,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:26,278 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 17:11:26,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 20 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 17:11:26,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-22 17:11:26,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-22 17:11:26,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 36 states have internal predecessors, (43), 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) [2023-11-22 17:11:26,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2023-11-22 17:11:26,285 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 5 [2023-11-22 17:11:26,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:11:26,286 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2023-11-22 17:11:26,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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) [2023-11-22 17:11:26,286 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2023-11-22 17:11:26,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-22 17:11:26,286 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:11:26,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-22 17:11:26,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-22 17:11:26,287 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-22 17:11:26,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:11:26,288 INFO L85 PathProgramCache]: Analyzing trace with hash 160788086, now seen corresponding path program 1 times [2023-11-22 17:11:26,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:11:26,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649530191] [2023-11-22 17:11:26,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:11:26,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:11:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:11:26,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:11:26,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:11:26,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649530191] [2023-11-22 17:11:26,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649530191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:11:26,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:11:26,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-22 17:11:26,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103478068] [2023-11-22 17:11:26,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:11:26,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 17:11:26,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:11:26,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 17:11:26,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:26,364 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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) [2023-11-22 17:11:26,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:11:26,393 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2023-11-22 17:11:26,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 17:11:26,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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 [2023-11-22 17:11:26,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:11:26,394 INFO L225 Difference]: With dead ends: 35 [2023-11-22 17:11:26,394 INFO L226 Difference]: Without dead ends: 35 [2023-11-22 17:11:26,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:26,395 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 17:11:26,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 21 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 17:11:26,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-22 17:11:26,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-22 17:11:26,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 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) [2023-11-22 17:11:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2023-11-22 17:11:26,398 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 5 [2023-11-22 17:11:26,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:11:26,398 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2023-11-22 17:11:26,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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) [2023-11-22 17:11:26,399 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2023-11-22 17:11:26,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-22 17:11:26,399 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:11:26,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:11:26,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-22 17:11:26,400 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-22 17:11:26,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:11:26,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1886904606, now seen corresponding path program 1 times [2023-11-22 17:11:26,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:11:26,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129547581] [2023-11-22 17:11:26,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:11:26,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:11:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:11:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:11:26,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:11:26,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129547581] [2023-11-22 17:11:26,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129547581] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:11:26,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:11:26,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 17:11:26,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334116949] [2023-11-22 17:11:26,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:11:26,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:11:26,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:11:26,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:11:26,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:11:26,456 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:11:26,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:11:26,514 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2023-11-22 17:11:26,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 17:11:26,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-22 17:11:26,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:11:26,517 INFO L225 Difference]: With dead ends: 54 [2023-11-22 17:11:26,517 INFO L226 Difference]: Without dead ends: 54 [2023-11-22 17:11:26,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:11:26,519 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 33 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 17:11:26,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 96 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 17:11:26,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-22 17:11:26,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 37. [2023-11-22 17:11:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 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) [2023-11-22 17:11:26,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2023-11-22 17:11:26,526 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 18 [2023-11-22 17:11:26,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:11:26,527 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2023-11-22 17:11:26,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:11:26,527 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2023-11-22 17:11:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-22 17:11:26,528 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:11:26,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:11:26,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-22 17:11:26,528 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-22 17:11:26,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:11:26,529 INFO L85 PathProgramCache]: Analyzing trace with hash -446918305, now seen corresponding path program 1 times [2023-11-22 17:11:26,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:11:26,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173475493] [2023-11-22 17:11:26,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:11:26,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:11:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:11:26,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:11:26,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:11:26,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173475493] [2023-11-22 17:11:26,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173475493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:11:26,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:11:26,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 17:11:26,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40838161] [2023-11-22 17:11:26,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:11:26,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:11:26,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:11:26,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:11:26,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:11:26,593 INFO L87 Difference]: Start difference. First operand 37 states and 43 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) [2023-11-22 17:11:26,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:11:26,640 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2023-11-22 17:11:26,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 17:11:26,641 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 [2023-11-22 17:11:26,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:11:26,642 INFO L225 Difference]: With dead ends: 49 [2023-11-22 17:11:26,642 INFO L226 Difference]: Without dead ends: 49 [2023-11-22 17:11:26,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:11:26,643 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 18 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 17:11:26,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 86 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 17:11:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-22 17:11:26,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2023-11-22 17:11:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 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) [2023-11-22 17:11:26,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2023-11-22 17:11:26,651 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 20 [2023-11-22 17:11:26,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:11:26,652 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2023-11-22 17:11:26,652 INFO L496 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) [2023-11-22 17:11:26,652 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2023-11-22 17:11:26,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-22 17:11:26,653 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:11:26,654 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:11:26,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-22 17:11:26,654 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-22 17:11:26,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:11:26,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1293631714, now seen corresponding path program 1 times [2023-11-22 17:11:26,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:11:26,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309266369] [2023-11-22 17:11:26,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:11:26,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:11:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:11:26,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:11:26,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:11:26,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309266369] [2023-11-22 17:11:26,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309266369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:11:26,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:11:26,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 17:11:26,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45889182] [2023-11-22 17:11:26,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:11:26,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 17:11:26,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:11:26,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 17:11:26,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:11:26,796 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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) [2023-11-22 17:11:26,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:11:26,864 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2023-11-22 17:11:26,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 17:11:26,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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 [2023-11-22 17:11:26,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:11:26,866 INFO L225 Difference]: With dead ends: 59 [2023-11-22 17:11:26,866 INFO L226 Difference]: Without dead ends: 59 [2023-11-22 17:11:26,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-22 17:11:26,867 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:11:26,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 99 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:11:26,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-22 17:11:26,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2023-11-22 17:11:26,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 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) [2023-11-22 17:11:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2023-11-22 17:11:26,869 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 21 [2023-11-22 17:11:26,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:11:26,870 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-11-22 17:11:26,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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) [2023-11-22 17:11:26,870 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2023-11-22 17:11:26,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-22 17:11:26,871 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:11:26,871 INFO L195 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] [2023-11-22 17:11:26,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-22 17:11:26,871 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-22 17:11:26,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:11:26,872 INFO L85 PathProgramCache]: Analyzing trace with hash 370727185, now seen corresponding path program 1 times [2023-11-22 17:11:26,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:11:26,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560066506] [2023-11-22 17:11:26,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:11:26,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:11:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:11:27,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:11:27,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:11:27,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560066506] [2023-11-22 17:11:27,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560066506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:11:27,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:11:27,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 17:11:27,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706629781] [2023-11-22 17:11:27,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:11:27,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:11:27,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:11:27,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:11:27,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:11:27,291 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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) [2023-11-22 17:11:27,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:11:27,335 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2023-11-22 17:11:27,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 17:11:27,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 [2023-11-22 17:11:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:11:27,337 INFO L225 Difference]: With dead ends: 40 [2023-11-22 17:11:27,337 INFO L226 Difference]: Without dead ends: 0 [2023-11-22 17:11:27,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:11:27,339 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 17:11:27,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 38 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 17:11:27,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-22 17:11:27,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-22 17:11:27,340 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) [2023-11-22 17:11:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-22 17:11:27,340 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2023-11-22 17:11:27,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:11:27,340 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-22 17:11:27,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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) [2023-11-22 17:11:27,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-22 17:11:27,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-22 17:11:27,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 41 remaining) [2023-11-22 17:11:27,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 41 remaining) [2023-11-22 17:11:27,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 41 remaining) [2023-11-22 17:11:27,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 41 remaining) [2023-11-22 17:11:27,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 41 remaining) [2023-11-22 17:11:27,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 41 remaining) [2023-11-22 17:11:27,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 41 remaining) [2023-11-22 17:11:27,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 41 remaining) [2023-11-22 17:11:27,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 41 remaining) [2023-11-22 17:11:27,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 41 remaining) [2023-11-22 17:11:27,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 41 remaining) [2023-11-22 17:11:27,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 41 remaining) [2023-11-22 17:11:27,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 41 remaining) [2023-11-22 17:11:27,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 41 remaining) [2023-11-22 17:11:27,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 41 remaining) [2023-11-22 17:11:27,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 41 remaining) [2023-11-22 17:11:27,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 41 remaining) [2023-11-22 17:11:27,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 41 remaining) [2023-11-22 17:11:27,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 41 remaining) [2023-11-22 17:11:27,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 41 remaining) [2023-11-22 17:11:27,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 41 remaining) [2023-11-22 17:11:27,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 41 remaining) [2023-11-22 17:11:27,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 41 remaining) [2023-11-22 17:11:27,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 41 remaining) [2023-11-22 17:11:27,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 41 remaining) [2023-11-22 17:11:27,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 41 remaining) [2023-11-22 17:11:27,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 41 remaining) [2023-11-22 17:11:27,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 41 remaining) [2023-11-22 17:11:27,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 41 remaining) [2023-11-22 17:11:27,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 41 remaining) [2023-11-22 17:11:27,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 41 remaining) [2023-11-22 17:11:27,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 41 remaining) [2023-11-22 17:11:27,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 41 remaining) [2023-11-22 17:11:27,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 41 remaining) [2023-11-22 17:11:27,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 41 remaining) [2023-11-22 17:11:27,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 41 remaining) [2023-11-22 17:11:27,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 41 remaining) [2023-11-22 17:11:27,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 41 remaining) [2023-11-22 17:11:27,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 41 remaining) [2023-11-22 17:11:27,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 41 remaining) [2023-11-22 17:11:27,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK (0 of 41 remaining) [2023-11-22 17:11:27,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-22 17:11:27,358 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:11:27,361 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 17:11:27,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 05:11:27 BoogieIcfgContainer [2023-11-22 17:11:27,366 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 17:11:27,366 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 17:11:27,366 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 17:11:27,367 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 17:11:27,367 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:11:24" (3/4) ... [2023-11-22 17:11:27,369 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-22 17:11:27,380 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2023-11-22 17:11:27,381 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-22 17:11:27,381 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-22 17:11:27,381 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-22 17:11:27,481 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-22 17:11:27,481 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-22 17:11:27,482 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 17:11:27,482 INFO L158 Benchmark]: Toolchain (without parser) took 3927.64ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 131.8MB in the beginning and 76.9MB in the end (delta: 54.9MB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB. [2023-11-22 17:11:27,482 INFO L158 Benchmark]: CDTParser took 0.66ms. Allocated memory is still 109.1MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 17:11:27,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.83ms. Allocated memory is still 161.5MB. Free memory was 131.8MB in the beginning and 114.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-22 17:11:27,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.39ms. Allocated memory is still 161.5MB. Free memory was 114.0MB in the beginning and 112.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 17:11:27,483 INFO L158 Benchmark]: Boogie Preprocessor took 49.38ms. Allocated memory is still 161.5MB. Free memory was 111.9MB in the beginning and 109.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 17:11:27,484 INFO L158 Benchmark]: RCFGBuilder took 574.50ms. Allocated memory is still 161.5MB. Free memory was 109.8MB in the beginning and 119.3MB in the end (delta: -9.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-22 17:11:27,484 INFO L158 Benchmark]: TraceAbstraction took 2754.20ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 118.3MB in the beginning and 82.2MB in the end (delta: 36.1MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. [2023-11-22 17:11:27,485 INFO L158 Benchmark]: Witness Printer took 115.55ms. Allocated memory is still 195.0MB. Free memory was 82.2MB in the beginning and 76.9MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-22 17:11:27,486 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.66ms. Allocated memory is still 109.1MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.83ms. Allocated memory is still 161.5MB. Free memory was 131.8MB in the beginning and 114.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.39ms. Allocated memory is still 161.5MB. Free memory was 114.0MB in the beginning and 112.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.38ms. Allocated memory is still 161.5MB. Free memory was 111.9MB in the beginning and 109.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 574.50ms. Allocated memory is still 161.5MB. Free memory was 109.8MB in the beginning and 119.3MB in the end (delta: -9.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2754.20ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 118.3MB in the beginning and 82.2MB in the end (delta: 36.1MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. * Witness Printer took 115.55ms. Allocated memory is still 195.0MB. Free memory was 82.2MB in the beginning and 76.9MB in the end (delta: 5.3MB). 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: 563]: 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, 76 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 524 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 524 mSDsluCounter, 541 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 198 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 479 IncrementalHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 343 mSDtfsCounter, 479 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 45 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 1157 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 41 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-22 17:11:27,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE