./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/simple-recursive.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 15:03:47,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 15:03:47,172 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 15:03:47,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 15:03:47,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 15:03:47,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 15:03:47,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 15:03:47,195 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 15:03:47,195 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 15:03:47,195 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 15:03:47,195 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 15:03:47,196 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 15:03:47,196 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 15:03:47,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 15:03:47,199 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 15:03:47,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 15:03:47,199 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 15:03:47,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 15:03:47,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 15:03:47,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 15:03:47,200 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 15:03:47,201 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 15:03:47,201 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 15:03:47,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 15:03:47,201 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 15:03:47,201 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 15:03:47,202 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 15:03:47,202 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 15:03:47,202 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 15:03:47,202 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 15:03:47,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 15:03:47,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 15:03:47,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 15:03:47,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 15:03:47,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 15:03:47,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 15:03:47,203 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 15:03:47,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 15:03:47,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 15:03:47,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 15:03:47,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 15:03:47,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 15:03:47,205 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4b2b33802a1e3212162c0e55c40efaad08f7abe5e8690f0efef5fec80921b38 [2024-11-20 15:03:47,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 15:03:47,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 15:03:47,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 15:03:47,421 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 15:03:47,422 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 15:03:47,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/simple-recursive.c [2024-11-20 15:03:48,606 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 15:03:48,776 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 15:03:48,777 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/simple-recursive.c [2024-11-20 15:03:48,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87c47482a/5d94eddb49ec4fb9b3f5e3594bfe90a3/FLAG8b0e8245f [2024-11-20 15:03:49,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87c47482a/5d94eddb49ec4fb9b3f5e3594bfe90a3 [2024-11-20 15:03:49,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 15:03:49,187 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 15:03:49,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 15:03:49,188 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 15:03:49,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 15:03:49,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:03:49" (1/1) ... [2024-11-20 15:03:49,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@400e5283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:49, skipping insertion in model container [2024-11-20 15:03:49,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:03:49" (1/1) ... [2024-11-20 15:03:49,206 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 15:03:49,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 15:03:49,350 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 15:03:49,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 15:03:49,375 INFO L204 MainTranslator]: Completed translation [2024-11-20 15:03:49,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:49 WrapperNode [2024-11-20 15:03:49,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 15:03:49,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 15:03:49,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 15:03:49,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 15:03:49,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:49" (1/1) ... [2024-11-20 15:03:49,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:49" (1/1) ... [2024-11-20 15:03:49,400 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2024-11-20 15:03:49,400 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 15:03:49,401 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 15:03:49,401 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 15:03:49,401 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 15:03:49,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:49" (1/1) ... [2024-11-20 15:03:49,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:49" (1/1) ... [2024-11-20 15:03:49,414 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:49" (1/1) ... [2024-11-20 15:03:49,424 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]. [2024-11-20 15:03:49,425 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:49" (1/1) ... [2024-11-20 15:03:49,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:49" (1/1) ... [2024-11-20 15:03:49,429 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:49" (1/1) ... [2024-11-20 15:03:49,430 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:49" (1/1) ... [2024-11-20 15:03:49,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:49" (1/1) ... [2024-11-20 15:03:49,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:49" (1/1) ... [2024-11-20 15:03:49,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 15:03:49,433 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 15:03:49,433 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 15:03:49,433 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 15:03:49,434 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:49" (1/1) ... [2024-11-20 15:03:49,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 15:03:49,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:03:49,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 15:03:49,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 15:03:49,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 15:03:49,498 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2024-11-20 15:03:49,498 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2024-11-20 15:03:49,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 15:03:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 15:03:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 15:03:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure plus [2024-11-20 15:03:49,499 INFO L138 BoogieDeclarations]: Found implementation of procedure plus [2024-11-20 15:03:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 15:03:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 15:03:49,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 15:03:49,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 15:03:49,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 15:03:49,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 15:03:49,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 15:03:49,559 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 15:03:49,561 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 15:03:49,703 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-20 15:03:49,706 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 15:03:49,717 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 15:03:49,718 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 15:03:49,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:03:49 BoogieIcfgContainer [2024-11-20 15:03:49,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 15:03:49,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 15:03:49,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 15:03:49,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 15:03:49,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:03:49" (1/3) ... [2024-11-20 15:03:49,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46bc1752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:03:49, skipping insertion in model container [2024-11-20 15:03:49,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:49" (2/3) ... [2024-11-20 15:03:49,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46bc1752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:03:49, skipping insertion in model container [2024-11-20 15:03:49,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:03:49" (3/3) ... [2024-11-20 15:03:49,727 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-recursive.c [2024-11-20 15:03:49,746 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 15:03:49,747 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-20 15:03:49,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 15:03:49,791 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;@65202f2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 15:03:49,791 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-20 15:03:49,794 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) [2024-11-20 15:03:49,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-20 15:03:49,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:03:49,800 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-20 15:03:49,800 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-20 15:03:49,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:03:49,806 INFO L85 PathProgramCache]: Analyzing trace with hash 54682, now seen corresponding path program 1 times [2024-11-20 15:03:49,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:03:49,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399897509] [2024-11-20 15:03:49,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:03:49,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:03:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:49,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:03:49,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:03:49,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399897509] [2024-11-20 15:03:49,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399897509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:03:49,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:03:49,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 15:03:49,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089324754] [2024-11-20 15:03:49,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:03:49,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:03:49,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:03:50,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:03:50,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:03:50,013 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) [2024-11-20 15:03:50,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:03:50,060 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2024-11-20 15:03:50,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:03:50,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-20 15:03:50,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:03:50,067 INFO L225 Difference]: With dead ends: 37 [2024-11-20 15:03:50,067 INFO L226 Difference]: Without dead ends: 35 [2024-11-20 15:03:50,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:03:50,070 INFO L432 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 [2024-11-20 15:03:50,071 INFO L433 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] [2024-11-20 15:03:50,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-20 15:03:50,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-20 15:03:50,094 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) [2024-11-20 15:03:50,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-11-20 15:03:50,095 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 3 [2024-11-20 15:03:50,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:03:50,095 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-11-20 15:03:50,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:03:50,096 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2024-11-20 15:03:50,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-20 15:03:50,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:03:50,096 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-20 15:03:50,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 15:03:50,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-20 15:03:50,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:03:50,097 INFO L85 PathProgramCache]: Analyzing trace with hash 54683, now seen corresponding path program 1 times [2024-11-20 15:03:50,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:03:50,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850228042] [2024-11-20 15:03:50,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:03:50,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:03:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:03:50,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:03:50,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850228042] [2024-11-20 15:03:50,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850228042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:03:50,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:03:50,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 15:03:50,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954337037] [2024-11-20 15:03:50,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:03:50,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:03:50,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:03:50,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:03:50,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:03:50,240 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) [2024-11-20 15:03:50,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:03:50,257 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-11-20 15:03:50,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:03:50,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-20 15:03:50,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:03:50,258 INFO L225 Difference]: With dead ends: 34 [2024-11-20 15:03:50,258 INFO L226 Difference]: Without dead ends: 34 [2024-11-20 15:03:50,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:03:50,259 INFO L432 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 [2024-11-20 15:03:50,260 INFO L433 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] [2024-11-20 15:03:50,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-20 15:03:50,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-20 15:03:50,265 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) [2024-11-20 15:03:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-11-20 15:03:50,267 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 3 [2024-11-20 15:03:50,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:03:50,267 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-11-20 15:03:50,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:03:50,267 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-11-20 15:03:50,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 15:03:50,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:03:50,268 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 15:03:50,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 15:03:50,269 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-20 15:03:50,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:03:50,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1629049723, now seen corresponding path program 1 times [2024-11-20 15:03:50,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:03:50,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879824819] [2024-11-20 15:03:50,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:03:50,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:03:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:50,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:03:50,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:03:50,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879824819] [2024-11-20 15:03:50,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879824819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:03:50,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:03:50,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 15:03:50,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927695498] [2024-11-20 15:03:50,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:03:50,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 15:03:50,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:03:50,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 15:03:50,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 15:03:50,352 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) [2024-11-20 15:03:50,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:03:50,444 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2024-11-20 15:03:50,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 15:03:50,445 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 [2024-11-20 15:03:50,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:03:50,447 INFO L225 Difference]: With dead ends: 50 [2024-11-20 15:03:50,447 INFO L226 Difference]: Without dead ends: 50 [2024-11-20 15:03:50,447 INFO L431 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 [2024-11-20 15:03:50,448 INFO L432 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 [2024-11-20 15:03:50,448 INFO L433 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] [2024-11-20 15:03:50,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-20 15:03:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2024-11-20 15:03:50,452 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) [2024-11-20 15:03:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-11-20 15:03:50,453 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 6 [2024-11-20 15:03:50,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:03:50,453 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-11-20 15:03:50,454 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) [2024-11-20 15:03:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-11-20 15:03:50,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 15:03:50,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:03:50,454 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 15:03:50,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 15:03:50,455 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-20 15:03:50,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:03:50,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1629049724, now seen corresponding path program 1 times [2024-11-20 15:03:50,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:03:50,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011532935] [2024-11-20 15:03:50,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:03:50,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:03:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:50,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:03:50,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:03:50,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011532935] [2024-11-20 15:03:50,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011532935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:03:50,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:03:50,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 15:03:50,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957902485] [2024-11-20 15:03:50,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:03:50,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 15:03:50,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:03:50,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 15:03:50,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 15:03:50,587 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) [2024-11-20 15:03:50,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:03:50,661 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2024-11-20 15:03:50,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 15:03:50,662 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 [2024-11-20 15:03:50,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:03:50,662 INFO L225 Difference]: With dead ends: 46 [2024-11-20 15:03:50,662 INFO L226 Difference]: Without dead ends: 46 [2024-11-20 15:03:50,664 INFO L431 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 [2024-11-20 15:03:50,665 INFO L432 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 [2024-11-20 15:03:50,665 INFO L433 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] [2024-11-20 15:03:50,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-20 15:03:50,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2024-11-20 15:03:50,669 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) [2024-11-20 15:03:50,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-11-20 15:03:50,670 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 6 [2024-11-20 15:03:50,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:03:50,670 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-11-20 15:03:50,670 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) [2024-11-20 15:03:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-11-20 15:03:50,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-20 15:03:50,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:03:50,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:03:50,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 15:03:50,672 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting plusErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-20 15:03:50,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:03:50,673 INFO L85 PathProgramCache]: Analyzing trace with hash -990742138, now seen corresponding path program 1 times [2024-11-20 15:03:50,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:03:50,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957270805] [2024-11-20 15:03:50,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:03:50,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:03:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:50,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:03:50,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:03:50,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957270805] [2024-11-20 15:03:50,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957270805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:03:50,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:03:50,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 15:03:50,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797847642] [2024-11-20 15:03:50,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:03:50,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 15:03:50,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:03:50,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 15:03:50,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 15:03:50,715 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) [2024-11-20 15:03:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:03:50,766 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2024-11-20 15:03:50,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 15:03:50,767 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 [2024-11-20 15:03:50,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:03:50,767 INFO L225 Difference]: With dead ends: 43 [2024-11-20 15:03:50,768 INFO L226 Difference]: Without dead ends: 43 [2024-11-20 15:03:50,768 INFO L431 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 [2024-11-20 15:03:50,769 INFO L432 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 [2024-11-20 15:03:50,772 INFO L433 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] [2024-11-20 15:03:50,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-20 15:03:50,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2024-11-20 15:03:50,776 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) [2024-11-20 15:03:50,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-11-20 15:03:50,777 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2024-11-20 15:03:50,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:03:50,777 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-11-20 15:03:50,777 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) [2024-11-20 15:03:50,777 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-11-20 15:03:50,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-20 15:03:50,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:03:50,778 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:03:50,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 15:03:50,778 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting plusErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-20 15:03:50,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:03:50,778 INFO L85 PathProgramCache]: Analyzing trace with hash -990742137, now seen corresponding path program 1 times [2024-11-20 15:03:50,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:03:50,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423149507] [2024-11-20 15:03:50,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:03:50,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:03:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:03:50,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:03:50,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423149507] [2024-11-20 15:03:50,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423149507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:03:50,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:03:50,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 15:03:50,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192970602] [2024-11-20 15:03:50,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:03:50,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 15:03:50,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:03:50,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 15:03:50,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 15:03:50,949 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) [2024-11-20 15:03:51,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:03:51,033 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2024-11-20 15:03:51,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 15:03:51,033 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 [2024-11-20 15:03:51,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:03:51,034 INFO L225 Difference]: With dead ends: 39 [2024-11-20 15:03:51,037 INFO L226 Difference]: Without dead ends: 39 [2024-11-20 15:03:51,037 INFO L431 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 [2024-11-20 15:03:51,038 INFO L432 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 [2024-11-20 15:03:51,038 INFO L433 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] [2024-11-20 15:03:51,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-20 15:03:51,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2024-11-20 15:03:51,044 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) [2024-11-20 15:03:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-20 15:03:51,044 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 10 [2024-11-20 15:03:51,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:03:51,044 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-20 15:03:51,044 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) [2024-11-20 15:03:51,044 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-20 15:03:51,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 15:03:51,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:03:51,045 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:03:51,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 15:03:51,045 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fooErr4ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-20 15:03:51,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:03:51,046 INFO L85 PathProgramCache]: Analyzing trace with hash -646617514, now seen corresponding path program 1 times [2024-11-20 15:03:51,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:03:51,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537818356] [2024-11-20 15:03:51,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:03:51,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:03:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:03:51,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:03:51,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537818356] [2024-11-20 15:03:51,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537818356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:03:51,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:03:51,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 15:03:51,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702839308] [2024-11-20 15:03:51,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:03:51,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 15:03:51,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:03:51,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 15:03:51,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 15:03:51,135 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) [2024-11-20 15:03:51,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:03:51,173 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2024-11-20 15:03:51,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 15:03:51,173 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 [2024-11-20 15:03:51,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:03:51,174 INFO L225 Difference]: With dead ends: 33 [2024-11-20 15:03:51,174 INFO L226 Difference]: Without dead ends: 33 [2024-11-20 15:03:51,174 INFO L431 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 [2024-11-20 15:03:51,175 INFO L432 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 [2024-11-20 15:03:51,175 INFO L433 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] [2024-11-20 15:03:51,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-20 15:03:51,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-20 15:03:51,177 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) [2024-11-20 15:03:51,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-11-20 15:03:51,178 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 11 [2024-11-20 15:03:51,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:03:51,178 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-11-20 15:03:51,178 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) [2024-11-20 15:03:51,178 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-11-20 15:03:51,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 15:03:51,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:03:51,178 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:03:51,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 15:03:51,179 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-20 15:03:51,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:03:51,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1567376975, now seen corresponding path program 1 times [2024-11-20 15:03:51,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:03:51,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883868251] [2024-11-20 15:03:51,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:03:51,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:03:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:51,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:03:51,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:03:51,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883868251] [2024-11-20 15:03:51,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883868251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:03:51,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:03:51,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 15:03:51,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744876235] [2024-11-20 15:03:51,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:03:51,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 15:03:51,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:03:51,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 15:03:51,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 15:03:51,226 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) [2024-11-20 15:03:51,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:03:51,277 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-11-20 15:03:51,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 15:03:51,277 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 [2024-11-20 15:03:51,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:03:51,278 INFO L225 Difference]: With dead ends: 34 [2024-11-20 15:03:51,278 INFO L226 Difference]: Without dead ends: 34 [2024-11-20 15:03:51,278 INFO L431 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 [2024-11-20 15:03:51,279 INFO L432 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 [2024-11-20 15:03:51,279 INFO L433 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] [2024-11-20 15:03:51,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-20 15:03:51,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-20 15:03:51,281 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) [2024-11-20 15:03:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-11-20 15:03:51,281 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 16 [2024-11-20 15:03:51,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:03:51,283 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-11-20 15:03:51,283 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) [2024-11-20 15:03:51,283 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-11-20 15:03:51,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-20 15:03:51,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:03:51,283 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:03:51,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 15:03:51,283 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fooErr4ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-20 15:03:51,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:03:51,284 INFO L85 PathProgramCache]: Analyzing trace with hash 518854658, now seen corresponding path program 1 times [2024-11-20 15:03:51,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:03:51,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259514841] [2024-11-20 15:03:51,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:03:51,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:03:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:51,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:03:51,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:03:51,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259514841] [2024-11-20 15:03:51,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259514841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:03:51,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746414099] [2024-11-20 15:03:51,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:03:51,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:03:51,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:03:51,497 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 15:03:51,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 15:03:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:51,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-20 15:03:51,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:03:51,592 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 [2024-11-20 15:03:51,679 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 [2024-11-20 15:03:51,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:03:51,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:03:51,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:03:51,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746414099] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:03:51,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:03:51,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 29 [2024-11-20 15:03:51,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035088565] [2024-11-20 15:03:51,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:03:51,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-20 15:03:51,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:03:51,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-20 15:03:51,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2024-11-20 15:03:51,998 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) [2024-11-20 15:03:52,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:03:52,435 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2024-11-20 15:03:52,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-20 15:03:52,435 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 [2024-11-20 15:03:52,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:03:52,436 INFO L225 Difference]: With dead ends: 58 [2024-11-20 15:03:52,436 INFO L226 Difference]: Without dead ends: 58 [2024-11-20 15:03:52,437 INFO L431 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 [2024-11-20 15:03:52,438 INFO L432 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 [2024-11-20 15:03:52,438 INFO L433 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] [2024-11-20 15:03:52,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-20 15:03:52,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2024-11-20 15:03:52,443 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) [2024-11-20 15:03:52,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2024-11-20 15:03:52,444 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 21 [2024-11-20 15:03:52,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:03:52,444 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2024-11-20 15:03:52,444 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) [2024-11-20 15:03:52,444 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2024-11-20 15:03:52,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-20 15:03:52,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:03:52,445 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:03:52,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 15:03:52,651 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 [2024-11-20 15:03:52,652 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fooErr4ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-20 15:03:52,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:03:52,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2124560806, now seen corresponding path program 2 times [2024-11-20 15:03:52,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:03:52,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462827650] [2024-11-20 15:03:52,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:03:52,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:03:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:53,256 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:03:53,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:03:53,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462827650] [2024-11-20 15:03:53,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462827650] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:03:53,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088270254] [2024-11-20 15:03:53,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 15:03:53,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:03:53,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:03:53,259 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 15:03:53,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 15:03:53,314 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 15:03:53,314 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 15:03:53,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-11-20 15:03:53,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:03:53,337 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 [2024-11-20 15:03:53,501 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 [2024-11-20 15:03:53,670 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 [2024-11-20 15:03:53,830 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 [2024-11-20 15:03:53,936 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:03:53,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:03:54,593 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:03:54,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088270254] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:03:54,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:03:54,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 27] total 74 [2024-11-20 15:03:54,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249319801] [2024-11-20 15:03:54,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:03:54,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-11-20 15:03:54,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:03:54,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-11-20 15:03:54,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=497, Invalid=4905, Unknown=0, NotChecked=0, Total=5402 [2024-11-20 15:03:54,601 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 74 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 53 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) [2024-11-20 15:03:55,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:03:55,561 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2024-11-20 15:03:55,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-11-20 15:03:55,561 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 53 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 [2024-11-20 15:03:55,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:03:55,563 INFO L225 Difference]: With dead ends: 98 [2024-11-20 15:03:55,563 INFO L226 Difference]: Without dead ends: 98 [2024-11-20 15:03:55,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4255 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1193, Invalid=10797, Unknown=0, NotChecked=0, Total=11990 [2024-11-20 15:03:55,567 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 126 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 15:03:55,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 441 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 15:03:55,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-20 15:03:55,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-20 15:03:55,572 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) [2024-11-20 15:03:55,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2024-11-20 15:03:55,572 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 41 [2024-11-20 15:03:55,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:03:55,572 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2024-11-20 15:03:55,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 53 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) [2024-11-20 15:03:55,573 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2024-11-20 15:03:55,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-20 15:03:55,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:03:55,574 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:03:55,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 15:03:55,778 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 [2024-11-20 15:03:55,780 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fooErr4ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-20 15:03:55,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:03:55,781 INFO L85 PathProgramCache]: Analyzing trace with hash -33992950, now seen corresponding path program 3 times [2024-11-20 15:03:55,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:03:55,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330861895] [2024-11-20 15:03:55,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:03:55,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:03:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:03:57,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:03:57,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330861895] [2024-11-20 15:03:57,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330861895] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:03:57,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184113281] [2024-11-20 15:03:57,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 15:03:57,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:03:57,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:03:57,502 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) [2024-11-20 15:03:57,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 15:03:57,556 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-20 15:03:57,556 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 15:03:57,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-20 15:03:57,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:03:57,721 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 [2024-11-20 15:03:57,884 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 68 proven. 1 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-20 15:03:57,884 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:03:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 68 proven. 1 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-20 15:03:58,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184113281] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:03:58,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:03:58,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 14, 14] total 65 [2024-11-20 15:03:58,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304288027] [2024-11-20 15:03:58,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:03:58,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-20 15:03:58,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:03:58,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-20 15:03:58,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=3802, Unknown=0, NotChecked=0, Total=4160 [2024-11-20 15:03:58,165 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 65 states, 63 states have (on average 1.492063492063492) internal successors, (94), 48 states have internal predecessors, (94), 18 states have call successors, (20), 18 states have call predecessors, (20), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:03:59,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:03:59,410 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2024-11-20 15:03:59,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-11-20 15:03:59,411 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 63 states have (on average 1.492063492063492) internal successors, (94), 48 states have internal predecessors, (94), 18 states have call successors, (20), 18 states have call predecessors, (20), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-20 15:03:59,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:03:59,412 INFO L225 Difference]: With dead ends: 103 [2024-11-20 15:03:59,415 INFO L226 Difference]: Without dead ends: 103 [2024-11-20 15:03:59,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 146 SyntacticMatches, 6 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2794 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1374, Invalid=10836, Unknown=0, NotChecked=0, Total=12210 [2024-11-20 15:03:59,418 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 171 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 15:03:59,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 376 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 15:03:59,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-20 15:03:59,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-20 15:03:59,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 79 states have (on average 1.0126582278481013) internal successors, (80), 79 states have internal predecessors, (80), 17 states have call successors, (17), 17 states have call predecessors, (17), 5 states have return successors, (19), 5 states have call predecessors, (19), 17 states have call successors, (19) [2024-11-20 15:03:59,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2024-11-20 15:03:59,430 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 81 [2024-11-20 15:03:59,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:03:59,430 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2024-11-20 15:03:59,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 63 states have (on average 1.492063492063492) internal successors, (94), 48 states have internal predecessors, (94), 18 states have call successors, (20), 18 states have call predecessors, (20), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:03:59,430 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2024-11-20 15:03:59,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-20 15:03:59,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:03:59,436 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:03:59,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 15:03:59,636 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 [2024-11-20 15:03:59,636 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-20 15:03:59,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:03:59,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1059927799, now seen corresponding path program 1 times [2024-11-20 15:03:59,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:03:59,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619636615] [2024-11-20 15:03:59,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:03:59,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:03:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:00,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 15:04:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:01,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 15:04:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:02,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 15:04:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:02,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 15:04:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:03,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 15:04:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:03,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 15:04:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:03,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 15:04:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:04,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 15:04:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:04,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 15:04:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:04,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 15:04:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:04,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 15:04:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:05,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 15:04:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:05,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 15:04:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:05,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 15:04:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:05,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 15:04:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:05,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 15:04:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:05,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 15:04:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:05,552 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 29 proven. 128 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-11-20 15:04:05,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:04:05,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619636615] [2024-11-20 15:04:05,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619636615] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:04:05,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142435208] [2024-11-20 15:04:05,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:04:05,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:04:05,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:04:05,555 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) [2024-11-20 15:04:05,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 [2024-11-20 15:04:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:05,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 216 conjuncts are in the unsatisfiable core [2024-11-20 15:04:05,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:04:05,663 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 [2024-11-20 15:04:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-20 15:04:06,669 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:04:27,597 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:04:27,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142435208] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:04:27,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:04:27,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27, 79] total 113 [2024-11-20 15:04:27,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981742929] [2024-11-20 15:04:27,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:04:27,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 113 states [2024-11-20 15:04:27,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:04:27,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2024-11-20 15:04:27,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1495, Invalid=11161, Unknown=0, NotChecked=0, Total=12656 [2024-11-20 15:04:27,606 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 113 states, 111 states have (on average 1.1981981981981982) internal successors, (133), 95 states have internal predecessors, (133), 22 states have call successors, (22), 18 states have call predecessors, (22), 36 states have return successors, (51), 35 states have call predecessors, (51), 22 states have call successors, (51) [2024-11-20 15:04:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:04:28,183 INFO L93 Difference]: Finished difference Result 140 states and 229 transitions. [2024-11-20 15:04:28,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-20 15:04:28,184 INFO L78 Accepts]: Start accepts. Automaton has has 113 states, 111 states have (on average 1.1981981981981982) internal successors, (133), 95 states have internal predecessors, (133), 22 states have call successors, (22), 18 states have call predecessors, (22), 36 states have return successors, (51), 35 states have call predecessors, (51), 22 states have call successors, (51) Word has length 125 [2024-11-20 15:04:28,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:04:28,186 INFO L225 Difference]: With dead ends: 140 [2024-11-20 15:04:28,186 INFO L226 Difference]: Without dead ends: 136 [2024-11-20 15:04:28,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 202 SyntacticMatches, 15 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8310 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1907, Invalid=13099, Unknown=0, NotChecked=0, Total=15006 [2024-11-20 15:04:28,194 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 15:04:28,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 488 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 15:04:28,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-20 15:04:28,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2024-11-20 15:04:28,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 17 states have call successors, (17), 17 states have call predecessors, (17), 21 states have return successors, (77), 21 states have call predecessors, (77), 17 states have call successors, (77) [2024-11-20 15:04:28,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 190 transitions. [2024-11-20 15:04:28,213 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 190 transitions. Word has length 125 [2024-11-20 15:04:28,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:04:28,213 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 190 transitions. [2024-11-20 15:04:28,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 113 states, 111 states have (on average 1.1981981981981982) internal successors, (133), 95 states have internal predecessors, (133), 22 states have call successors, (22), 18 states have call predecessors, (22), 36 states have return successors, (51), 35 states have call predecessors, (51), 22 states have call successors, (51) [2024-11-20 15:04:28,215 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 190 transitions. [2024-11-20 15:04:28,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 15:04:28,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:04:28,220 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:04:28,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 15:04:28,421 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 [2024-11-20 15:04:28,421 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-20 15:04:28,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:04:28,422 INFO L85 PathProgramCache]: Analyzing trace with hash 746487903, now seen corresponding path program 2 times [2024-11-20 15:04:28,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:04:28,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077419210] [2024-11-20 15:04:28,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:04:28,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:04:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:28,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 15:04:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:28,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 15:04:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:28,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 15:04:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:28,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 15:04:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:28,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 15:04:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:28,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 15:04:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:28,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 15:04:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:28,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 15:04:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:28,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 15:04:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:28,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 15:04:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:28,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 15:04:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:28,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 15:04:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:28,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 15:04:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:28,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 15:04:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:28,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 15:04:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:28,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 15:04:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:28,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 15:04:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:28,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 15:04:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:28,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 15:04:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:28,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 15:04:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:28,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 15:04:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:28,710 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2024-11-20 15:04:28,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:04:28,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077419210] [2024-11-20 15:04:28,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077419210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:04:28,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:04:28,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 15:04:28,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093881962] [2024-11-20 15:04:28,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:04:28,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 15:04:28,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:04:28,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 15:04:28,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 15:04:28,712 INFO L87 Difference]: Start difference. First operand 134 states and 190 transitions. Second operand has 5 states, 4 states have (on average 4.5) 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) [2024-11-20 15:04:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:04:28,731 INFO L93 Difference]: Finished difference Result 133 states and 189 transitions. [2024-11-20 15:04:28,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 15:04:28,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) 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 153 [2024-11-20 15:04:28,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:04:28,732 INFO L225 Difference]: With dead ends: 133 [2024-11-20 15:04:28,732 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 15:04:28,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 15:04:28,733 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 15:04:28,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 48 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:04:28,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 15:04:28,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 15:04:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:04:28,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 15:04:28,733 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 153 [2024-11-20 15:04:28,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:04:28,734 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 15:04:28,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) 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) [2024-11-20 15:04:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 15:04:28,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 15:04:28,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 12 remaining) [2024-11-20 15:04:28,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2024-11-20 15:04:28,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2024-11-20 15:04:28,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fooErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2024-11-20 15:04:28,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fooErr4ASSERT_VIOLATIONMEMORY_LEAK (7 of 12 remaining) [2024-11-20 15:04:28,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2024-11-20 15:04:28,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2024-11-20 15:04:28,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (4 of 12 remaining) [2024-11-20 15:04:28,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location plusErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 12 remaining) [2024-11-20 15:04:28,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location plusErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 12 remaining) [2024-11-20 15:04:28,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location plusErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 12 remaining) [2024-11-20 15:04:28,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location plusErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 12 remaining) [2024-11-20 15:04:28,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 15:04:28,740 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:04:28,741 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 15:04:28,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:04:28 BoogieIcfgContainer [2024-11-20 15:04:28,743 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 15:04:28,744 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 15:04:28,744 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 15:04:28,744 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 15:04:28,744 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:03:49" (3/4) ... [2024-11-20 15:04:28,746 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 15:04:28,749 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2024-11-20 15:04:28,749 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure plus [2024-11-20 15:04:28,751 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-20 15:04:28,752 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-20 15:04:28,752 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 15:04:28,752 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 15:04:28,752 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 15:04:28,832 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 15:04:28,833 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 15:04:28,833 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 15:04:28,833 INFO L158 Benchmark]: Toolchain (without parser) took 39646.28ms. Allocated memory was 201.3MB in the beginning and 887.1MB in the end (delta: 685.8MB). Free memory was 170.5MB in the beginning and 839.9MB in the end (delta: -669.4MB). Peak memory consumption was 536.9MB. Max. memory is 16.1GB. [2024-11-20 15:04:28,833 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory was 92.2MB in the beginning and 92.1MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 15:04:28,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.65ms. Allocated memory is still 201.3MB. Free memory was 169.7MB in the beginning and 158.1MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 15:04:28,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.69ms. Allocated memory is still 201.3MB. Free memory was 158.1MB in the beginning and 156.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 15:04:28,834 INFO L158 Benchmark]: Boogie Preprocessor took 31.73ms. Allocated memory is still 201.3MB. Free memory was 156.9MB in the beginning and 155.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 15:04:28,834 INFO L158 Benchmark]: RCFGBuilder took 285.83ms. Allocated memory is still 201.3MB. Free memory was 154.8MB in the beginning and 142.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 15:04:28,834 INFO L158 Benchmark]: TraceAbstraction took 39022.70ms. Allocated memory was 201.3MB in the beginning and 887.1MB in the end (delta: 685.8MB). Free memory was 141.4MB in the beginning and 324.6MB in the end (delta: -183.2MB). Peak memory consumption was 501.2MB. Max. memory is 16.1GB. [2024-11-20 15:04:28,834 INFO L158 Benchmark]: Witness Printer took 89.25ms. Allocated memory is still 887.1MB. Free memory was 324.6MB in the beginning and 839.9MB in the end (delta: -515.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 15:04:28,835 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.13ms. Allocated memory is still 130.0MB. Free memory was 92.2MB in the beginning and 92.1MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.65ms. Allocated memory is still 201.3MB. Free memory was 169.7MB in the beginning and 158.1MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.69ms. Allocated memory is still 201.3MB. Free memory was 158.1MB in the beginning and 156.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.73ms. Allocated memory is still 201.3MB. Free memory was 156.9MB in the beginning and 155.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 285.83ms. Allocated memory is still 201.3MB. Free memory was 154.8MB in the beginning and 142.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 39022.70ms. Allocated memory was 201.3MB in the beginning and 887.1MB in the end (delta: 685.8MB). Free memory was 141.4MB in the beginning and 324.6MB in the end (delta: -183.2MB). Peak memory consumption was 501.2MB. Max. memory is 16.1GB. * Witness Printer took 89.25ms. Allocated memory is still 887.1MB. Free memory was 324.6MB in the beginning and 839.9MB in the end (delta: -515.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 39 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 39.0s, OverallIterations: 13, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 462 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 454 mSDsluCounter, 2154 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1834 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2478 IncrementalHoareTripleChecker+Invalid, 2546 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 320 mSDtfsCounter, 2478 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 899 GetRequests, 462 SyntacticMatches, 21 SemanticMatches, 416 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15682 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=12, InterpolantAutomatonStates: 225, 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, 13 MinimizatonAttempts, 29 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 33.6s InterpolantComputationTime, 754 NumberOfCodeBlocks, 694 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1001 ConstructedInterpolants, 0 QuantifiedInterpolants, 7681 SizeOfPredicates, 72 NumberOfNonLiveVariables, 937 ConjunctsInSsa, 390 ConjunctsInUnsatCore, 21 InterpolantComputations, 9 PerfectInterpolantSequences, 1750/2797 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-20 15:04:28,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE