./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 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/verifythis/elimination_max_rec.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 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:50:53,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:50:53,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 17:50:53,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:50:53,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:50:53,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:50:53,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:50:53,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:50:53,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:50:53,974 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:50:53,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:50:53,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:50:53,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:50:53,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:50:53,976 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:50:53,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:50:53,976 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:50:53,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:50:53,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:50:53,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:50:53,981 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:50:53,981 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:50:53,982 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:50:53,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:50:53,982 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:50:53,982 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:50:53,982 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:50:53,983 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:50:53,983 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:50:53,983 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:50:53,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:50:53,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:50:53,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:50:53,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:50:53,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:50:53,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:50:53,985 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:50:53,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:50:53,986 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:50:53,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:50:53,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:50:53,987 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:50:53,987 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 -> 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a [2024-10-14 17:50:54,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:50:54,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:50:54,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:50:54,244 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:50:54,244 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:50:54,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-10-14 17:50:55,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:50:55,845 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:50:55,845 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-10-14 17:50:55,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47a65c8be/b3e565dd7181400c8675dab81ddda9ba/FLAG235055275 [2024-10-14 17:50:56,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47a65c8be/b3e565dd7181400c8675dab81ddda9ba [2024-10-14 17:50:56,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:50:56,220 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:50:56,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:50:56,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:50:56,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:50:56,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:50:56" (1/1) ... [2024-10-14 17:50:56,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5009b502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:56, skipping insertion in model container [2024-10-14 17:50:56,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:50:56" (1/1) ... [2024-10-14 17:50:56,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:50:56,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:50:56,387 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:50:56,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:50:56,413 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:50:56,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:56 WrapperNode [2024-10-14 17:50:56,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:50:56,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:50:56,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:50:56,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:50:56,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:56" (1/1) ... [2024-10-14 17:50:56,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:56" (1/1) ... [2024-10-14 17:50:56,439 INFO L138 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 34 [2024-10-14 17:50:56,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:50:56,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:50:56,440 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:50:56,440 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:50:56,448 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:56" (1/1) ... [2024-10-14 17:50:56,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:56" (1/1) ... [2024-10-14 17:50:56,450 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:56" (1/1) ... [2024-10-14 17:50:56,459 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-10-14 17:50:56,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:56" (1/1) ... [2024-10-14 17:50:56,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:56" (1/1) ... [2024-10-14 17:50:56,464 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:56" (1/1) ... [2024-10-14 17:50:56,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:56" (1/1) ... [2024-10-14 17:50:56,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:56" (1/1) ... [2024-10-14 17:50:56,467 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:56" (1/1) ... [2024-10-14 17:50:56,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:50:56,469 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:50:56,469 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:50:56,469 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:50:56,470 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:56" (1/1) ... [2024-10-14 17:50:56,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:50:56,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:50:56,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:50:56,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:50:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:50:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 17:50:56,579 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 17:50:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 17:50:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 17:50:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-10-14 17:50:56,580 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-10-14 17:50:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:50:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:50:56,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:50:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 17:50:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 17:50:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 17:50:56,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 17:50:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:50:56,650 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:50:56,654 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:50:56,823 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-10-14 17:50:56,824 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:50:56,865 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:50:56,866 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 17:50:56,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:50:56 BoogieIcfgContainer [2024-10-14 17:50:56,867 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:50:56,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:50:56,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:50:56,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:50:56,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:50:56" (1/3) ... [2024-10-14 17:50:56,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27902ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:50:56, skipping insertion in model container [2024-10-14 17:50:56,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:56" (2/3) ... [2024-10-14 17:50:56,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27902ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:50:56, skipping insertion in model container [2024-10-14 17:50:56,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:50:56" (3/3) ... [2024-10-14 17:50:56,875 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2024-10-14 17:50:56,887 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:50:56,887 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-10-14 17:50:56,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:50:56,933 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;@1f2dae10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:50:56,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-10-14 17:50:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 25 states have (on average 1.68) internal successors, (42), 38 states have internal predecessors, (42), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 17:50:56,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 17:50:56,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:50:56,948 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:50:56,949 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 17:50:56,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:50:56,953 INFO L85 PathProgramCache]: Analyzing trace with hash -125346991, now seen corresponding path program 1 times [2024-10-14 17:50:56,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:50:56,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006631439] [2024-10-14 17:50:56,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:50:56,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:50:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:57,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:50:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:57,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:50:57,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:50:57,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006631439] [2024-10-14 17:50:57,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006631439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:50:57,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:50:57,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:50:57,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008626010] [2024-10-14 17:50:57,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:50:57,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 17:50:57,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:50:57,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 17:50:57,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 17:50:57,171 INFO L87 Difference]: Start difference. First operand has 48 states, 25 states have (on average 1.68) internal successors, (42), 38 states have internal predecessors, (42), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:50:57,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:50:57,204 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2024-10-14 17:50:57,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 17:50:57,206 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-14 17:50:57,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:50:57,212 INFO L225 Difference]: With dead ends: 48 [2024-10-14 17:50:57,213 INFO L226 Difference]: Without dead ends: 47 [2024-10-14 17:50:57,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 17:50:57,217 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:50:57,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:50:57,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-14 17:50:57,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-14 17:50:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.56) internal successors, (39), 37 states have internal predecessors, (39), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 17:50:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2024-10-14 17:50:57,250 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 14 [2024-10-14 17:50:57,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:50:57,251 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2024-10-14 17:50:57,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:50:57,251 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2024-10-14 17:50:57,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 17:50:57,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:50:57,253 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:50:57,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:50:57,253 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 17:50:57,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:50:57,256 INFO L85 PathProgramCache]: Analyzing trace with hash 575717587, now seen corresponding path program 1 times [2024-10-14 17:50:57,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:50:57,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165044266] [2024-10-14 17:50:57,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:50:57,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:50:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:57,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:50:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:57,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:50:57,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:50:57,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165044266] [2024-10-14 17:50:57,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165044266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:50:57,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:50:57,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:50:57,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205262664] [2024-10-14 17:50:57,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:50:57,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:50:57,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:50:57,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:50:57,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:50:57,553 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:50:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:50:57,674 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2024-10-14 17:50:57,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:50:57,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-14 17:50:57,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:50:57,677 INFO L225 Difference]: With dead ends: 88 [2024-10-14 17:50:57,677 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 17:50:57,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-10-14 17:50:57,678 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 38 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:50:57,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 206 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:50:57,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 17:50:57,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 68. [2024-10-14 17:50:57,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 52 states have internal predecessors, (63), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 17:50:57,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2024-10-14 17:50:57,687 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 14 [2024-10-14 17:50:57,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:50:57,688 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2024-10-14 17:50:57,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:50:57,688 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2024-10-14 17:50:57,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 17:50:57,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:50:57,689 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:50:57,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:50:57,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 17:50:57,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:50:57,689 INFO L85 PathProgramCache]: Analyzing trace with hash 574300274, now seen corresponding path program 1 times [2024-10-14 17:50:57,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:50:57,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533382614] [2024-10-14 17:50:57,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:50:57,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:50:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:57,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:50:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:57,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:50:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:57,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:50:57,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:50:57,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533382614] [2024-10-14 17:50:57,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533382614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:50:57,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:50:57,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:50:57,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999892458] [2024-10-14 17:50:57,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:50:57,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:50:57,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:50:57,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:50:57,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:50:57,722 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:50:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:50:57,734 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2024-10-14 17:50:57,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:50:57,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-10-14 17:50:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:50:57,736 INFO L225 Difference]: With dead ends: 67 [2024-10-14 17:50:57,736 INFO L226 Difference]: Without dead ends: 67 [2024-10-14 17:50:57,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:50:57,737 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:50:57,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:50:57,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-14 17:50:57,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-14 17:50:57,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 51 states have internal predecessors, (62), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 17:50:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2024-10-14 17:50:57,748 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 14 [2024-10-14 17:50:57,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:50:57,748 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2024-10-14 17:50:57,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:50:57,748 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2024-10-14 17:50:57,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 17:50:57,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:50:57,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:50:57,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:50:57,749 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 17:50:57,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:50:57,750 INFO L85 PathProgramCache]: Analyzing trace with hash 623439352, now seen corresponding path program 1 times [2024-10-14 17:50:57,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:50:57,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739926362] [2024-10-14 17:50:57,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:50:57,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:50:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:57,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:50:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:57,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:50:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:57,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:50:57,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:50:57,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739926362] [2024-10-14 17:50:57,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739926362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:50:57,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:50:57,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:50:57,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644660334] [2024-10-14 17:50:57,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:50:57,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:50:57,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:50:57,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:50:57,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:50:57,810 INFO L87 Difference]: Start difference. First operand 67 states and 84 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:50:57,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:50:57,825 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2024-10-14 17:50:57,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:50:57,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-10-14 17:50:57,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:50:57,828 INFO L225 Difference]: With dead ends: 66 [2024-10-14 17:50:57,828 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 17:50:57,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:50:57,831 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:50:57,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:50:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 17:50:57,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-14 17:50:57,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 39 states have (on average 1.564102564102564) internal successors, (61), 50 states have internal predecessors, (61), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 17:50:57,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2024-10-14 17:50:57,843 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 15 [2024-10-14 17:50:57,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:50:57,844 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2024-10-14 17:50:57,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:50:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2024-10-14 17:50:57,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:50:57,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:50:57,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:50:57,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:50:57,845 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 17:50:57,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:50:57,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2146750772, now seen corresponding path program 1 times [2024-10-14 17:50:57,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:50:57,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096438242] [2024-10-14 17:50:57,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:50:57,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:50:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:57,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:50:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:57,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:50:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:57,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:50:57,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:50:57,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096438242] [2024-10-14 17:50:57,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096438242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:50:57,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:50:57,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:50:57,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720587714] [2024-10-14 17:50:57,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:50:57,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:50:57,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:50:57,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:50:57,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:50:57,907 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:50:57,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:50:57,937 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2024-10-14 17:50:57,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:50:57,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-10-14 17:50:57,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:50:57,938 INFO L225 Difference]: With dead ends: 65 [2024-10-14 17:50:57,939 INFO L226 Difference]: Without dead ends: 65 [2024-10-14 17:50:57,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:50:57,940 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:50:57,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:50:57,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-14 17:50:57,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-14 17:50:57,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 49 states have internal predecessors, (60), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 17:50:57,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2024-10-14 17:50:57,950 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 16 [2024-10-14 17:50:57,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:50:57,951 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2024-10-14 17:50:57,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:50:57,952 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2024-10-14 17:50:57,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 17:50:57,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:50:57,952 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:50:57,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:50:57,953 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 17:50:57,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:50:57,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1404046107, now seen corresponding path program 1 times [2024-10-14 17:50:57,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:50:57,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451463838] [2024-10-14 17:50:57,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:50:57,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:50:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:58,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:50:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:58,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 17:50:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:58,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:50:58,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:50:58,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451463838] [2024-10-14 17:50:58,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451463838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:50:58,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:50:58,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:50:58,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318362725] [2024-10-14 17:50:58,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:50:58,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:50:58,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:50:58,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:50:58,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:50:58,057 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 5 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:50:58,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:50:58,142 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2024-10-14 17:50:58,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:50:58,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-10-14 17:50:58,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:50:58,143 INFO L225 Difference]: With dead ends: 65 [2024-10-14 17:50:58,143 INFO L226 Difference]: Without dead ends: 65 [2024-10-14 17:50:58,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-10-14 17:50:58,144 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 29 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:50:58,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 73 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:50:58,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-14 17:50:58,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2024-10-14 17:50:58,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 45 states have internal predecessors, (52), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 17:50:58,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2024-10-14 17:50:58,153 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 17 [2024-10-14 17:50:58,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:50:58,154 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2024-10-14 17:50:58,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:50:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2024-10-14 17:50:58,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 17:50:58,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:50:58,154 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:50:58,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:50:58,155 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 17:50:58,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:50:58,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1404046108, now seen corresponding path program 1 times [2024-10-14 17:50:58,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:50:58,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120849260] [2024-10-14 17:50:58,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:50:58,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:50:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:58,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:50:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:58,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 17:50:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:50:58,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:50:58,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120849260] [2024-10-14 17:50:58,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120849260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:50:58,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:50:58,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 17:50:58,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749169747] [2024-10-14 17:50:58,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:50:58,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 17:50:58,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:50:58,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 17:50:58,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:50:58,479 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:50:58,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:50:58,694 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2024-10-14 17:50:58,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 17:50:58,694 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-10-14 17:50:58,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:50:58,695 INFO L225 Difference]: With dead ends: 85 [2024-10-14 17:50:58,695 INFO L226 Difference]: Without dead ends: 85 [2024-10-14 17:50:58,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:50:58,696 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 30 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:50:58,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 167 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:50:58,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-14 17:50:58,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2024-10-14 17:50:58,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.36) internal successors, (68), 57 states have internal predecessors, (68), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 17:50:58,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2024-10-14 17:50:58,702 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 17 [2024-10-14 17:50:58,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:50:58,702 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2024-10-14 17:50:58,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:50:58,703 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2024-10-14 17:50:58,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 17:50:58,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:50:58,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:50:58,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:50:58,703 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 17:50:58,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:50:58,704 INFO L85 PathProgramCache]: Analyzing trace with hash 2124764539, now seen corresponding path program 1 times [2024-10-14 17:50:58,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:50:58,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565851349] [2024-10-14 17:50:58,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:50:58,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:50:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:58,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:50:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:58,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:50:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:50:58,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:50:58,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565851349] [2024-10-14 17:50:58,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565851349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:50:58,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:50:58,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:50:58,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717126184] [2024-10-14 17:50:58,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:50:58,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:50:58,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:50:58,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:50:58,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:50:58,765 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:50:58,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:50:58,787 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2024-10-14 17:50:58,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:50:58,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-10-14 17:50:58,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:50:58,788 INFO L225 Difference]: With dead ends: 77 [2024-10-14 17:50:58,789 INFO L226 Difference]: Without dead ends: 69 [2024-10-14 17:50:58,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:50:58,789 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:50:58,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:50:58,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-14 17:50:58,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-14 17:50:58,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 50 states have internal predecessors, (60), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 17:50:58,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2024-10-14 17:50:58,794 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 17 [2024-10-14 17:50:58,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:50:58,794 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2024-10-14 17:50:58,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:50:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2024-10-14 17:50:58,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 17:50:58,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:50:58,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:50:58,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:50:58,795 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 17:50:58,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:50:58,795 INFO L85 PathProgramCache]: Analyzing trace with hash 575756365, now seen corresponding path program 1 times [2024-10-14 17:50:58,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:50:58,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035034735] [2024-10-14 17:50:58,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:50:58,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:50:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:58,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:50:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:58,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 17:50:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:58,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:50:58,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:50:58,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035034735] [2024-10-14 17:50:58,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035034735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:50:58,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:50:58,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 17:50:58,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745309370] [2024-10-14 17:50:58,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:50:58,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 17:50:58,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:50:58,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 17:50:58,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-14 17:50:58,992 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:50:59,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:50:59,218 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2024-10-14 17:50:59,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:50:59,218 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-10-14 17:50:59,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:50:59,220 INFO L225 Difference]: With dead ends: 79 [2024-10-14 17:50:59,220 INFO L226 Difference]: Without dead ends: 79 [2024-10-14 17:50:59,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-14 17:50:59,221 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 27 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:50:59,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 179 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:50:59,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-14 17:50:59,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2024-10-14 17:50:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 50 states have internal predecessors, (57), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 17:50:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2024-10-14 17:50:59,228 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 18 [2024-10-14 17:50:59,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:50:59,229 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2024-10-14 17:50:59,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:50:59,230 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2024-10-14 17:50:59,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 17:50:59,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:50:59,230 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:50:59,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:50:59,231 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 17:50:59,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:50:59,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1870107036, now seen corresponding path program 1 times [2024-10-14 17:50:59,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:50:59,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864604683] [2024-10-14 17:50:59,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:50:59,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:50:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:59,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:50:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:59,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 17:50:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:50:59,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:50:59,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864604683] [2024-10-14 17:50:59,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864604683] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:50:59,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542217018] [2024-10-14 17:50:59,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:50:59,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:50:59,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:50:59,348 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:50:59,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 17:50:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:50:59,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 17:50:59,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:50:59,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:50:59,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:50:59,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542217018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:50:59,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 17:50:59,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2024-10-14 17:50:59,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848789268] [2024-10-14 17:50:59,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:50:59,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:50:59,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:50:59,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:50:59,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 17:50:59,588 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:50:59,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:50:59,796 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2024-10-14 17:50:59,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 17:50:59,797 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-10-14 17:50:59,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:50:59,797 INFO L225 Difference]: With dead ends: 94 [2024-10-14 17:50:59,797 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 17:50:59,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-10-14 17:50:59,799 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 69 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:50:59,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 134 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:50:59,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 17:50:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2024-10-14 17:50:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 53 states have internal predecessors, (60), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 17:50:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2024-10-14 17:50:59,804 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 26 [2024-10-14 17:50:59,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:50:59,804 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2024-10-14 17:50:59,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:50:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2024-10-14 17:50:59,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 17:50:59,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:50:59,805 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:50:59,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 17:51:00,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 17:51:00,009 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 17:51:00,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:00,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1962878955, now seen corresponding path program 1 times [2024-10-14 17:51:00,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:00,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936351403] [2024-10-14 17:51:00,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:00,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:00,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:51:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:00,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 17:51:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:00,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 17:51:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:51:00,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:00,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936351403] [2024-10-14 17:51:00,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936351403] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:51:00,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620044570] [2024-10-14 17:51:00,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:00,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:51:00,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:51:00,181 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-10-14 17:51:00,183 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-10-14 17:51:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:00,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 17:51:00,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:51:00,421 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:00,421 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:51:00,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620044570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:51:00,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 17:51:00,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2024-10-14 17:51:00,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633001922] [2024-10-14 17:51:00,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:51:00,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 17:51:00,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:00,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 17:51:00,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-10-14 17:51:00,422 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 17:51:00,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:00,793 INFO L93 Difference]: Finished difference Result 124 states and 161 transitions. [2024-10-14 17:51:00,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 17:51:00,793 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2024-10-14 17:51:00,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:00,794 INFO L225 Difference]: With dead ends: 124 [2024-10-14 17:51:00,794 INFO L226 Difference]: Without dead ends: 124 [2024-10-14 17:51:00,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2024-10-14 17:51:00,795 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 91 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:00,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 169 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:51:00,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-14 17:51:00,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 97. [2024-10-14 17:51:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 69 states have internal predecessors, (82), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (21), 17 states have call predecessors, (21), 17 states have call successors, (21) [2024-10-14 17:51:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 123 transitions. [2024-10-14 17:51:00,800 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 123 transitions. Word has length 29 [2024-10-14 17:51:00,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:00,800 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 123 transitions. [2024-10-14 17:51:00,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 17:51:00,800 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 123 transitions. [2024-10-14 17:51:00,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 17:51:00,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:00,801 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:51:00,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 17:51:01,001 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,SelfDestructingSolverStorable10 [2024-10-14 17:51:01,002 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 17:51:01,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:01,002 INFO L85 PathProgramCache]: Analyzing trace with hash 719705438, now seen corresponding path program 1 times [2024-10-14 17:51:01,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:01,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393647206] [2024-10-14 17:51:01,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:01,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:01,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:51:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:01,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 17:51:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:01,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 17:51:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:51:01,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:01,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393647206] [2024-10-14 17:51:01,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393647206] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:51:01,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818036679] [2024-10-14 17:51:01,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:01,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:51:01,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:51:01,211 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-10-14 17:51:01,212 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-10-14 17:51:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:01,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 17:51:01,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:51:01,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:01,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:51:01,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-14 17:51:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:51:01,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818036679] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:51:01,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:51:01,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2024-10-14 17:51:01,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288905653] [2024-10-14 17:51:01,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:51:01,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 17:51:01,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:01,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 17:51:01,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2024-10-14 17:51:01,708 INFO L87 Difference]: Start difference. First operand 97 states and 123 transitions. Second operand has 25 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 13 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 17:51:02,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:02,593 INFO L93 Difference]: Finished difference Result 127 states and 160 transitions. [2024-10-14 17:51:02,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-14 17:51:02,593 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 13 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 30 [2024-10-14 17:51:02,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:02,595 INFO L225 Difference]: With dead ends: 127 [2024-10-14 17:51:02,595 INFO L226 Difference]: Without dead ends: 127 [2024-10-14 17:51:02,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=404, Invalid=1576, Unknown=0, NotChecked=0, Total=1980 [2024-10-14 17:51:02,596 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 187 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:02,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 404 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 17:51:02,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-14 17:51:02,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2024-10-14 17:51:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 68 states have internal predecessors, (81), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (21), 17 states have call predecessors, (21), 17 states have call successors, (21) [2024-10-14 17:51:02,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 122 transitions. [2024-10-14 17:51:02,601 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 122 transitions. Word has length 30 [2024-10-14 17:51:02,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:02,601 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 122 transitions. [2024-10-14 17:51:02,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 13 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 17:51:02,602 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 122 transitions. [2024-10-14 17:51:02,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 17:51:02,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:02,602 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:51:02,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 17:51:02,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:51:02,807 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 17:51:02,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:02,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1693229712, now seen corresponding path program 1 times [2024-10-14 17:51:02,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:02,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797335386] [2024-10-14 17:51:02,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:02,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:02,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:51:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:02,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 17:51:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:02,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 17:51:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:02,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 17:51:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:02,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:51:02,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:02,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797335386] [2024-10-14 17:51:02,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797335386] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:51:02,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063339998] [2024-10-14 17:51:02,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:02,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:51:02,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:51:02,973 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-10-14 17:51:02,974 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-10-14 17:51:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:03,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 17:51:03,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:51:03,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:51:03,131 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:51:03,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-10-14 17:51:03,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:51:03,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063339998] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:51:03,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:51:03,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-10-14 17:51:03,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809933133] [2024-10-14 17:51:03,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:51:03,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-14 17:51:03,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:03,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-14 17:51:03,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2024-10-14 17:51:03,347 INFO L87 Difference]: Start difference. First operand 96 states and 122 transitions. Second operand has 22 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 16 states have internal predecessors, (41), 9 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2024-10-14 17:51:03,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:03,744 INFO L93 Difference]: Finished difference Result 117 states and 149 transitions. [2024-10-14 17:51:03,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 17:51:03,745 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 16 states have internal predecessors, (41), 9 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) Word has length 31 [2024-10-14 17:51:03,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:03,745 INFO L225 Difference]: With dead ends: 117 [2024-10-14 17:51:03,745 INFO L226 Difference]: Without dead ends: 117 [2024-10-14 17:51:03,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=947, Unknown=0, NotChecked=0, Total=1190 [2024-10-14 17:51:03,746 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 85 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:03,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 284 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:51:03,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-14 17:51:03,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 95. [2024-10-14 17:51:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 67 states have internal predecessors, (76), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (21), 17 states have call predecessors, (21), 17 states have call successors, (21) [2024-10-14 17:51:03,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2024-10-14 17:51:03,754 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 31 [2024-10-14 17:51:03,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:03,755 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2024-10-14 17:51:03,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 16 states have internal predecessors, (41), 9 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2024-10-14 17:51:03,755 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2024-10-14 17:51:03,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 17:51:03,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:03,757 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:51:03,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 17:51:03,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:51:03,958 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 17:51:03,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:03,959 INFO L85 PathProgramCache]: Analyzing trace with hash -950512349, now seen corresponding path program 1 times [2024-10-14 17:51:03,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:03,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720757273] [2024-10-14 17:51:03,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:03,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:04,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:51:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:04,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 17:51:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:04,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 17:51:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:04,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 17:51:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:04,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:51:04,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:04,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720757273] [2024-10-14 17:51:04,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720757273] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:51:04,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155256791] [2024-10-14 17:51:04,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:04,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:51:04,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:51:04,165 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:51:04,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 17:51:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:04,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 17:51:04,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:51:04,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:04,459 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:51:04,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-10-14 17:51:04,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:51:04,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155256791] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:51:04,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:51:04,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 32 [2024-10-14 17:51:04,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992313226] [2024-10-14 17:51:04,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:51:04,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-14 17:51:04,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:04,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-14 17:51:04,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2024-10-14 17:51:04,745 INFO L87 Difference]: Start difference. First operand 95 states and 117 transitions. Second operand has 33 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 27 states have internal predecessors, (49), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 17:51:08,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 17:51:09,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:09,858 INFO L93 Difference]: Finished difference Result 157 states and 198 transitions. [2024-10-14 17:51:09,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-14 17:51:09,859 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 27 states have internal predecessors, (49), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 32 [2024-10-14 17:51:09,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:09,859 INFO L225 Difference]: With dead ends: 157 [2024-10-14 17:51:09,859 INFO L226 Difference]: Without dead ends: 157 [2024-10-14 17:51:09,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=580, Invalid=3202, Unknown=0, NotChecked=0, Total=3782 [2024-10-14 17:51:09,861 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 181 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 107 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:09,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 456 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 787 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-10-14 17:51:09,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-14 17:51:09,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 115. [2024-10-14 17:51:09,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 80 states have internal predecessors, (90), 23 states have call successors, (23), 11 states have call predecessors, (23), 13 states have return successors, (27), 23 states have call predecessors, (27), 20 states have call successors, (27) [2024-10-14 17:51:09,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2024-10-14 17:51:09,868 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 32 [2024-10-14 17:51:09,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:09,869 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2024-10-14 17:51:09,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 27 states have internal predecessors, (49), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 17:51:09,870 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2024-10-14 17:51:09,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 17:51:09,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:09,873 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:51:09,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 17:51:10,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-14 17:51:10,074 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 17:51:10,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:10,075 INFO L85 PathProgramCache]: Analyzing trace with hash 218776271, now seen corresponding path program 1 times [2024-10-14 17:51:10,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:10,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435954916] [2024-10-14 17:51:10,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:10,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:10,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:51:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:10,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 17:51:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:10,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 17:51:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:10,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 17:51:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:51:10,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:10,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435954916] [2024-10-14 17:51:10,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435954916] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:51:10,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214555068] [2024-10-14 17:51:10,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:10,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:51:10,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:51:10,218 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:51:10,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 17:51:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:10,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 17:51:10,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:51:10,277 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 7 treesize of output 6 [2024-10-14 17:51:10,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-10-14 17:51:10,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:51:10,494 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:51:14,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214555068] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:51:14,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:51:14,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 19 [2024-10-14 17:51:14,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185294827] [2024-10-14 17:51:14,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:51:14,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 17:51:14,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:14,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 17:51:14,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2024-10-14 17:51:14,559 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand has 19 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 7 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-14 17:51:14,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:14,791 INFO L93 Difference]: Finished difference Result 117 states and 140 transitions. [2024-10-14 17:51:14,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 17:51:14,792 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 7 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 36 [2024-10-14 17:51:14,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:14,793 INFO L225 Difference]: With dead ends: 117 [2024-10-14 17:51:14,793 INFO L226 Difference]: Without dead ends: 111 [2024-10-14 17:51:14,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2024-10-14 17:51:14,793 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 31 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:14,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 183 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:51:14,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-14 17:51:14,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 59. [2024-10-14 17:51:14,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2024-10-14 17:51:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2024-10-14 17:51:14,797 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 36 [2024-10-14 17:51:14,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:14,797 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-10-14 17:51:14,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 7 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-14 17:51:14,797 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2024-10-14 17:51:14,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 17:51:14,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:14,798 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:51:14,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-14 17:51:14,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 17:51:14,999 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 17:51:14,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:14,999 INFO L85 PathProgramCache]: Analyzing trace with hash 567016313, now seen corresponding path program 1 times [2024-10-14 17:51:14,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:14,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437377429] [2024-10-14 17:51:14,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:15,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:15,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:51:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:15,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 17:51:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:15,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 17:51:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:15,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 17:51:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:15,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 17:51:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:15,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 17:51:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:15,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 17:51:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:15,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 17:51:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:15,362 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-14 17:51:15,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:15,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437377429] [2024-10-14 17:51:15,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437377429] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:51:15,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843949148] [2024-10-14 17:51:15,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:15,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:51:15,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:51:15,367 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:51:15,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 17:51:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:15,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-14 17:51:15,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:51:15,767 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 17:51:15,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:51:16,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843949148] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:51:16,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:51:16,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 28 [2024-10-14 17:51:16,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347117047] [2024-10-14 17:51:16,065 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:51:16,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-14 17:51:16,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:16,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-14 17:51:16,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122 [2024-10-14 17:51:16,069 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 29 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 24 states have internal predecessors, (52), 14 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2024-10-14 17:51:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:18,260 INFO L93 Difference]: Finished difference Result 213 states and 284 transitions. [2024-10-14 17:51:18,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-10-14 17:51:18,261 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 24 states have internal predecessors, (52), 14 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 60 [2024-10-14 17:51:18,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:18,262 INFO L225 Difference]: With dead ends: 213 [2024-10-14 17:51:18,262 INFO L226 Difference]: Without dead ends: 209 [2024-10-14 17:51:18,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1760 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=875, Invalid=6781, Unknown=0, NotChecked=0, Total=7656 [2024-10-14 17:51:18,264 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 244 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:18,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 775 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 17:51:18,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-14 17:51:18,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 138. [2024-10-14 17:51:18,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 92 states have (on average 1.1195652173913044) internal successors, (103), 92 states have internal predecessors, (103), 30 states have call successors, (30), 10 states have call predecessors, (30), 15 states have return successors, (45), 35 states have call predecessors, (45), 29 states have call successors, (45) [2024-10-14 17:51:18,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 178 transitions. [2024-10-14 17:51:18,270 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 178 transitions. Word has length 60 [2024-10-14 17:51:18,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:18,271 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 178 transitions. [2024-10-14 17:51:18,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 24 states have internal predecessors, (52), 14 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2024-10-14 17:51:18,271 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 178 transitions. [2024-10-14 17:51:18,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 17:51:18,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:51:18,272 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:51:18,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 17:51:18,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:51:18,477 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 17:51:18,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:51:18,477 INFO L85 PathProgramCache]: Analyzing trace with hash -560176873, now seen corresponding path program 1 times [2024-10-14 17:51:18,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:51:18,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406572204] [2024-10-14 17:51:18,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:18,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:51:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:18,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:51:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:18,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 17:51:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:18,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 17:51:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:18,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 17:51:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:18,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 17:51:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:18,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 17:51:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:18,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 17:51:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:18,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 17:51:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:18,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 17:51:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:18,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 17:51:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:18,625 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 20 proven. 36 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-14 17:51:18,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:51:18,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406572204] [2024-10-14 17:51:18,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406572204] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:51:18,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699004149] [2024-10-14 17:51:18,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:51:18,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:51:18,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:51:18,627 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:51:18,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 17:51:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:51:18,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-14 17:51:18,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:51:19,098 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 25 proven. 37 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-14 17:51:19,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:51:19,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699004149] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:51:19,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:51:19,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19] total 26 [2024-10-14 17:51:19,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096795296] [2024-10-14 17:51:19,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:51:19,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 17:51:19,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:51:19,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 17:51:19,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2024-10-14 17:51:19,426 INFO L87 Difference]: Start difference. First operand 138 states and 178 transitions. Second operand has 26 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 21 states have internal predecessors, (76), 13 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-14 17:51:20,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:51:20,259 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2024-10-14 17:51:20,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 17:51:20,260 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 21 states have internal predecessors, (76), 13 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 84 [2024-10-14 17:51:20,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:51:20,260 INFO L225 Difference]: With dead ends: 66 [2024-10-14 17:51:20,260 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 17:51:20,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=387, Invalid=2369, Unknown=0, NotChecked=0, Total=2756 [2024-10-14 17:51:20,262 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 85 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:51:20,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 361 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:51:20,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 17:51:20,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 17:51:20,262 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-10-14 17:51:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 17:51:20,262 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2024-10-14 17:51:20,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:51:20,263 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 17:51:20,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 21 states have internal predecessors, (76), 13 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-14 17:51:20,263 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 17:51:20,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 17:51:20,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE (12 of 13 remaining) [2024-10-14 17:51:20,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (11 of 13 remaining) [2024-10-14 17:51:20,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (10 of 13 remaining) [2024-10-14 17:51:20,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (9 of 13 remaining) [2024-10-14 17:51:20,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2024-10-14 17:51:20,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2024-10-14 17:51:20,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2024-10-14 17:51:20,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2024-10-14 17:51:20,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2024-10-14 17:51:20,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 13 remaining) [2024-10-14 17:51:20,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2024-10-14 17:51:20,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2024-10-14 17:51:20,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2024-10-14 17:51:20,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 17:51:20,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 17:51:20,469 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:51:20,472 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 17:51:20,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:51:20 BoogieIcfgContainer [2024-10-14 17:51:20,475 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 17:51:20,475 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 17:51:20,475 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 17:51:20,475 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 17:51:20,476 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:50:56" (3/4) ... [2024-10-14 17:51:20,477 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 17:51:20,480 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-14 17:51:20,480 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2024-10-14 17:51:20,480 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-14 17:51:20,484 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2024-10-14 17:51:20,484 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-14 17:51:20,485 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-14 17:51:20,485 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 17:51:20,549 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 17:51:20,549 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 17:51:20,549 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 17:51:20,551 INFO L158 Benchmark]: Toolchain (without parser) took 24330.23ms. Allocated memory was 163.6MB in the beginning and 289.4MB in the end (delta: 125.8MB). Free memory was 91.9MB in the beginning and 100.8MB in the end (delta: -8.9MB). Peak memory consumption was 117.4MB. Max. memory is 16.1GB. [2024-10-14 17:51:20,551 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 163.6MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:51:20,551 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.21ms. Allocated memory is still 163.6MB. Free memory was 91.7MB in the beginning and 80.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 17:51:20,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.26ms. Allocated memory is still 163.6MB. Free memory was 80.1MB in the beginning and 78.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:51:20,552 INFO L158 Benchmark]: Boogie Preprocessor took 27.99ms. Allocated memory is still 163.6MB. Free memory was 78.6MB in the beginning and 76.6MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 17:51:20,552 INFO L158 Benchmark]: RCFGBuilder took 398.61ms. Allocated memory was 163.6MB in the beginning and 241.2MB in the end (delta: 77.6MB). Free memory was 76.6MB in the beginning and 197.9MB in the end (delta: -121.4MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-10-14 17:51:20,552 INFO L158 Benchmark]: TraceAbstraction took 23606.14ms. Allocated memory was 241.2MB in the beginning and 289.4MB in the end (delta: 48.2MB). Free memory was 197.9MB in the beginning and 105.7MB in the end (delta: 92.2MB). Peak memory consumption was 141.2MB. Max. memory is 16.1GB. [2024-10-14 17:51:20,553 INFO L158 Benchmark]: Witness Printer took 74.21ms. Allocated memory is still 289.4MB. Free memory was 105.7MB in the beginning and 100.8MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 17:51:20,553 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.16ms. Allocated memory is still 163.6MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 185.21ms. Allocated memory is still 163.6MB. Free memory was 91.7MB in the beginning and 80.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.26ms. Allocated memory is still 163.6MB. Free memory was 80.1MB in the beginning and 78.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.99ms. Allocated memory is still 163.6MB. Free memory was 78.6MB in the beginning and 76.6MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 398.61ms. Allocated memory was 163.6MB in the beginning and 241.2MB in the end (delta: 77.6MB). Free memory was 76.6MB in the beginning and 197.9MB in the end (delta: -121.4MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23606.14ms. Allocated memory was 241.2MB in the beginning and 289.4MB in the end (delta: 48.2MB). Free memory was 197.9MB in the beginning and 105.7MB in the end (delta: 92.2MB). Peak memory consumption was 141.2MB. Max. memory is 16.1GB. * Witness Printer took 74.21ms. Allocated memory is still 289.4MB. Free memory was 105.7MB in the beginning and 100.8MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. 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: 48]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 48]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 48]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 41]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - 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: 5]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 48 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 23.6s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1112 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1098 mSDsluCounter, 3776 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3150 mSDsCounter, 585 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5151 IncrementalHoareTripleChecker+Invalid, 5737 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 585 mSolverCounterUnsat, 626 mSDtfsCounter, 5151 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 840 GetRequests, 456 SyntacticMatches, 11 SemanticMatches, 373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3624 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=16, InterpolantAutomatonStates: 246, 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, 17 MinimizatonAttempts, 307 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 798 NumberOfCodeBlocks, 798 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 863 ConstructedInterpolants, 45 QuantifiedInterpolants, 4842 SizeOfPredicates, 68 NumberOfNonLiveVariables, 1464 ConjunctsInSsa, 208 ConjunctsInUnsatCore, 28 InterpolantComputations, 11 PerfectInterpolantSequences, 274/422 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 13 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-14 17:51:20,578 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