./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-dietlibc/strspn.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-dietlibc/strspn.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d2c6859ca90ff0da205f4fa2f88d8f61c0c2d9f9f437471b81ea8abc3f9fd19e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:02:35,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:02:35,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-10 15:02:35,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:02:35,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:02:35,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:02:35,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:02:35,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:02:35,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:02:35,682 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:02:35,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:02:35,683 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:02:35,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:02:35,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:02:35,684 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:02:35,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:02:35,684 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:02:35,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:02:35,685 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:02:35,685 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:02:35,685 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:02:35,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:02:35,694 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:02:35,694 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:02:35,694 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:02:35,694 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:02:35,695 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:02:35,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:02:35,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:02:35,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:02:35,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:02:35,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:02:35,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:02:35,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:02:35,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:02:35,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:02:35,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:02:35,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:02:35,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:02:35,697 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d2c6859ca90ff0da205f4fa2f88d8f61c0c2d9f9f437471b81ea8abc3f9fd19e [2024-11-10 15:02:35,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:02:35,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:02:35,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:02:35,887 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:02:35,887 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:02:35,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strspn.i [2024-11-10 15:02:37,343 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:02:37,597 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:02:37,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strspn.i [2024-11-10 15:02:37,610 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8609d0969/d7dd2b8e0ad34e758748b8d76c64e29a/FLAG5d228fcb0 [2024-11-10 15:02:37,622 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8609d0969/d7dd2b8e0ad34e758748b8d76c64e29a [2024-11-10 15:02:37,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:02:37,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:02:37,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:02:37,626 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:02:37,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:02:37,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:02:37" (1/1) ... [2024-11-10 15:02:37,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@316b9703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:37, skipping insertion in model container [2024-11-10 15:02:37,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:02:37" (1/1) ... [2024-11-10 15:02:37,658 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:02:37,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:02:37,886 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:02:37,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:02:37,961 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:02:37,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:37 WrapperNode [2024-11-10 15:02:37,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:02:37,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:02:37,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:02:37,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:02:37,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:37" (1/1) ... [2024-11-10 15:02:37,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:37" (1/1) ... [2024-11-10 15:02:37,995 INFO L138 Inliner]: procedures = 113, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2024-11-10 15:02:37,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:02:37,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:02:37,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:02:37,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:02:38,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:37" (1/1) ... [2024-11-10 15:02:38,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:37" (1/1) ... [2024-11-10 15:02:38,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:37" (1/1) ... [2024-11-10 15:02:38,029 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [4, 3]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2024-11-10 15:02:38,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:37" (1/1) ... [2024-11-10 15:02:38,033 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:37" (1/1) ... [2024-11-10 15:02:38,037 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:37" (1/1) ... [2024-11-10 15:02:38,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:37" (1/1) ... [2024-11-10 15:02:38,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:37" (1/1) ... [2024-11-10 15:02:38,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:37" (1/1) ... [2024-11-10 15:02:38,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:02:38,041 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:02:38,041 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:02:38,042 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:02:38,042 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:37" (1/1) ... [2024-11-10 15:02:38,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:02:38,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:02:38,072 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 15:02:38,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 15:02:38,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 15:02:38,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 15:02:38,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:02:38,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 15:02:38,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 15:02:38,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:02:38,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:02:38,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:02:38,197 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:02:38,198 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:02:38,404 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L528: havoc main_#t~ret15#1;call ULTIMATE.dealloc(main_#t~malloc12#1.base, main_#t~malloc12#1.offset);havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call ULTIMATE.dealloc(main_#t~malloc14#1.base, main_#t~malloc14#1.offset);havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset; [2024-11-10 15:02:38,414 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2024-11-10 15:02:38,414 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:02:38,428 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:02:38,428 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:02:38,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:02:38 BoogieIcfgContainer [2024-11-10 15:02:38,429 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:02:38,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:02:38,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:02:38,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:02:38,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:02:37" (1/3) ... [2024-11-10 15:02:38,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567853ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:02:38, skipping insertion in model container [2024-11-10 15:02:38,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:02:37" (2/3) ... [2024-11-10 15:02:38,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567853ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:02:38, skipping insertion in model container [2024-11-10 15:02:38,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:02:38" (3/3) ... [2024-11-10 15:02:38,437 INFO L112 eAbstractionObserver]: Analyzing ICFG strspn.i [2024-11-10 15:02:38,462 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:02:38,466 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-11-10 15:02:38,512 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:02:38,517 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;@3a5af791, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:02:38,517 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-10 15:02:38,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:38,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-10 15:02:38,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:02:38,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-10 15:02:38,525 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:02:38,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:02:38,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2861882, now seen corresponding path program 1 times [2024-11-10 15:02:38,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:02:38,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188899145] [2024-11-10 15:02:38,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:02:38,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:02:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:02:38,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:38,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:02:38,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188899145] [2024-11-10 15:02:38,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188899145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:02:38,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:02:38,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:02:38,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086872962] [2024-11-10 15:02:38,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:02:38,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:02:38,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:02:38,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:02:38,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:02:38,728 INFO L87 Difference]: Start difference. First operand has 43 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:38,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:02:38,793 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2024-11-10 15:02:38,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:02:38,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-10 15:02:38,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:02:38,802 INFO L225 Difference]: With dead ends: 42 [2024-11-10 15:02:38,802 INFO L226 Difference]: Without dead ends: 39 [2024-11-10 15:02:38,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:02:38,806 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:02:38,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 61 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:02:38,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-10 15:02:38,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-10 15:02:38,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.76) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:38,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-11-10 15:02:38,828 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 4 [2024-11-10 15:02:38,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:02:38,829 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-11-10 15:02:38,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:38,829 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-11-10 15:02:38,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-10 15:02:38,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:02:38,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-10 15:02:38,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:02:38,830 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:02:38,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:02:38,830 INFO L85 PathProgramCache]: Analyzing trace with hash 2861883, now seen corresponding path program 1 times [2024-11-10 15:02:38,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:02:38,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213850361] [2024-11-10 15:02:38,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:02:38,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:02:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:02:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:38,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:02:38,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213850361] [2024-11-10 15:02:38,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213850361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:02:38,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:02:38,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:02:38,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639111751] [2024-11-10 15:02:38,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:02:38,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:02:38,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:02:38,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:02:38,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:02:38,969 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:02:38,980 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-11-10 15:02:38,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:02:38,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-10 15:02:38,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:02:38,981 INFO L225 Difference]: With dead ends: 38 [2024-11-10 15:02:38,981 INFO L226 Difference]: Without dead ends: 38 [2024-11-10 15:02:38,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:02:38,982 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:02:38,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:02:38,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-10 15:02:38,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-10 15:02:38,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.72) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:38,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-10 15:02:38,986 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 4 [2024-11-10 15:02:38,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:02:38,986 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-10 15:02:38,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:38,986 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-10 15:02:38,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:02:38,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:02:38,987 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:02:38,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:02:38,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:02:38,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:02:38,988 INFO L85 PathProgramCache]: Analyzing trace with hash 88714810, now seen corresponding path program 1 times [2024-11-10 15:02:38,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:02:38,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734590981] [2024-11-10 15:02:38,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:02:38,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:02:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:02:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:39,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:02:39,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734590981] [2024-11-10 15:02:39,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734590981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:02:39,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:02:39,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:02:39,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424942129] [2024-11-10 15:02:39,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:02:39,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:02:39,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:02:39,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:02:39,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:02:39,007 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:02:39,043 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2024-11-10 15:02:39,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:02:39,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 15:02:39,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:02:39,045 INFO L225 Difference]: With dead ends: 40 [2024-11-10 15:02:39,045 INFO L226 Difference]: Without dead ends: 38 [2024-11-10 15:02:39,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:02:39,046 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:02:39,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:02:39,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-10 15:02:39,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-10 15:02:39,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.68) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:39,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-10 15:02:39,050 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 5 [2024-11-10 15:02:39,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:02:39,050 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-10 15:02:39,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:39,050 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-11-10 15:02:39,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 15:02:39,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:02:39,051 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:02:39,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:02:39,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:02:39,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:02:39,052 INFO L85 PathProgramCache]: Analyzing trace with hash -640996458, now seen corresponding path program 1 times [2024-11-10 15:02:39,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:02:39,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797468077] [2024-11-10 15:02:39,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:02:39,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:02:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:02:39,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:39,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:02:39,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797468077] [2024-11-10 15:02:39,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797468077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:02:39,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:02:39,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:02:39,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490690835] [2024-11-10 15:02:39,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:02:39,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:02:39,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:02:39,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:02:39,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:02:39,122 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:39,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:02:39,151 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-11-10 15:02:39,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:02:39,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 15:02:39,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:02:39,152 INFO L225 Difference]: With dead ends: 37 [2024-11-10 15:02:39,152 INFO L226 Difference]: Without dead ends: 37 [2024-11-10 15:02:39,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:02:39,154 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:02:39,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 58 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:02:39,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-10 15:02:39,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-10 15:02:39,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.64) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-11-10 15:02:39,157 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 7 [2024-11-10 15:02:39,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:02:39,157 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-11-10 15:02:39,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:39,158 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-11-10 15:02:39,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 15:02:39,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:02:39,158 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:02:39,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:02:39,159 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:02:39,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:02:39,159 INFO L85 PathProgramCache]: Analyzing trace with hash -640996457, now seen corresponding path program 1 times [2024-11-10 15:02:39,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:02:39,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963580962] [2024-11-10 15:02:39,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:02:39,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:02:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:02:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:39,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:02:39,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963580962] [2024-11-10 15:02:39,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963580962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:02:39,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:02:39,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:02:39,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317940685] [2024-11-10 15:02:39,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:02:39,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:02:39,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:02:39,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:02:39,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:02:39,332 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:39,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:02:39,348 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-11-10 15:02:39,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:02:39,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 15:02:39,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:02:39,349 INFO L225 Difference]: With dead ends: 36 [2024-11-10 15:02:39,351 INFO L226 Difference]: Without dead ends: 36 [2024-11-10 15:02:39,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:02:39,352 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:02:39,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:02:39,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-10 15:02:39,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-10 15:02:39,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.6) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:39,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-11-10 15:02:39,358 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 7 [2024-11-10 15:02:39,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:02:39,358 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-10 15:02:39,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:39,358 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-11-10 15:02:39,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 15:02:39,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:02:39,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:02:39,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:02:39,359 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:02:39,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:02:39,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1603943029, now seen corresponding path program 1 times [2024-11-10 15:02:39,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:02:39,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643570041] [2024-11-10 15:02:39,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:02:39,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:02:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:02:39,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:39,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:02:39,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643570041] [2024-11-10 15:02:39,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643570041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:02:39,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:02:39,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:02:39,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449218551] [2024-11-10 15:02:39,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:02:39,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:02:39,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:02:39,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:02:39,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:02:39,412 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:39,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:02:39,440 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-11-10 15:02:39,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:02:39,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 15:02:39,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:02:39,441 INFO L225 Difference]: With dead ends: 38 [2024-11-10 15:02:39,441 INFO L226 Difference]: Without dead ends: 36 [2024-11-10 15:02:39,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:02:39,442 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:02:39,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:02:39,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-10 15:02:39,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-10 15:02:39,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.56) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:39,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-10 15:02:39,444 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 8 [2024-11-10 15:02:39,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:02:39,445 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-10 15:02:39,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:39,445 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-10 15:02:39,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 15:02:39,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:02:39,445 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:02:39,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 15:02:39,446 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:02:39,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:02:39,446 INFO L85 PathProgramCache]: Analyzing trace with hash -500868427, now seen corresponding path program 1 times [2024-11-10 15:02:39,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:02:39,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095071579] [2024-11-10 15:02:39,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:02:39,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:02:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:02:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:39,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:02:39,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095071579] [2024-11-10 15:02:39,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095071579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:02:39,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:02:39,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:02:39,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090834027] [2024-11-10 15:02:39,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:02:39,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:02:39,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:02:39,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:02:39,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:02:39,530 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:39,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:02:39,563 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-11-10 15:02:39,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:02:39,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-10 15:02:39,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:02:39,564 INFO L225 Difference]: With dead ends: 34 [2024-11-10 15:02:39,564 INFO L226 Difference]: Without dead ends: 34 [2024-11-10 15:02:39,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:02:39,565 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:02:39,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 39 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:02:39,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-10 15:02:39,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-10 15:02:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.48) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-10 15:02:39,567 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 10 [2024-11-10 15:02:39,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:02:39,568 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-10 15:02:39,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:39,568 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-10 15:02:39,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 15:02:39,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:02:39,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:02:39,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:02:39,569 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:02:39,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:02:39,569 INFO L85 PathProgramCache]: Analyzing trace with hash -500868426, now seen corresponding path program 1 times [2024-11-10 15:02:39,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:02:39,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464759663] [2024-11-10 15:02:39,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:02:39,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:02:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:02:39,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:39,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:02:39,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464759663] [2024-11-10 15:02:39,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464759663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:02:39,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:02:39,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:02:39,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418291677] [2024-11-10 15:02:39,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:02:39,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:02:39,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:02:39,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:02:39,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:02:39,723 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:39,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:02:39,778 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2024-11-10 15:02:39,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:02:39,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-10 15:02:39,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:02:39,779 INFO L225 Difference]: With dead ends: 55 [2024-11-10 15:02:39,779 INFO L226 Difference]: Without dead ends: 55 [2024-11-10 15:02:39,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:02:39,780 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:02:39,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 83 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:02:39,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-10 15:02:39,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2024-11-10 15:02:39,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 44 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2024-11-10 15:02:39,794 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 10 [2024-11-10 15:02:39,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:02:39,794 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2024-11-10 15:02:39,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:39,794 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2024-11-10 15:02:39,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 15:02:39,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:02:39,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:02:39,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 15:02:39,797 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:02:39,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:02:39,797 INFO L85 PathProgramCache]: Analyzing trace with hash -654914671, now seen corresponding path program 1 times [2024-11-10 15:02:39,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:02:39,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547949084] [2024-11-10 15:02:39,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:02:39,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:02:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:02:39,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:39,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:02:39,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547949084] [2024-11-10 15:02:39,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547949084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:02:39,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:02:39,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:02:39,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679003040] [2024-11-10 15:02:39,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:02:39,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:02:39,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:02:39,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:02:39,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:02:39,983 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:40,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:02:40,063 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2024-11-10 15:02:40,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:02:40,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-10 15:02:40,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:02:40,065 INFO L225 Difference]: With dead ends: 63 [2024-11-10 15:02:40,065 INFO L226 Difference]: Without dead ends: 63 [2024-11-10 15:02:40,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:02:40,067 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 48 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:02:40,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 74 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:02:40,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-10 15:02:40,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2024-11-10 15:02:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 61 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2024-11-10 15:02:40,079 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 13 [2024-11-10 15:02:40,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:02:40,079 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2024-11-10 15:02:40,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2024-11-10 15:02:40,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 15:02:40,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:02:40,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:02:40,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 15:02:40,080 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:02:40,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:02:40,081 INFO L85 PathProgramCache]: Analyzing trace with hash -654914672, now seen corresponding path program 1 times [2024-11-10 15:02:40,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:02:40,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6287340] [2024-11-10 15:02:40,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:02:40,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:02:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:02:40,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:40,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:02:40,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6287340] [2024-11-10 15:02:40,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6287340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:02:40,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:02:40,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:02:40,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755892312] [2024-11-10 15:02:40,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:02:40,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:02:40,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:02:40,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:02:40,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:02:40,127 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:40,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:02:40,164 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2024-11-10 15:02:40,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:02:40,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-10 15:02:40,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:02:40,165 INFO L225 Difference]: With dead ends: 59 [2024-11-10 15:02:40,165 INFO L226 Difference]: Without dead ends: 59 [2024-11-10 15:02:40,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:02:40,166 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 30 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:02:40,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 46 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:02:40,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-10 15:02:40,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-10 15:02:40,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 58 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2024-11-10 15:02:40,169 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 13 [2024-11-10 15:02:40,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:02:40,169 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2024-11-10 15:02:40,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:40,169 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2024-11-10 15:02:40,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 15:02:40,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:02:40,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:02:40,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 15:02:40,170 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:02:40,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:02:40,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1984576973, now seen corresponding path program 1 times [2024-11-10 15:02:40,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:02:40,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889831549] [2024-11-10 15:02:40,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:02:40,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:02:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:02:40,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:40,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:02:40,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889831549] [2024-11-10 15:02:40,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889831549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:02:40,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:02:40,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:02:40,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059134456] [2024-11-10 15:02:40,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:02:40,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:02:40,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:02:40,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:02:40,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:02:40,264 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:40,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:02:40,292 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2024-11-10 15:02:40,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:02:40,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-10 15:02:40,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:02:40,293 INFO L225 Difference]: With dead ends: 58 [2024-11-10 15:02:40,293 INFO L226 Difference]: Without dead ends: 54 [2024-11-10 15:02:40,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:02:40,294 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:02:40,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 83 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:02:40,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-10 15:02:40,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-10 15:02:40,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 53 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:40,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2024-11-10 15:02:40,300 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 15 [2024-11-10 15:02:40,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:02:40,300 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2024-11-10 15:02:40,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:40,300 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2024-11-10 15:02:40,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:02:40,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:02:40,301 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:02:40,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 15:02:40,301 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:02:40,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:02:40,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1371880124, now seen corresponding path program 1 times [2024-11-10 15:02:40,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:02:40,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139714703] [2024-11-10 15:02:40,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:02:40,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:02:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:02:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:40,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:02:40,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139714703] [2024-11-10 15:02:40,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139714703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:02:40,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:02:40,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:02:40,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801258414] [2024-11-10 15:02:40,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:02:40,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:02:40,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:02:40,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:02:40,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:02:40,326 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:40,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:02:40,333 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2024-11-10 15:02:40,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:02:40,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-10 15:02:40,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:02:40,334 INFO L225 Difference]: With dead ends: 58 [2024-11-10 15:02:40,334 INFO L226 Difference]: Without dead ends: 58 [2024-11-10 15:02:40,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:02:40,336 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:02:40,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:02:40,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-10 15:02:40,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-11-10 15:02:40,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 55 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:40,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2024-11-10 15:02:40,339 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 18 [2024-11-10 15:02:40,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:02:40,339 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2024-11-10 15:02:40,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:40,339 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2024-11-10 15:02:40,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 15:02:40,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:02:40,342 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:02:40,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 15:02:40,343 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:02:40,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:02:40,343 INFO L85 PathProgramCache]: Analyzing trace with hash 175699969, now seen corresponding path program 1 times [2024-11-10 15:02:40,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:02:40,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571088266] [2024-11-10 15:02:40,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:02:40,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:02:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:02:40,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:40,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:02:40,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571088266] [2024-11-10 15:02:40,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571088266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:02:40,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:02:40,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:02:40,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875877736] [2024-11-10 15:02:40,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:02:40,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:02:40,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:02:40,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:02:40,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:02:40,399 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:40,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:02:40,423 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2024-11-10 15:02:40,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:02:40,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-10 15:02:40,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:02:40,424 INFO L225 Difference]: With dead ends: 59 [2024-11-10 15:02:40,424 INFO L226 Difference]: Without dead ends: 56 [2024-11-10 15:02:40,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:02:40,425 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:02:40,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:02:40,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-10 15:02:40,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-10 15:02:40,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 55 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:40,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2024-11-10 15:02:40,431 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 20 [2024-11-10 15:02:40,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:02:40,431 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2024-11-10 15:02:40,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:40,431 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2024-11-10 15:02:40,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 15:02:40,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:02:40,431 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:02:40,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 15:02:40,432 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:02:40,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:02:40,432 INFO L85 PathProgramCache]: Analyzing trace with hash 472236296, now seen corresponding path program 1 times [2024-11-10 15:02:40,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:02:40,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940416402] [2024-11-10 15:02:40,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:02:40,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:02:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:02:40,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:40,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:02:40,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940416402] [2024-11-10 15:02:40,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940416402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:02:40,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113407132] [2024-11-10 15:02:40,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:02:40,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:02:40,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:02:40,758 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:02:40,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 15:02:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:02:40,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 15:02:40,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:02:40,906 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 14 treesize of output 10 [2024-11-10 15:02:41,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:02:41,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-10 15:02:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:41,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:02:41,673 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 13 treesize of output 11 [2024-11-10 15:02:41,679 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 22 treesize of output 20 [2024-11-10 15:02:41,687 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 13 treesize of output 9 [2024-11-10 15:02:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:41,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113407132] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:02:41,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:02:41,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2024-11-10 15:02:41,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869655759] [2024-11-10 15:02:41,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:02:41,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 15:02:41,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:02:41,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 15:02:41,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2024-11-10 15:02:41,701 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:02:42,522 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2024-11-10 15:02:42,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:02:42,523 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-10 15:02:42,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:02:42,524 INFO L225 Difference]: With dead ends: 75 [2024-11-10 15:02:42,524 INFO L226 Difference]: Without dead ends: 71 [2024-11-10 15:02:42,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=192, Invalid=929, Unknown=1, NotChecked=0, Total=1122 [2024-11-10 15:02:42,525 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 117 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:02:42,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 129 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:02:42,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-10 15:02:42,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 55. [2024-11-10 15:02:42,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:42,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2024-11-10 15:02:42,527 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 21 [2024-11-10 15:02:42,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:02:42,527 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-11-10 15:02:42,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:42,528 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2024-11-10 15:02:42,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 15:02:42,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:02:42,528 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:02:42,543 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-11-10 15:02:42,732 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,SelfDestructingSolverStorable13 [2024-11-10 15:02:42,733 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:02:42,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:02:42,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1449913659, now seen corresponding path program 1 times [2024-11-10 15:02:42,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:02:42,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871286489] [2024-11-10 15:02:42,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:02:42,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:02:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:02:43,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:43,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:02:43,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871286489] [2024-11-10 15:02:43,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871286489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:02:43,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952159782] [2024-11-10 15:02:43,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:02:43,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:02:43,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:02:43,188 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:02:43,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 15:02:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:02:43,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-10 15:02:43,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:02:43,275 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 14 treesize of output 10 [2024-11-10 15:02:43,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:02:43,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:02:43,331 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:02:43,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:02:43,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:02:43,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-10 15:02:43,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:43,843 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:02:44,115 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 20 treesize of output 12 [2024-11-10 15:02:44,361 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:02:44,363 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 15 treesize of output 11 [2024-11-10 15:02:44,371 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-10 15:02:44,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-10 15:02:44,374 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 13 treesize of output 11 [2024-11-10 15:02:44,376 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 22 treesize of output 20 [2024-11-10 15:02:44,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:44,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952159782] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:02:44,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:02:44,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 14] total 38 [2024-11-10 15:02:44,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680841524] [2024-11-10 15:02:44,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:02:44,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-10 15:02:44,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:02:44,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-10 15:02:44,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1297, Unknown=0, NotChecked=0, Total=1482 [2024-11-10 15:02:44,396 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 39 states, 38 states have (on average 1.631578947368421) internal successors, (62), 39 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:45,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:02:45,140 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2024-11-10 15:02:45,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 15:02:45,140 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.631578947368421) internal successors, (62), 39 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-10 15:02:45,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:02:45,140 INFO L225 Difference]: With dead ends: 81 [2024-11-10 15:02:45,140 INFO L226 Difference]: Without dead ends: 81 [2024-11-10 15:02:45,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=362, Invalid=2088, Unknown=0, NotChecked=0, Total=2450 [2024-11-10 15:02:45,142 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 53 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:02:45,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 234 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:02:45,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-10 15:02:45,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 58. [2024-11-10 15:02:45,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 56 states have (on average 1.125) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:45,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2024-11-10 15:02:45,144 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 23 [2024-11-10 15:02:45,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:02:45,144 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2024-11-10 15:02:45,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.631578947368421) internal successors, (62), 39 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:45,144 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2024-11-10 15:02:45,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 15:02:45,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:02:45,145 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:02:45,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 15:02:45,349 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,SelfDestructingSolverStorable14 [2024-11-10 15:02:45,350 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:02:45,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:02:45,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1151381633, now seen corresponding path program 2 times [2024-11-10 15:02:45,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:02:45,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054676159] [2024-11-10 15:02:45,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:02:45,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:02:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:02:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:45,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:02:45,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054676159] [2024-11-10 15:02:45,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054676159] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:02:45,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922283309] [2024-11-10 15:02:45,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:02:45,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:02:45,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:02:45,732 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:02:45,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 15:02:45,797 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:02:45,797 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:02:45,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-10 15:02:45,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:02:45,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-10 15:02:45,826 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 14 treesize of output 10 [2024-11-10 15:02:46,284 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-10 15:02:46,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 23 [2024-11-10 15:02:46,411 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:46,412 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:02:46,919 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 25 [2024-11-10 15:02:46,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-11-10 15:02:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:47,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922283309] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:02:47,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:02:47,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 33 [2024-11-10 15:02:47,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509711959] [2024-11-10 15:02:47,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:02:47,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-10 15:02:47,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:02:47,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-10 15:02:47,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 15:02:47,033 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 34 states, 33 states have (on average 2.212121212121212) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:48,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:02:48,019 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2024-11-10 15:02:48,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 15:02:48,019 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.212121212121212) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-10 15:02:48,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:02:48,020 INFO L225 Difference]: With dead ends: 73 [2024-11-10 15:02:48,020 INFO L226 Difference]: Without dead ends: 73 [2024-11-10 15:02:48,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=357, Invalid=1995, Unknown=0, NotChecked=0, Total=2352 [2024-11-10 15:02:48,021 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 77 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:02:48,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 226 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:02:48,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-10 15:02:48,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 37. [2024-11-10 15:02:48,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2024-11-10 15:02:48,023 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 29 [2024-11-10 15:02:48,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:02:48,023 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2024-11-10 15:02:48,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.212121212121212) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:48,023 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2024-11-10 15:02:48,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 15:02:48,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:02:48,024 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:02:48,036 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-11-10 15:02:48,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:02:48,229 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:02:48,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:02:48,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1982911722, now seen corresponding path program 2 times [2024-11-10 15:02:48,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:02:48,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200412138] [2024-11-10 15:02:48,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:02:48,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:02:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:02:48,840 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:48,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:02:48,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200412138] [2024-11-10 15:02:48,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200412138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:02:48,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477301825] [2024-11-10 15:02:48,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:02:48,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:02:48,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:02:48,843 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:02:48,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 15:02:48,903 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:02:48,903 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:02:48,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-10 15:02:48,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:02:48,927 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 14 treesize of output 10 [2024-11-10 15:02:48,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:02:48,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:02:48,983 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:02:48,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:02:50,378 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-10 15:02:50,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 30 [2024-11-10 15:02:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:50,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:02:51,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:02:51,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2024-11-10 15:02:51,535 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 49 treesize of output 45 [2024-11-10 15:02:51,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:02:51,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2024-11-10 15:02:51,589 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 25 [2024-11-10 15:02:51,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-11-10 15:02:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:02:51,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477301825] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:02:51,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:02:51,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 18] total 53 [2024-11-10 15:02:51,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591736317] [2024-11-10 15:02:51,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:02:51,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-10 15:02:51,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:02:51,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-10 15:02:51,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=2509, Unknown=1, NotChecked=0, Total=2862 [2024-11-10 15:02:51,662 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 54 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:53,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:02:53,804 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2024-11-10 15:02:53,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-10 15:02:53,804 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 54 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-10 15:02:53,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:02:53,805 INFO L225 Difference]: With dead ends: 56 [2024-11-10 15:02:53,805 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 15:02:53,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1149, Invalid=6332, Unknown=1, NotChecked=0, Total=7482 [2024-11-10 15:02:53,807 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 67 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:02:53,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 395 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 15:02:53,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 15:02:53,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 15:02:53,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 15:02:53,808 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2024-11-10 15:02:53,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:02:53,808 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 15:02:53,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 54 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:02:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 15:02:53,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 15:02:53,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2024-11-10 15:02:53,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2024-11-10 15:02:53,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2024-11-10 15:02:53,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2024-11-10 15:02:53,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-11-10 15:02:53,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-11-10 15:02:53,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2024-11-10 15:02:53,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-11-10 15:02:53,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-11-10 15:02:53,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2024-11-10 15:02:53,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-11-10 15:02:53,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-11-10 15:02:53,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 15 remaining) [2024-11-10 15:02:53,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-11-10 15:02:53,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-11-10 15:02:53,825 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-11-10 15:02:54,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 15:02:54,019 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:02:54,021 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 15:02:54,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:02:54 BoogieIcfgContainer [2024-11-10 15:02:54,024 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 15:02:54,029 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 15:02:54,029 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 15:02:54,029 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 15:02:54,029 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:02:38" (3/4) ... [2024-11-10 15:02:54,031 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 15:02:54,042 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-10 15:02:54,042 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-10 15:02:54,042 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-10 15:02:54,042 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 15:02:54,109 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 15:02:54,110 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 15:02:54,110 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 15:02:54,110 INFO L158 Benchmark]: Toolchain (without parser) took 16485.21ms. Allocated memory was 165.7MB in the beginning and 377.5MB in the end (delta: 211.8MB). Free memory was 90.5MB in the beginning and 182.0MB in the end (delta: -91.6MB). Peak memory consumption was 121.5MB. Max. memory is 16.1GB. [2024-11-10 15:02:54,111 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 165.7MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:02:54,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.97ms. Allocated memory is still 165.7MB. Free memory was 90.1MB in the beginning and 71.9MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 15:02:54,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.32ms. Allocated memory is still 165.7MB. Free memory was 71.5MB in the beginning and 69.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:02:54,111 INFO L158 Benchmark]: Boogie Preprocessor took 43.09ms. Allocated memory is still 165.7MB. Free memory was 69.9MB in the beginning and 67.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:02:54,111 INFO L158 Benchmark]: IcfgBuilder took 387.47ms. Allocated memory was 165.7MB in the beginning and 218.1MB in the end (delta: 52.4MB). Free memory was 67.8MB in the beginning and 185.1MB in the end (delta: -117.2MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2024-11-10 15:02:54,112 INFO L158 Benchmark]: TraceAbstraction took 15592.77ms. Allocated memory was 218.1MB in the beginning and 377.5MB in the end (delta: 159.4MB). Free memory was 184.0MB in the beginning and 186.7MB in the end (delta: -2.7MB). Peak memory consumption was 157.2MB. Max. memory is 16.1GB. [2024-11-10 15:02:54,113 INFO L158 Benchmark]: Witness Printer took 80.99ms. Allocated memory is still 377.5MB. Free memory was 186.7MB in the beginning and 182.0MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 15:02:54,114 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.45ms. Allocated memory is still 165.7MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.97ms. Allocated memory is still 165.7MB. Free memory was 90.1MB in the beginning and 71.9MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.32ms. Allocated memory is still 165.7MB. Free memory was 71.5MB in the beginning and 69.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.09ms. Allocated memory is still 165.7MB. Free memory was 69.9MB in the beginning and 67.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 387.47ms. Allocated memory was 165.7MB in the beginning and 218.1MB in the end (delta: 52.4MB). Free memory was 67.8MB in the beginning and 185.1MB in the end (delta: -117.2MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * TraceAbstraction took 15592.77ms. Allocated memory was 218.1MB in the beginning and 377.5MB in the end (delta: 159.4MB). Free memory was 184.0MB in the beginning and 186.7MB in the end (delta: -2.7MB). Peak memory consumption was 157.2MB. Max. memory is 16.1GB. * Witness Printer took 80.99ms. Allocated memory is still 377.5MB. Free memory was 186.7MB in the beginning and 182.0MB in the end (delta: 4.6MB). 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: 519]: 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: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 15.5s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 462 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 462 mSDsluCounter, 1839 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1383 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2766 IncrementalHoareTripleChecker+Invalid, 2802 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 456 mSDtfsCounter, 2766 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 136 SyntacticMatches, 3 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2712 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=9, InterpolantAutomatonStates: 137, 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, 88 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 352 NumberOfCodeBlocks, 352 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 436 ConstructedInterpolants, 84 QuantifiedInterpolants, 6799 SizeOfPredicates, 42 NumberOfNonLiveVariables, 575 ConjunctsInSsa, 160 ConjunctsInUnsatCore, 25 InterpolantComputations, 13 PerfectInterpolantSequences, 13/103 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 15 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 15:02:54,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE