./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/recursive-with-pointer/simple-recursive.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/recursive-with-pointer/simple-recursive.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4b2b33802a1e3212162c0e55c40efaad08f7abe5e8690f0efef5fec80921b38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 23:16:03,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 23:16:03,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 23:16:03,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 23:16:03,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 23:16:04,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 23:16:04,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 23:16:04,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 23:16:04,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 23:16:04,017 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 23:16:04,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 23:16:04,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 23:16:04,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 23:16:04,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 23:16:04,017 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 23:16:04,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 23:16:04,018 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 23:16:04,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 23:16:04,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 23:16:04,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 23:16:04,018 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 23:16:04,018 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 23:16:04,018 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 23:16:04,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 23:16:04,018 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 23:16:04,018 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 23:16:04,018 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 23:16:04,018 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 23:16:04,018 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 23:16:04,020 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 23:16:04,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 23:16:04,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 23:16:04,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 23:16:04,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:16:04,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 23:16:04,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 23:16:04,021 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 23:16:04,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 23:16:04,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 23:16:04,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 23:16:04,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 23:16:04,021 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 23:16:04,021 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4b2b33802a1e3212162c0e55c40efaad08f7abe5e8690f0efef5fec80921b38 [2025-03-08 23:16:04,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 23:16:04,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 23:16:04,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 23:16:04,262 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 23:16:04,262 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 23:16:04,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-with-pointer/simple-recursive.c [2025-03-08 23:16:05,401 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d50f977b4/008473bd60cb4c3ab966dcbcd0f541bb/FLAG06d66c77e [2025-03-08 23:16:05,636 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 23:16:05,637 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/simple-recursive.c [2025-03-08 23:16:05,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d50f977b4/008473bd60cb4c3ab966dcbcd0f541bb/FLAG06d66c77e [2025-03-08 23:16:05,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d50f977b4/008473bd60cb4c3ab966dcbcd0f541bb [2025-03-08 23:16:05,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 23:16:05,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 23:16:05,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 23:16:05,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 23:16:05,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 23:16:05,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:16:05" (1/1) ... [2025-03-08 23:16:05,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed0eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:05, skipping insertion in model container [2025-03-08 23:16:05,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:16:05" (1/1) ... [2025-03-08 23:16:05,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 23:16:06,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:16:06,077 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 23:16:06,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:16:06,099 INFO L204 MainTranslator]: Completed translation [2025-03-08 23:16:06,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:06 WrapperNode [2025-03-08 23:16:06,100 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 23:16:06,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 23:16:06,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 23:16:06,101 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 23:16:06,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:06" (1/1) ... [2025-03-08 23:16:06,109 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:06" (1/1) ... [2025-03-08 23:16:06,120 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2025-03-08 23:16:06,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 23:16:06,123 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 23:16:06,123 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 23:16:06,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 23:16:06,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:06" (1/1) ... [2025-03-08 23:16:06,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:06" (1/1) ... [2025-03-08 23:16:06,129 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:06" (1/1) ... [2025-03-08 23:16:06,139 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 2 writes are split as follows [0, 2]. [2025-03-08 23:16:06,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:06" (1/1) ... [2025-03-08 23:16:06,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:06" (1/1) ... [2025-03-08 23:16:06,144 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:06" (1/1) ... [2025-03-08 23:16:06,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:06" (1/1) ... [2025-03-08 23:16:06,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:06" (1/1) ... [2025-03-08 23:16:06,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:06" (1/1) ... [2025-03-08 23:16:06,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 23:16:06,148 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 23:16:06,148 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 23:16:06,148 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 23:16:06,149 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:06" (1/1) ... [2025-03-08 23:16:06,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:16:06,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:16:06,174 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 23:16:06,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 23:16:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 23:16:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2025-03-08 23:16:06,194 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2025-03-08 23:16:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 23:16:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 23:16:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 23:16:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure plus [2025-03-08 23:16:06,194 INFO L138 BoogieDeclarations]: Found implementation of procedure plus [2025-03-08 23:16:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 23:16:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 23:16:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 23:16:06,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 23:16:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 23:16:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 23:16:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 23:16:06,240 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 23:16:06,242 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 23:16:06,382 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-08 23:16:06,382 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 23:16:06,391 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 23:16:06,391 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 23:16:06,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:16:06 BoogieIcfgContainer [2025-03-08 23:16:06,392 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 23:16:06,394 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 23:16:06,394 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 23:16:06,397 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 23:16:06,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:16:05" (1/3) ... [2025-03-08 23:16:06,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d2b48f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:16:06, skipping insertion in model container [2025-03-08 23:16:06,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:06" (2/3) ... [2025-03-08 23:16:06,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d2b48f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:16:06, skipping insertion in model container [2025-03-08 23:16:06,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:16:06" (3/3) ... [2025-03-08 23:16:06,399 INFO L128 eAbstractionObserver]: Analyzing ICFG simple-recursive.c [2025-03-08 23:16:06,409 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 23:16:06,410 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG simple-recursive.c that has 3 procedures, 39 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-03-08 23:16:06,434 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 23:16:06,441 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@776da87b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 23:16:06,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-08 23:16:06,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:16:06,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-08 23:16:06,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:16:06,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-08 23:16:06,447 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-03-08 23:16:06,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:16:06,450 INFO L85 PathProgramCache]: Analyzing trace with hash 54582, now seen corresponding path program 1 times [2025-03-08 23:16:06,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:16:06,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977433588] [2025-03-08 23:16:06,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:16:06,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:16:06,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 23:16:06,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 23:16:06,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:16:06,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:16:06,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:16:06,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:16:06,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977433588] [2025-03-08 23:16:06,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977433588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:16:06,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:16:06,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:16:06,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317307362] [2025-03-08 23:16:06,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:16:06,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:16:06,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:16:06,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:16:06,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:16:06,609 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:16:06,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:16:06,651 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2025-03-08 23:16:06,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:16:06,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-08 23:16:06,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:16:06,656 INFO L225 Difference]: With dead ends: 37 [2025-03-08 23:16:06,656 INFO L226 Difference]: Without dead ends: 35 [2025-03-08 23:16:06,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:16:06,659 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:16:06,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:16:06,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-08 23:16:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-08 23:16:06,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 30 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:16:06,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2025-03-08 23:16:06,683 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 3 [2025-03-08 23:16:06,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:16:06,683 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-03-08 23:16:06,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:16:06,683 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2025-03-08 23:16:06,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-08 23:16:06,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:16:06,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-08 23:16:06,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 23:16:06,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-03-08 23:16:06,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:16:06,684 INFO L85 PathProgramCache]: Analyzing trace with hash 54583, now seen corresponding path program 1 times [2025-03-08 23:16:06,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:16:06,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144329394] [2025-03-08 23:16:06,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:16:06,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:16:06,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 23:16:06,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 23:16:06,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:16:06,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:16:06,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:16:06,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:16:06,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144329394] [2025-03-08 23:16:06,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144329394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:16:06,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:16:06,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:16:06,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651074410] [2025-03-08 23:16:06,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:16:06,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:16:06,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:16:06,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:16:06,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:16:06,772 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:16:06,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:16:06,798 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2025-03-08 23:16:06,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:16:06,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-08 23:16:06,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:16:06,799 INFO L225 Difference]: With dead ends: 34 [2025-03-08 23:16:06,799 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 23:16:06,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:16:06,800 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 3 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:16:06,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:16:06,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 23:16:06,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-08 23:16:06,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 29 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:16:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2025-03-08 23:16:06,807 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 3 [2025-03-08 23:16:06,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:16:06,807 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2025-03-08 23:16:06,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:16:06,807 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2025-03-08 23:16:06,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 23:16:06,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:16:06,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 23:16:06,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 23:16:06,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fooErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-03-08 23:16:06,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:16:06,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1626061489, now seen corresponding path program 1 times [2025-03-08 23:16:06,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:16:06,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304151553] [2025-03-08 23:16:06,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:16:06,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:16:06,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 23:16:06,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 23:16:06,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:16:06,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:16:06,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:16:06,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:16:06,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304151553] [2025-03-08 23:16:06,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304151553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:16:06,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:16:06,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:16:06,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887286788] [2025-03-08 23:16:06,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:16:06,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:16:06,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:16:06,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:16:06,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:16:06,890 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:16:06,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:16:06,970 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2025-03-08 23:16:06,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:16:06,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-08 23:16:06,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:16:06,971 INFO L225 Difference]: With dead ends: 50 [2025-03-08 23:16:06,971 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 23:16:06,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:16:06,972 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 19 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:16:06,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 73 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:16:06,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 23:16:06,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2025-03-08 23:16:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.52) internal successors, (38), 35 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 23:16:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-03-08 23:16:06,976 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 6 [2025-03-08 23:16:06,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:16:06,976 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-03-08 23:16:06,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:16:06,976 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-03-08 23:16:06,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 23:16:06,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:16:06,976 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 23:16:06,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 23:16:06,976 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fooErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-03-08 23:16:06,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:16:06,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1626061490, now seen corresponding path program 1 times [2025-03-08 23:16:06,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:16:06,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942989213] [2025-03-08 23:16:06,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:16:06,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:16:06,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 23:16:06,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 23:16:06,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:16:06,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:16:07,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:16:07,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:16:07,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942989213] [2025-03-08 23:16:07,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942989213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:16:07,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:16:07,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:16:07,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051771343] [2025-03-08 23:16:07,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:16:07,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:16:07,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:16:07,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:16:07,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:16:07,098 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:16:07,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:16:07,173 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2025-03-08 23:16:07,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:16:07,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-08 23:16:07,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:16:07,174 INFO L225 Difference]: With dead ends: 46 [2025-03-08 23:16:07,174 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 23:16:07,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:16:07,175 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 16 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:16:07,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 83 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:16:07,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 23:16:07,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2025-03-08 23:16:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.44) internal successors, (36), 35 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 23:16:07,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2025-03-08 23:16:07,178 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 6 [2025-03-08 23:16:07,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:16:07,178 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2025-03-08 23:16:07,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:16:07,178 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2025-03-08 23:16:07,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 23:16:07,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:16:07,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:16:07,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 23:16:07,179 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting plusErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-03-08 23:16:07,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:16:07,179 INFO L85 PathProgramCache]: Analyzing trace with hash 976218675, now seen corresponding path program 1 times [2025-03-08 23:16:07,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:16:07,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582073473] [2025-03-08 23:16:07,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:16:07,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:16:07,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 23:16:07,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 23:16:07,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:16:07,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:16:07,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:16:07,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:16:07,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582073473] [2025-03-08 23:16:07,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582073473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:16:07,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:16:07,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:16:07,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728314788] [2025-03-08 23:16:07,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:16:07,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:16:07,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:16:07,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:16:07,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:16:07,253 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:16:07,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:16:07,308 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2025-03-08 23:16:07,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:16:07,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 23:16:07,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:16:07,309 INFO L225 Difference]: With dead ends: 43 [2025-03-08 23:16:07,309 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 23:16:07,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:16:07,309 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:16:07,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 60 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:16:07,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 23:16:07,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2025-03-08 23:16:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.36) internal successors, (34), 33 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 23:16:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2025-03-08 23:16:07,312 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2025-03-08 23:16:07,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:16:07,312 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2025-03-08 23:16:07,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:16:07,312 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2025-03-08 23:16:07,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 23:16:07,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:16:07,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:16:07,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 23:16:07,313 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting plusErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-03-08 23:16:07,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:16:07,315 INFO L85 PathProgramCache]: Analyzing trace with hash 976218676, now seen corresponding path program 1 times [2025-03-08 23:16:07,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:16:07,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722273965] [2025-03-08 23:16:07,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:16:07,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:16:07,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 23:16:07,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 23:16:07,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:16:07,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:16:07,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:16:07,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:16:07,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722273965] [2025-03-08 23:16:07,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722273965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:16:07,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:16:07,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 23:16:07,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216693837] [2025-03-08 23:16:07,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:16:07,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:16:07,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:16:07,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:16:07,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:16:07,463 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:16:07,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:16:07,540 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2025-03-08 23:16:07,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:16:07,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 23:16:07,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:16:07,541 INFO L225 Difference]: With dead ends: 39 [2025-03-08 23:16:07,541 INFO L226 Difference]: Without dead ends: 39 [2025-03-08 23:16:07,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:16:07,541 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:16:07,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 64 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:16:07,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-08 23:16:07,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2025-03-08 23:16:07,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.2) internal successors, (30), 29 states have internal predecessors, (30), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 23:16:07,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2025-03-08 23:16:07,544 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 10 [2025-03-08 23:16:07,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:16:07,544 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2025-03-08 23:16:07,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:16:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2025-03-08 23:16:07,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 23:16:07,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:16:07,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:16:07,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 23:16:07,545 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fooErr0ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-03-08 23:16:07,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:16:07,546 INFO L85 PathProgramCache]: Analyzing trace with hash 206320601, now seen corresponding path program 1 times [2025-03-08 23:16:07,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:16:07,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992881199] [2025-03-08 23:16:07,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:16:07,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:16:07,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 23:16:07,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 23:16:07,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:16:07,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:16:07,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:16:07,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:16:07,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992881199] [2025-03-08 23:16:07,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992881199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:16:07,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:16:07,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 23:16:07,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364423382] [2025-03-08 23:16:07,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:16:07,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:16:07,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:16:07,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:16:07,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:16:07,615 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:16:07,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:16:07,676 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2025-03-08 23:16:07,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:16:07,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 23:16:07,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:16:07,677 INFO L225 Difference]: With dead ends: 33 [2025-03-08 23:16:07,677 INFO L226 Difference]: Without dead ends: 33 [2025-03-08 23:16:07,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:16:07,677 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:16:07,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 100 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:16:07,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-08 23:16:07,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-08 23:16:07,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 26 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 23:16:07,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2025-03-08 23:16:07,680 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 11 [2025-03-08 23:16:07,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:16:07,680 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2025-03-08 23:16:07,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:16:07,680 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2025-03-08 23:16:07,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 23:16:07,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:16:07,680 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:16:07,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 23:16:07,680 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fooErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-03-08 23:16:07,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:16:07,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1705962469, now seen corresponding path program 1 times [2025-03-08 23:16:07,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:16:07,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870837950] [2025-03-08 23:16:07,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:16:07,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:16:07,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 23:16:07,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 23:16:07,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:16:07,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:16:07,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:16:07,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:16:07,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870837950] [2025-03-08 23:16:07,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870837950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:16:07,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:16:07,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:16:07,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164487141] [2025-03-08 23:16:07,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:16:07,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:16:07,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:16:07,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:16:07,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:16:07,735 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:16:07,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:16:07,798 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2025-03-08 23:16:07,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:16:07,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 23:16:07,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:16:07,800 INFO L225 Difference]: With dead ends: 34 [2025-03-08 23:16:07,800 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 23:16:07,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:16:07,801 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:16:07,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 63 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:16:07,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 23:16:07,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-03-08 23:16:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 23:16:07,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2025-03-08 23:16:07,806 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 16 [2025-03-08 23:16:07,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:16:07,806 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2025-03-08 23:16:07,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:16:07,806 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2025-03-08 23:16:07,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 23:16:07,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:16:07,807 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:16:07,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 23:16:07,807 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fooErr0ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-03-08 23:16:07,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:16:07,807 INFO L85 PathProgramCache]: Analyzing trace with hash 2117610671, now seen corresponding path program 1 times [2025-03-08 23:16:07,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:16:07,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091986411] [2025-03-08 23:16:07,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:16:07,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:16:07,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 23:16:07,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 23:16:07,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:16:07,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:16:08,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:16:08,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:16:08,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091986411] [2025-03-08 23:16:08,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091986411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:16:08,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664401874] [2025-03-08 23:16:08,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:16:08,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:16:08,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:16:08,079 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:16:08,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 23:16:08,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 23:16:08,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 23:16:08,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:16:08,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:16:08,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-08 23:16:08,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:16:08,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:16:08,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-08 23:16:08,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:16:08,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:16:08,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:16:08,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664401874] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:16:08,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:16:08,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 29 [2025-03-08 23:16:08,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028421535] [2025-03-08 23:16:08,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:16:08,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 23:16:08,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:16:08,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 23:16:08,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2025-03-08 23:16:08,574 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 29 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 23 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:16:08,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:16:08,985 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2025-03-08 23:16:08,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 23:16:08,986 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 23 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-08 23:16:08,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:16:08,987 INFO L225 Difference]: With dead ends: 58 [2025-03-08 23:16:08,987 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 23:16:08,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=236, Invalid=1656, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 23:16:08,988 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:16:08,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 248 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:16:08,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 23:16:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2025-03-08 23:16:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.069767441860465) internal successors, (46), 45 states have internal predecessors, (46), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-08 23:16:08,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2025-03-08 23:16:08,993 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 21 [2025-03-08 23:16:08,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:16:08,995 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2025-03-08 23:16:08,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 23 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:16:08,995 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2025-03-08 23:16:08,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 23:16:08,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:16:08,996 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:16:09,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 23:16:09,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:16:09,201 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fooErr0ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-03-08 23:16:09,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:16:09,201 INFO L85 PathProgramCache]: Analyzing trace with hash -824654885, now seen corresponding path program 2 times [2025-03-08 23:16:09,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:16:09,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782127574] [2025-03-08 23:16:09,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:16:09,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:16:09,214 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-08 23:16:09,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:16:09,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:16:09,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:16:09,846 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:16:09,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:16:09,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782127574] [2025-03-08 23:16:09,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782127574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:16:09,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990170827] [2025-03-08 23:16:09,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:16:09,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:16:09,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:16:09,848 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:16:09,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 23:16:09,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-08 23:16:09,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:16:09,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:16:09,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:16:09,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-03-08 23:16:09,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:16:09,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:16:10,225 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:16:10,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:16:10,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 27 [2025-03-08 23:16:10,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 23:16:10,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 23:16:10,780 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:16:10,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:16:11,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-08 23:16:11,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-08 23:16:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:16:11,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990170827] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:16:11,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:16:11,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27, 28] total 75 [2025-03-08 23:16:11,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943276822] [2025-03-08 23:16:11,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:16:11,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2025-03-08 23:16:11,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:16:11,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2025-03-08 23:16:11,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=454, Invalid=5096, Unknown=0, NotChecked=0, Total=5550 [2025-03-08 23:16:11,625 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 75 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 54 states have internal predecessors, (93), 21 states have call successors, (21), 21 states have call predecessors, (21), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:16:13,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:16:13,217 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2025-03-08 23:16:13,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-08 23:16:13,218 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 54 states have internal predecessors, (93), 21 states have call successors, (21), 21 states have call predecessors, (21), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-08 23:16:13,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:16:13,219 INFO L225 Difference]: With dead ends: 98 [2025-03-08 23:16:13,219 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 23:16:13,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4166 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1215, Invalid=11895, Unknown=0, NotChecked=0, Total=13110 [2025-03-08 23:16:13,226 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 101 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:16:13,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 585 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 23:16:13,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 23:16:13,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-03-08 23:16:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.04) internal successors, (78), 77 states have internal predecessors, (78), 15 states have call successors, (15), 15 states have call predecessors, (15), 5 states have return successors, (17), 5 states have call predecessors, (17), 15 states have call successors, (17) [2025-03-08 23:16:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2025-03-08 23:16:13,238 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 41 [2025-03-08 23:16:13,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:16:13,238 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2025-03-08 23:16:13,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 54 states have internal predecessors, (93), 21 states have call successors, (21), 21 states have call predecessors, (21), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:16:13,238 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2025-03-08 23:16:13,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 23:16:13,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:16:13,239 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:16:13,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 23:16:13,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 23:16:13,446 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fooErr0ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-03-08 23:16:13,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:16:13,447 INFO L85 PathProgramCache]: Analyzing trace with hash -938014669, now seen corresponding path program 3 times [2025-03-08 23:16:13,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:16:13,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120604373] [2025-03-08 23:16:13,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 23:16:13,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:16:13,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 81 statements into 8 equivalence classes. [2025-03-08 23:16:13,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 81 statements. [2025-03-08 23:16:13,466 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 23:16:13,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:16:13,634 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 68 proven. 1 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-08 23:16:13,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:16:13,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120604373] [2025-03-08 23:16:13,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120604373] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:16:13,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666249188] [2025-03-08 23:16:13,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 23:16:13,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:16:13,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:16:13,636 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:16:13,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 23:16:13,680 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 81 statements into 8 equivalence classes. [2025-03-08 23:16:13,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 81 statements. [2025-03-08 23:16:13,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 23:16:13,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:16:13,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 23:16:13,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:16:13,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 23:16:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 68 proven. 1 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-08 23:16:13,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:16:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 68 proven. 1 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-08 23:16:13,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666249188] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:16:13,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:16:13,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 20 [2025-03-08 23:16:13,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115974940] [2025-03-08 23:16:13,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:16:13,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 23:16:13,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:16:13,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 23:16:13,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-03-08 23:16:13,867 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 3 states have call successors, (5), 3 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:16:14,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:16:14,020 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2025-03-08 23:16:14,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 23:16:14,020 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 3 states have call successors, (5), 3 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-08 23:16:14,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:16:14,021 INFO L225 Difference]: With dead ends: 98 [2025-03-08 23:16:14,021 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 23:16:14,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 148 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2025-03-08 23:16:14,022 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:16:14,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 151 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:16:14,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 23:16:14,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 82. [2025-03-08 23:16:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 63 states have internal predecessors, (64), 13 states have call successors, (13), 13 states have call predecessors, (13), 5 states have return successors, (15), 5 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-08 23:16:14,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2025-03-08 23:16:14,031 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 81 [2025-03-08 23:16:14,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:16:14,031 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2025-03-08 23:16:14,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 3 states have call successors, (5), 3 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:16:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2025-03-08 23:16:14,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 23:16:14,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:16:14,033 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:16:14,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 23:16:14,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:16:14,234 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-03-08 23:16:14,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:16:14,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2004706623, now seen corresponding path program 1 times [2025-03-08 23:16:14,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:16:14,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177062810] [2025-03-08 23:16:14,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:16:14,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:16:14,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 23:16:14,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 23:16:14,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:16:14,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:16:15,551 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 21 proven. 72 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-08 23:16:15,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:16:15,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177062810] [2025-03-08 23:16:15,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177062810] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:16:15,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150761529] [2025-03-08 23:16:15,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:16:15,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:16:15,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:16:15,554 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:16:15,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 23:16:15,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 23:16:15,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 23:16:15,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:16:15,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:16:15,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 23:16:15,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:16:15,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2025-03-08 23:16:15,677 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#x~0#1.base_7| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#x~0#1.base_7|) 0) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#x~0#1.base_7| 0)))) is different from true [2025-03-08 23:16:15,678 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-03-08 23:16:15,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:16:15,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150761529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:16:15,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:16:15,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [26] total 28 [2025-03-08 23:16:15,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096204039] [2025-03-08 23:16:15,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:16:15,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:16:15,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:16:15,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:16:15,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=591, Unknown=1, NotChecked=50, Total=756 [2025-03-08 23:16:15,680 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:16:15,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:16:15,689 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2025-03-08 23:16:15,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:16:15,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 97 [2025-03-08 23:16:15,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:16:15,690 INFO L225 Difference]: With dead ends: 81 [2025-03-08 23:16:15,690 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 23:16:15,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=591, Unknown=1, NotChecked=50, Total=756 [2025-03-08 23:16:15,691 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:16:15,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 22 Unchecked, 0.0s Time] [2025-03-08 23:16:15,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 23:16:15,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 23:16:15,692 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) [2025-03-08 23:16:15,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 23:16:15,692 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2025-03-08 23:16:15,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:16:15,692 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 23:16:15,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:16:15,693 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 23:16:15,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 23:16:15,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fooErr0ASSERT_VIOLATIONMEMORY_LEAK (11 of 12 remaining) [2025-03-08 23:16:15,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2025-03-08 23:16:15,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2025-03-08 23:16:15,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fooErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2025-03-08 23:16:15,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fooErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2025-03-08 23:16:15,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 12 remaining) [2025-03-08 23:16:15,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2025-03-08 23:16:15,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2025-03-08 23:16:15,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location plusErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 12 remaining) [2025-03-08 23:16:15,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location plusErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 12 remaining) [2025-03-08 23:16:15,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location plusErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 12 remaining) [2025-03-08 23:16:15,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location plusErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 12 remaining) [2025-03-08 23:16:15,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 23:16:15,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:16:15,902 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:16:15,904 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 23:16:15,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 11:16:15 BoogieIcfgContainer [2025-03-08 23:16:15,906 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 23:16:15,906 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 23:16:15,906 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 23:16:15,907 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 23:16:15,907 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:16:06" (3/4) ... [2025-03-08 23:16:15,908 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 23:16:15,912 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure foo [2025-03-08 23:16:15,913 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure plus [2025-03-08 23:16:15,915 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-08 23:16:15,915 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-08 23:16:15,915 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 23:16:15,915 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 23:16:15,915 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 23:16:15,965 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 23:16:15,965 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 23:16:15,965 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 23:16:15,965 INFO L158 Benchmark]: Toolchain (without parser) took 10001.98ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 111.7MB in the beginning and 294.3MB in the end (delta: -182.6MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. [2025-03-08 23:16:15,966 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 23:16:15,966 INFO L158 Benchmark]: CACSL2BoogieTranslator took 135.51ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 101.1MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 23:16:15,966 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.19ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 100.1MB in the end (delta: 978.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 23:16:15,966 INFO L158 Benchmark]: Boogie Preprocessor took 24.83ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 98.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 23:16:15,966 INFO L158 Benchmark]: IcfgBuilder took 243.56ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 86.4MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 23:16:15,966 INFO L158 Benchmark]: TraceAbstraction took 9512.32ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 85.9MB in the beginning and 302.6MB in the end (delta: -216.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2025-03-08 23:16:15,967 INFO L158 Benchmark]: Witness Printer took 58.59ms. Allocated memory is still 402.7MB. Free memory was 302.6MB in the beginning and 294.3MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 23:16:15,967 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.22ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 135.51ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 101.1MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.19ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 100.1MB in the end (delta: 978.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.83ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 98.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 243.56ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 86.4MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9512.32ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 85.9MB in the beginning and 302.6MB in the end (delta: -216.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Witness Printer took 58.59ms. Allocated memory is still 402.7MB. Free memory was 302.6MB in the beginning and 294.3MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. 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: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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: 22]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 39 locations, 44 edges, 12 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 12, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 253 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 1571 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 22 IncrementalHoareTripleChecker+Unchecked, 1270 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1769 IncrementalHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 301 mSDtfsCounter, 1769 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 599 GetRequests, 350 SyntacticMatches, 9 SemanticMatches, 240 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=10, InterpolantAutomatonStates: 141, 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, 42 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 545 NumberOfCodeBlocks, 425 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 669 ConstructedInterpolants, 16 QuantifiedInterpolants, 3237 SizeOfPredicates, 41 NumberOfNonLiveVariables, 841 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 19 InterpolantComputations, 9 PerfectInterpolantSequences, 1100/1301 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 23:16:15,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE