./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-ext-properties/list-ext_2.i --full-output --preprocessor.use.memory.slicer true --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/list-ext-properties/list-ext_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8708d72a830c5b897b9a667c6367e709c7302fa81ab6e6c80a90a68a6807b5fb --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 17:14:28,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 17:14:28,919 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-22 17:14:28,922 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 17:14:28,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 17:14:28,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 17:14:28,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 17:14:28,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 17:14:28,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 17:14:28,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 17:14:28,950 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 17:14:28,950 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 17:14:28,951 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 17:14:28,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 17:14:28,952 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 17:14:28,952 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 17:14:28,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 17:14:28,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 17:14:28,953 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-22 17:14:28,953 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-22 17:14:28,953 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-22 17:14:28,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 17:14:28,955 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 17:14:28,955 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-22 17:14:28,955 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 17:14:28,955 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 17:14:28,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 17:14:28,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 17:14:28,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 17:14:28,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 17:14:28,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 17:14:28,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 17:14:28,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 17:14:28,958 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 17:14:28,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 17:14:28,958 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 17:14:28,959 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 17:14:28,959 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 17:14:28,959 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 17:14:28,959 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8708d72a830c5b897b9a667c6367e709c7302fa81ab6e6c80a90a68a6807b5fb Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 17:14:29,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 17:14:29,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 17:14:29,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 17:14:29,235 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 17:14:29,236 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 17:14:29,237 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_2.i [2023-11-22 17:14:30,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 17:14:30,407 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 17:14:30,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext-properties/list-ext_2.i [2023-11-22 17:14:30,416 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c61838ca7/d5eec14a3c034995a57b4fbba87fc511/FLAG93d6ef88c [2023-11-22 17:14:30,782 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c61838ca7/d5eec14a3c034995a57b4fbba87fc511 [2023-11-22 17:14:30,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 17:14:30,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 17:14:30,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 17:14:30,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 17:14:30,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 17:14:30,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:14:30" (1/1) ... [2023-11-22 17:14:30,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a678aa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:30, skipping insertion in model container [2023-11-22 17:14:30,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:14:30" (1/1) ... [2023-11-22 17:14:30,833 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 17:14:31,035 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 17:14:31,042 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 17:14:31,097 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 17:14:31,119 INFO L206 MainTranslator]: Completed translation [2023-11-22 17:14:31,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:31 WrapperNode [2023-11-22 17:14:31,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 17:14:31,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 17:14:31,121 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 17:14:31,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 17:14:31,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:31" (1/1) ... [2023-11-22 17:14:31,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:31" (1/1) ... [2023-11-22 17:14:31,161 INFO L138 Inliner]: procedures = 125, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 134 [2023-11-22 17:14:31,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 17:14:31,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 17:14:31,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 17:14:31,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 17:14:31,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:31" (1/1) ... [2023-11-22 17:14:31,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:31" (1/1) ... [2023-11-22 17:14:31,180 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:31" (1/1) ... [2023-11-22 17:14:31,191 INFO L189 HeapSplitter]: Split 17 memory accesses to 2 slices as follows [2, 15] [2023-11-22 17:14:31,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:31" (1/1) ... [2023-11-22 17:14:31,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:31" (1/1) ... [2023-11-22 17:14:31,198 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:31" (1/1) ... [2023-11-22 17:14:31,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:31" (1/1) ... [2023-11-22 17:14:31,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:31" (1/1) ... [2023-11-22 17:14:31,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:31" (1/1) ... [2023-11-22 17:14:31,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 17:14:31,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 17:14:31,213 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 17:14:31,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 17:14:31,214 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:31" (1/1) ... [2023-11-22 17:14:31,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 17:14:31,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 17:14:31,253 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 17:14:31,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 17:14:31,291 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-22 17:14:31,291 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-22 17:14:31,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-22 17:14:31,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-22 17:14:31,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-22 17:14:31,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-22 17:14:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 17:14:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 17:14:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-22 17:14:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-22 17:14:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-22 17:14:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-22 17:14:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 17:14:31,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 17:14:31,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-22 17:14:31,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 17:14:31,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 17:14:31,461 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 17:14:31,469 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 17:14:31,518 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-22 17:14:31,786 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 17:14:31,815 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 17:14:31,815 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-22 17:14:31,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:14:31 BoogieIcfgContainer [2023-11-22 17:14:31,816 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 17:14:31,817 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 17:14:31,817 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 17:14:31,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 17:14:31,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 05:14:30" (1/3) ... [2023-11-22 17:14:31,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f1cd082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:14:31, skipping insertion in model container [2023-11-22 17:14:31,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:31" (2/3) ... [2023-11-22 17:14:31,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f1cd082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:14:31, skipping insertion in model container [2023-11-22 17:14:31,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:14:31" (3/3) ... [2023-11-22 17:14:31,821 INFO L112 eAbstractionObserver]: Analyzing ICFG list-ext_2.i [2023-11-22 17:14:31,835 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 17:14:31,835 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2023-11-22 17:14:31,867 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 17:14:31,872 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@60ab626b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 17:14:31,872 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2023-11-22 17:14:31,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 43 states have (on average 2.2790697674418605) internal successors, (98), 83 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-22 17:14:31,880 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:14:31,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-22 17:14:31,880 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-22 17:14:31,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:14:31,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1906837973, now seen corresponding path program 1 times [2023-11-22 17:14:31,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:14:31,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157162021] [2023-11-22 17:14:31,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:14:31,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:14:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:14:32,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:14:32,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:14:32,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157162021] [2023-11-22 17:14:32,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157162021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:14:32,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:14:32,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 17:14:32,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360850308] [2023-11-22 17:14:32,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:14:32,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 17:14:32,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:14:32,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 17:14:32,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 17:14:32,061 INFO L87 Difference]: Start difference. First operand has 85 states, 43 states have (on average 2.2790697674418605) internal successors, (98), 83 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:32,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:14:32,098 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2023-11-22 17:14:32,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 17:14:32,101 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2023-11-22 17:14:32,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:14:32,107 INFO L225 Difference]: With dead ends: 84 [2023-11-22 17:14:32,107 INFO L226 Difference]: Without dead ends: 78 [2023-11-22 17:14:32,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 17:14:32,113 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 17:14:32,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 17:14:32,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-22 17:14:32,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-22 17:14:32,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 40 states have (on average 2.1) internal successors, (84), 77 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:32,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2023-11-22 17:14:32,150 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 6 [2023-11-22 17:14:32,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:14:32,150 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2023-11-22 17:14:32,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:32,151 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2023-11-22 17:14:32,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-22 17:14:32,152 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:14:32,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:14:32,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 17:14:32,152 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-22 17:14:32,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:14:32,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1016578160, now seen corresponding path program 1 times [2023-11-22 17:14:32,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:14:32,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112688574] [2023-11-22 17:14:32,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:14:32,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:14:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:14:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:14:32,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:14:32,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112688574] [2023-11-22 17:14:32,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112688574] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:14:32,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:14:32,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 17:14:32,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972707235] [2023-11-22 17:14:32,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:14:32,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:14:32,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:14:32,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:14:32,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:14:32,280 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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) [2023-11-22 17:14:32,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:14:32,428 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2023-11-22 17:14:32,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 17:14:32,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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 [2023-11-22 17:14:32,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:14:32,432 INFO L225 Difference]: With dead ends: 98 [2023-11-22 17:14:32,432 INFO L226 Difference]: Without dead ends: 98 [2023-11-22 17:14:32,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:14:32,437 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 145 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:14:32,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 44 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:14:32,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-22 17:14:32,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 79. [2023-11-22 17:14:32,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 78 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2023-11-22 17:14:32,454 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 7 [2023-11-22 17:14:32,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:14:32,455 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2023-11-22 17:14:32,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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) [2023-11-22 17:14:32,456 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2023-11-22 17:14:32,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-22 17:14:32,456 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:14:32,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:14:32,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 17:14:32,457 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-22 17:14:32,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:14:32,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1016578161, now seen corresponding path program 1 times [2023-11-22 17:14:32,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:14:32,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003740800] [2023-11-22 17:14:32,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:14:32,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:14:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:14:32,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:14:32,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:14:32,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003740800] [2023-11-22 17:14:32,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003740800] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:14:32,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:14:32,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 17:14:32,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798907452] [2023-11-22 17:14:32,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:14:32,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:14:32,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:14:32,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:14:32,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:14:32,616 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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) [2023-11-22 17:14:32,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:14:32,747 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2023-11-22 17:14:32,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 17:14:32,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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 [2023-11-22 17:14:32,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:14:32,752 INFO L225 Difference]: With dead ends: 109 [2023-11-22 17:14:32,752 INFO L226 Difference]: Without dead ends: 109 [2023-11-22 17:14:32,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:14:32,758 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 149 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:14:32,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 52 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:14:32,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-22 17:14:32,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 96. [2023-11-22 17:14:32,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.5942028985507246) internal successors, (110), 95 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:32,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2023-11-22 17:14:32,772 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 7 [2023-11-22 17:14:32,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:14:32,772 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2023-11-22 17:14:32,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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) [2023-11-22 17:14:32,773 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2023-11-22 17:14:32,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-22 17:14:32,773 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:14:32,773 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:14:32,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 17:14:32,774 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-22 17:14:32,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:14:32,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1591063783, now seen corresponding path program 1 times [2023-11-22 17:14:32,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:14:32,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122591903] [2023-11-22 17:14:32,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:14:32,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:14:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:14:32,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:14:32,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:14:32,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122591903] [2023-11-22 17:14:32,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122591903] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:14:32,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:14:32,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 17:14:32,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066115094] [2023-11-22 17:14:32,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:14:32,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 17:14:32,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:14:32,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 17:14:32,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:14:32,952 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:33,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:14:33,104 INFO L93 Difference]: Finished difference Result 129 states and 147 transitions. [2023-11-22 17:14:33,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 17:14:33,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2023-11-22 17:14:33,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:14:33,105 INFO L225 Difference]: With dead ends: 129 [2023-11-22 17:14:33,105 INFO L226 Difference]: Without dead ends: 129 [2023-11-22 17:14:33,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-22 17:14:33,106 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 100 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:14:33,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 136 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:14:33,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-22 17:14:33,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 93. [2023-11-22 17:14:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 92 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2023-11-22 17:14:33,109 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 14 [2023-11-22 17:14:33,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:14:33,110 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2023-11-22 17:14:33,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:33,110 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2023-11-22 17:14:33,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-22 17:14:33,110 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:14:33,110 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:14:33,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 17:14:33,110 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-22 17:14:33,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:14:33,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1591063782, now seen corresponding path program 1 times [2023-11-22 17:14:33,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:14:33,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320200371] [2023-11-22 17:14:33,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:14:33,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:14:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:14:33,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:14:33,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:14:33,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320200371] [2023-11-22 17:14:33,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320200371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:14:33,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:14:33,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 17:14:33,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457839893] [2023-11-22 17:14:33,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:14:33,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 17:14:33,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:14:33,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 17:14:33,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:14:33,219 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:33,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:14:33,371 INFO L93 Difference]: Finished difference Result 121 states and 140 transitions. [2023-11-22 17:14:33,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 17:14:33,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2023-11-22 17:14:33,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:14:33,372 INFO L225 Difference]: With dead ends: 121 [2023-11-22 17:14:33,372 INFO L226 Difference]: Without dead ends: 121 [2023-11-22 17:14:33,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-22 17:14:33,373 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 58 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:14:33,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 180 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:14:33,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-22 17:14:33,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 69. [2023-11-22 17:14:33,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.490566037735849) internal successors, (79), 68 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:33,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2023-11-22 17:14:33,376 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 14 [2023-11-22 17:14:33,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:14:33,376 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2023-11-22 17:14:33,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2023-11-22 17:14:33,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-22 17:14:33,384 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:14:33,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:14:33,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 17:14:33,384 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-22 17:14:33,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:14:33,385 INFO L85 PathProgramCache]: Analyzing trace with hash 469279044, now seen corresponding path program 1 times [2023-11-22 17:14:33,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:14:33,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100926051] [2023-11-22 17:14:33,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:14:33,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:14:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:14:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:14:33,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:14:33,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100926051] [2023-11-22 17:14:33,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100926051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:14:33,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:14:33,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 17:14:33,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086355160] [2023-11-22 17:14:33,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:14:33,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 17:14:33,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:14:33,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 17:14:33,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-22 17:14:33,547 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 6 states, 6 states have (on average 2.5) 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) [2023-11-22 17:14:33,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:14:33,690 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2023-11-22 17:14:33,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 17:14:33,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) 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 [2023-11-22 17:14:33,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:14:33,691 INFO L225 Difference]: With dead ends: 122 [2023-11-22 17:14:33,691 INFO L226 Difference]: Without dead ends: 122 [2023-11-22 17:14:33,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-22 17:14:33,691 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 55 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:14:33,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 146 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:14:33,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-22 17:14:33,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 79. [2023-11-22 17:14:33,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 78 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:33,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2023-11-22 17:14:33,695 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 15 [2023-11-22 17:14:33,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:14:33,695 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2023-11-22 17:14:33,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) 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) [2023-11-22 17:14:33,695 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2023-11-22 17:14:33,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-22 17:14:33,696 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:14:33,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:14:33,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-22 17:14:33,696 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-22 17:14:33,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:14:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1185760, now seen corresponding path program 1 times [2023-11-22 17:14:33,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:14:33,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183705273] [2023-11-22 17:14:33,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:14:33,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:14:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:14:33,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:14:33,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:14:33,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183705273] [2023-11-22 17:14:33,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183705273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:14:33,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:14:33,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 17:14:33,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828893624] [2023-11-22 17:14:33,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:14:33,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 17:14:33,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:14:33,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 17:14:33,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-22 17:14:33,813 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:33,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:14:33,908 INFO L93 Difference]: Finished difference Result 121 states and 134 transitions. [2023-11-22 17:14:33,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 17:14:33,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2023-11-22 17:14:33,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:14:33,909 INFO L225 Difference]: With dead ends: 121 [2023-11-22 17:14:33,910 INFO L226 Difference]: Without dead ends: 121 [2023-11-22 17:14:33,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-22 17:14:33,911 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 75 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:14:33,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 139 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:14:33,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-22 17:14:33,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 81. [2023-11-22 17:14:33,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 80 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:33,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2023-11-22 17:14:33,922 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 17 [2023-11-22 17:14:33,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:14:33,922 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2023-11-22 17:14:33,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:33,922 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2023-11-22 17:14:33,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 17:14:33,923 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:14:33,923 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:14:33,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-22 17:14:33,924 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-22 17:14:33,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:14:33,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1135756757, now seen corresponding path program 1 times [2023-11-22 17:14:33,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:14:33,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402077625] [2023-11-22 17:14:33,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:14:33,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:14:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 17:14:33,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-22 17:14:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 17:14:33,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-22 17:14:33,978 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-22 17:14:33,979 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (37 of 38 remaining) [2023-11-22 17:14:33,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 38 remaining) [2023-11-22 17:14:33,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 38 remaining) [2023-11-22 17:14:33,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 38 remaining) [2023-11-22 17:14:33,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 38 remaining) [2023-11-22 17:14:33,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 38 remaining) [2023-11-22 17:14:33,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 38 remaining) [2023-11-22 17:14:33,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 38 remaining) [2023-11-22 17:14:33,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 38 remaining) [2023-11-22 17:14:33,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 38 remaining) [2023-11-22 17:14:33,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 38 remaining) [2023-11-22 17:14:33,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 38 remaining) [2023-11-22 17:14:33,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 38 remaining) [2023-11-22 17:14:33,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 38 remaining) [2023-11-22 17:14:33,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 38 remaining) [2023-11-22 17:14:33,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 38 remaining) [2023-11-22 17:14:33,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 38 remaining) [2023-11-22 17:14:33,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 38 remaining) [2023-11-22 17:14:33,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 38 remaining) [2023-11-22 17:14:33,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 38 remaining) [2023-11-22 17:14:33,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 38 remaining) [2023-11-22 17:14:33,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 38 remaining) [2023-11-22 17:14:33,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 38 remaining) [2023-11-22 17:14:33,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 38 remaining) [2023-11-22 17:14:33,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 38 remaining) [2023-11-22 17:14:33,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 38 remaining) [2023-11-22 17:14:33,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 38 remaining) [2023-11-22 17:14:33,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 38 remaining) [2023-11-22 17:14:33,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 38 remaining) [2023-11-22 17:14:33,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 38 remaining) [2023-11-22 17:14:33,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 38 remaining) [2023-11-22 17:14:33,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (6 of 38 remaining) [2023-11-22 17:14:33,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (5 of 38 remaining) [2023-11-22 17:14:33,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE (4 of 38 remaining) [2023-11-22 17:14:33,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE (3 of 38 remaining) [2023-11-22 17:14:33,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (2 of 38 remaining) [2023-11-22 17:14:33,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (1 of 38 remaining) [2023-11-22 17:14:33,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK (0 of 38 remaining) [2023-11-22 17:14:33,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-22 17:14:33,986 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:14:33,989 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 17:14:34,000 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short5 could not be translated [2023-11-22 17:14:34,001 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-22 17:14:34,001 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated [2023-11-22 17:14:34,001 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-22 17:14:34,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 05:14:34 BoogieIcfgContainer [2023-11-22 17:14:34,006 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 17:14:34,006 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 17:14:34,006 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 17:14:34,006 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 17:14:34,007 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:14:31" (3/4) ... [2023-11-22 17:14:34,008 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-22 17:14:34,009 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 17:14:34,009 INFO L158 Benchmark]: Toolchain (without parser) took 3224.53ms. Allocated memory was 169.9MB in the beginning and 209.7MB in the end (delta: 39.8MB). Free memory was 135.6MB in the beginning and 111.7MB in the end (delta: 23.9MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. [2023-11-22 17:14:34,010 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 104.9MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 17:14:34,010 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.90ms. Allocated memory is still 169.9MB. Free memory was 135.6MB in the beginning and 118.3MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-22 17:14:34,010 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.50ms. Allocated memory is still 169.9MB. Free memory was 118.3MB in the beginning and 116.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 17:14:34,010 INFO L158 Benchmark]: Boogie Preprocessor took 50.18ms. Allocated memory is still 169.9MB. Free memory was 116.2MB in the beginning and 113.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-22 17:14:34,010 INFO L158 Benchmark]: RCFGBuilder took 602.53ms. Allocated memory is still 169.9MB. Free memory was 113.1MB in the beginning and 121.4MB in the end (delta: -8.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-22 17:14:34,010 INFO L158 Benchmark]: TraceAbstraction took 2189.03ms. Allocated memory was 169.9MB in the beginning and 209.7MB in the end (delta: 39.8MB). Free memory was 120.4MB in the beginning and 112.7MB in the end (delta: 7.6MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. [2023-11-22 17:14:34,011 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 209.7MB. Free memory was 112.7MB in the beginning and 111.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 17:14:34,011 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.21ms. Allocated memory is still 104.9MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.90ms. Allocated memory is still 169.9MB. Free memory was 135.6MB in the beginning and 118.3MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.50ms. Allocated memory is still 169.9MB. Free memory was 118.3MB in the beginning and 116.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.18ms. Allocated memory is still 169.9MB. Free memory was 116.2MB in the beginning and 113.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 602.53ms. Allocated memory is still 169.9MB. Free memory was 113.1MB in the beginning and 121.4MB in the end (delta: -8.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2189.03ms. Allocated memory was 169.9MB in the beginning and 209.7MB in the end (delta: 39.8MB). Free memory was 120.4MB in the beginning and 112.7MB in the end (delta: 7.6MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 209.7MB. Free memory was 112.7MB in the beginning and 111.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - UnprovableResult [Line: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 12. Possible FailurePath: [L533] int i = 0; [L534] int y = 0; [L535] List a = (List) malloc(sizeof(struct node)); [L536] COND FALSE !(a == 0) VAL [a={-2:0}, i=0, y=0] [L537] List t; [L538] List p = a; VAL [a={-2:0}, i=0, p={-2:0}, y=0] [L539] i < 10 && __VERIFIER_nondet_int() [L539] i < 10 && __VERIFIER_nondet_int() VAL [a={-2:0}, i=0, p={-2:0}, y=0] [L539] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L547] y < 10 && __VERIFIER_nondet_int() [L547] y < 10 && __VERIFIER_nondet_int() VAL [a={-2:0}, i=0, p={-2:0}, y=0] [L547] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L555] p->h = 3 [L556] p->n = (void*)__VERIFIER_nondet_ulong() [L557] i = 0 [L558] y = 0 [L559] p = a VAL [a={-2:0}, i=0, p={-2:0}, y=0] [L560] EXPR p->h [L560] COND FALSE !(p->h == 1) [L564] EXPR p->h [L564] COND FALSE !(p->h == 2) [L568] EXPR p->h [L568] COND TRUE p->h != 3 || (i + y) < 20 [L569] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "list-ext_2.c", 3, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 582 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 582 mSDsluCounter, 778 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 438 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 886 IncrementalHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 340 mSDtfsCounter, 886 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=3, InterpolantAutomatonStates: 35, 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, 7 MinimizatonAttempts, 203 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 385 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 10/10 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-22 17:14:34,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/list-ext-properties/list-ext_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8708d72a830c5b897b9a667c6367e709c7302fa81ab6e6c80a90a68a6807b5fb --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 17:14:36,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 17:14:36,085 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-22 17:14:36,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 17:14:36,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 17:14:36,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 17:14:36,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 17:14:36,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 17:14:36,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 17:14:36,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 17:14:36,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 17:14:36,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 17:14:36,130 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 17:14:36,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 17:14:36,132 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 17:14:36,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 17:14:36,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 17:14:36,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 17:14:36,132 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-22 17:14:36,133 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-22 17:14:36,133 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-22 17:14:36,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 17:14:36,134 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 17:14:36,134 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-22 17:14:36,134 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-22 17:14:36,134 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-22 17:14:36,134 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 17:14:36,134 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 17:14:36,135 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 17:14:36,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 17:14:36,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 17:14:36,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 17:14:36,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 17:14:36,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 17:14:36,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 17:14:36,137 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-22 17:14:36,137 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-22 17:14:36,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 17:14:36,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 17:14:36,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 17:14:36,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 17:14:36,138 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-22 17:14:36,138 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8708d72a830c5b897b9a667c6367e709c7302fa81ab6e6c80a90a68a6807b5fb Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 17:14:36,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 17:14:36,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 17:14:36,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 17:14:36,461 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 17:14:36,461 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 17:14:36,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_2.i [2023-11-22 17:14:37,501 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 17:14:37,724 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 17:14:37,725 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext-properties/list-ext_2.i [2023-11-22 17:14:37,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26ea1cbb4/fc4a69c916314b709b5c8f54939f0701/FLAG85793450b [2023-11-22 17:14:37,757 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26ea1cbb4/fc4a69c916314b709b5c8f54939f0701 [2023-11-22 17:14:37,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 17:14:37,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 17:14:37,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 17:14:37,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 17:14:37,766 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 17:14:37,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:14:37" (1/1) ... [2023-11-22 17:14:37,767 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d169f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:37, skipping insertion in model container [2023-11-22 17:14:37,767 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:14:37" (1/1) ... [2023-11-22 17:14:37,804 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 17:14:38,037 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 17:14:38,054 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 17:14:38,114 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 17:14:38,142 INFO L206 MainTranslator]: Completed translation [2023-11-22 17:14:38,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:38 WrapperNode [2023-11-22 17:14:38,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 17:14:38,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 17:14:38,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 17:14:38,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 17:14:38,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:38" (1/1) ... [2023-11-22 17:14:38,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:38" (1/1) ... [2023-11-22 17:14:38,190 INFO L138 Inliner]: procedures = 128, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 133 [2023-11-22 17:14:38,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 17:14:38,191 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 17:14:38,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 17:14:38,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 17:14:38,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:38" (1/1) ... [2023-11-22 17:14:38,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:38" (1/1) ... [2023-11-22 17:14:38,216 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:38" (1/1) ... [2023-11-22 17:14:38,226 INFO L189 HeapSplitter]: Split 17 memory accesses to 2 slices as follows [2, 15] [2023-11-22 17:14:38,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:38" (1/1) ... [2023-11-22 17:14:38,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:38" (1/1) ... [2023-11-22 17:14:38,232 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:38" (1/1) ... [2023-11-22 17:14:38,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:38" (1/1) ... [2023-11-22 17:14:38,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:38" (1/1) ... [2023-11-22 17:14:38,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:38" (1/1) ... [2023-11-22 17:14:38,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 17:14:38,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 17:14:38,246 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 17:14:38,251 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 17:14:38,251 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:38" (1/1) ... [2023-11-22 17:14:38,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 17:14:38,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 17:14:38,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 17:14:38,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 17:14:38,318 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-22 17:14:38,318 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-22 17:14:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-22 17:14:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-22 17:14:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 17:14:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 17:14:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-22 17:14:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-22 17:14:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-22 17:14:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-22 17:14:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 17:14:38,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-22 17:14:38,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-22 17:14:38,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-22 17:14:38,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-22 17:14:38,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 17:14:38,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 17:14:38,456 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 17:14:38,458 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 17:14:38,502 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-22 17:14:38,821 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 17:14:38,866 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 17:14:38,872 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-22 17:14:38,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:14:38 BoogieIcfgContainer [2023-11-22 17:14:38,875 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 17:14:38,884 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 17:14:38,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 17:14:38,887 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 17:14:38,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 05:14:37" (1/3) ... [2023-11-22 17:14:38,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c41cbcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:14:38, skipping insertion in model container [2023-11-22 17:14:38,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:14:38" (2/3) ... [2023-11-22 17:14:38,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c41cbcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:14:38, skipping insertion in model container [2023-11-22 17:14:38,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:14:38" (3/3) ... [2023-11-22 17:14:38,890 INFO L112 eAbstractionObserver]: Analyzing ICFG list-ext_2.i [2023-11-22 17:14:38,902 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 17:14:38,903 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2023-11-22 17:14:38,943 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 17:14:38,948 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@622dd1fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 17:14:38,948 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2023-11-22 17:14:38,952 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 43 states have (on average 2.2790697674418605) internal successors, (98), 83 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:38,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-22 17:14:38,956 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:14:38,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-22 17:14:38,958 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-22 17:14:38,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:14:38,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1906837973, now seen corresponding path program 1 times [2023-11-22 17:14:38,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:14:38,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192632074] [2023-11-22 17:14:38,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:14:38,979 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:14:38,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:14:38,981 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 17:14:39,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-22 17:14:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:14:39,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-22 17:14:39,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:14:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:14:39,091 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:14:39,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:14:39,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192632074] [2023-11-22 17:14:39,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192632074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:14:39,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:14:39,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 17:14:39,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812085291] [2023-11-22 17:14:39,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:14:39,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 17:14:39,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:14:39,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 17:14:39,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 17:14:39,129 INFO L87 Difference]: Start difference. First operand has 85 states, 43 states have (on average 2.2790697674418605) internal successors, (98), 83 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:39,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:14:39,208 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2023-11-22 17:14:39,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 17:14:39,210 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2023-11-22 17:14:39,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:14:39,215 INFO L225 Difference]: With dead ends: 84 [2023-11-22 17:14:39,215 INFO L226 Difference]: Without dead ends: 78 [2023-11-22 17:14:39,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 17:14:39,219 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:14:39,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:14:39,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-22 17:14:39,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-22 17:14:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 40 states have (on average 2.1) internal successors, (84), 77 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2023-11-22 17:14:39,251 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 6 [2023-11-22 17:14:39,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:14:39,251 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2023-11-22 17:14:39,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2023-11-22 17:14:39,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-22 17:14:39,252 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:14:39,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:14:39,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-22 17:14:39,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:14:39,455 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-22 17:14:39,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:14:39,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1016578160, now seen corresponding path program 1 times [2023-11-22 17:14:39,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:14:39,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695454002] [2023-11-22 17:14:39,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:14:39,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:14:39,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:14:39,459 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 17:14:39,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-22 17:14:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:14:39,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 17:14:39,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:14:39,555 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 6 treesize of output 7 [2023-11-22 17:14:39,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:14:39,587 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:14:39,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:14:39,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695454002] [2023-11-22 17:14:39,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695454002] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:14:39,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:14:39,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 17:14:39,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816575025] [2023-11-22 17:14:39,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:14:39,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:14:39,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:14:39,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:14:39,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:14:39,594 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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) [2023-11-22 17:14:39,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:14:39,814 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2023-11-22 17:14:39,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 17:14:39,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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 [2023-11-22 17:14:39,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:14:39,815 INFO L225 Difference]: With dead ends: 98 [2023-11-22 17:14:39,815 INFO L226 Difference]: Without dead ends: 98 [2023-11-22 17:14:39,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:14:39,816 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 145 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 17:14:39,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 44 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 17:14:39,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-22 17:14:39,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 79. [2023-11-22 17:14:39,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 78 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:39,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2023-11-22 17:14:39,823 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 7 [2023-11-22 17:14:39,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:14:39,823 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2023-11-22 17:14:39,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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) [2023-11-22 17:14:39,823 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2023-11-22 17:14:39,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-22 17:14:39,823 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:14:39,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:14:39,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-22 17:14:40,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:14:40,028 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-22 17:14:40,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:14:40,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1016578161, now seen corresponding path program 1 times [2023-11-22 17:14:40,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:14:40,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753141151] [2023-11-22 17:14:40,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:14:40,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:14:40,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:14:40,030 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 17:14:40,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-22 17:14:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:14:40,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 17:14:40,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:14:40,091 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 6 treesize of output 5 [2023-11-22 17:14:40,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:14:40,151 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:14:40,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:14:40,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753141151] [2023-11-22 17:14:40,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753141151] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:14:40,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:14:40,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 17:14:40,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831498487] [2023-11-22 17:14:40,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:14:40,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:14:40,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:14:40,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:14:40,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:14:40,155 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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) [2023-11-22 17:14:40,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:14:40,376 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2023-11-22 17:14:40,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 17:14:40,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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 [2023-11-22 17:14:40,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:14:40,378 INFO L225 Difference]: With dead ends: 109 [2023-11-22 17:14:40,378 INFO L226 Difference]: Without dead ends: 109 [2023-11-22 17:14:40,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:14:40,379 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 149 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 17:14:40,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 52 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 17:14:40,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-22 17:14:40,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 96. [2023-11-22 17:14:40,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.5942028985507246) internal successors, (110), 95 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:40,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2023-11-22 17:14:40,384 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 7 [2023-11-22 17:14:40,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:14:40,384 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2023-11-22 17:14:40,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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) [2023-11-22 17:14:40,385 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2023-11-22 17:14:40,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-22 17:14:40,385 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:14:40,385 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:14:40,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-22 17:14:40,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:14:40,590 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-22 17:14:40,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:14:40,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1591063783, now seen corresponding path program 1 times [2023-11-22 17:14:40,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:14:40,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729422254] [2023-11-22 17:14:40,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:14:40,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:14:40,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:14:40,592 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 17:14:40,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-22 17:14:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:14:40,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-22 17:14:40,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:14:40,644 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 6 treesize of output 7 [2023-11-22 17:14:40,661 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 19 treesize of output 1 [2023-11-22 17:14:40,681 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 23 treesize of output 11 [2023-11-22 17:14:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:14:40,695 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:14:40,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:14:40,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729422254] [2023-11-22 17:14:40,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729422254] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:14:40,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:14:40,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 17:14:40,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471322761] [2023-11-22 17:14:40,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:14:40,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 17:14:40,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:14:40,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 17:14:40,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:14:40,696 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:14:40,987 INFO L93 Difference]: Finished difference Result 129 states and 147 transitions. [2023-11-22 17:14:40,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 17:14:40,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2023-11-22 17:14:40,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:14:40,988 INFO L225 Difference]: With dead ends: 129 [2023-11-22 17:14:40,988 INFO L226 Difference]: Without dead ends: 129 [2023-11-22 17:14:40,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-22 17:14:40,989 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 100 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 17:14:40,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 136 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 17:14:40,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-22 17:14:40,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 93. [2023-11-22 17:14:40,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 92 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2023-11-22 17:14:40,994 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 14 [2023-11-22 17:14:40,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:14:40,994 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2023-11-22 17:14:40,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2023-11-22 17:14:40,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-22 17:14:40,995 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:14:40,995 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:14:40,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-22 17:14:41,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:14:41,197 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-22 17:14:41,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:14:41,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1591063782, now seen corresponding path program 1 times [2023-11-22 17:14:41,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:14:41,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833473741] [2023-11-22 17:14:41,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:14:41,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:14:41,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:14:41,199 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 17:14:41,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-22 17:14:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:14:41,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-22 17:14:41,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:14:41,259 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 6 treesize of output 5 [2023-11-22 17:14:41,280 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 13 treesize of output 9 [2023-11-22 17:14:41,286 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 19 treesize of output 1 [2023-11-22 17:14:41,308 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 21 treesize of output 9 [2023-11-22 17:14:41,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:14:41,330 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:14:41,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:14:41,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833473741] [2023-11-22 17:14:41,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833473741] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:14:41,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:14:41,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 17:14:41,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516914891] [2023-11-22 17:14:41,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:14:41,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 17:14:41,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:14:41,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 17:14:41,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:14:41,332 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:14:41,676 INFO L93 Difference]: Finished difference Result 121 states and 140 transitions. [2023-11-22 17:14:41,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 17:14:41,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2023-11-22 17:14:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:14:41,679 INFO L225 Difference]: With dead ends: 121 [2023-11-22 17:14:41,679 INFO L226 Difference]: Without dead ends: 121 [2023-11-22 17:14:41,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-22 17:14:41,680 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 58 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 17:14:41,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 180 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 17:14:41,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-22 17:14:41,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 69. [2023-11-22 17:14:41,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.490566037735849) internal successors, (79), 68 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:41,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2023-11-22 17:14:41,683 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 14 [2023-11-22 17:14:41,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:14:41,684 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2023-11-22 17:14:41,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:41,684 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2023-11-22 17:14:41,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-22 17:14:41,684 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:14:41,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:14:41,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-22 17:14:41,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:14:41,887 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-22 17:14:41,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:14:41,887 INFO L85 PathProgramCache]: Analyzing trace with hash 469279044, now seen corresponding path program 1 times [2023-11-22 17:14:41,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:14:41,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153645212] [2023-11-22 17:14:41,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:14:41,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:14:41,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:14:41,889 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 17:14:41,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-22 17:14:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:14:41,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-22 17:14:41,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:14:41,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 17:14:42,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-22 17:14:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:14:42,028 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:14:42,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:14:42,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153645212] [2023-11-22 17:14:42,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153645212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:14:42,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:14:42,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 17:14:42,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64849454] [2023-11-22 17:14:42,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:14:42,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 17:14:42,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:14:42,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 17:14:42,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-22 17:14:42,030 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 6 states, 6 states have (on average 2.5) 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) [2023-11-22 17:14:42,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:14:42,258 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2023-11-22 17:14:42,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 17:14:42,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) 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 [2023-11-22 17:14:42,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:14:42,259 INFO L225 Difference]: With dead ends: 122 [2023-11-22 17:14:42,259 INFO L226 Difference]: Without dead ends: 122 [2023-11-22 17:14:42,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-22 17:14:42,261 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 99 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 17:14:42,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 119 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 17:14:42,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-22 17:14:42,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 79. [2023-11-22 17:14:42,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 78 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2023-11-22 17:14:42,265 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 15 [2023-11-22 17:14:42,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:14:42,266 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2023-11-22 17:14:42,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) 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) [2023-11-22 17:14:42,266 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2023-11-22 17:14:42,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-22 17:14:42,266 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:14:42,266 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:14:42,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-22 17:14:42,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:14:42,469 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-22 17:14:42,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:14:42,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1185760, now seen corresponding path program 1 times [2023-11-22 17:14:42,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:14:42,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060252838] [2023-11-22 17:14:42,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:14:42,470 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:14:42,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:14:42,471 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 17:14:42,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-22 17:14:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:14:42,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-22 17:14:42,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:14:42,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 17:14:42,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-22 17:14:42,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:14:42,663 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:14:42,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:14:42,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060252838] [2023-11-22 17:14:42,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060252838] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:14:42,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:14:42,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 17:14:42,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534247762] [2023-11-22 17:14:42,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:14:42,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 17:14:42,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:14:42,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 17:14:42,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-22 17:14:42,665 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:42,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:14:42,891 INFO L93 Difference]: Finished difference Result 121 states and 134 transitions. [2023-11-22 17:14:42,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 17:14:42,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2023-11-22 17:14:42,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:14:42,892 INFO L225 Difference]: With dead ends: 121 [2023-11-22 17:14:42,892 INFO L226 Difference]: Without dead ends: 121 [2023-11-22 17:14:42,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-22 17:14:42,893 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 94 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 17:14:42,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 117 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 17:14:42,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-22 17:14:42,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 81. [2023-11-22 17:14:42,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 80 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:42,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2023-11-22 17:14:42,896 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 17 [2023-11-22 17:14:42,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:14:42,897 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2023-11-22 17:14:42,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:14:42,897 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2023-11-22 17:14:42,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 17:14:42,897 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:14:42,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:14:42,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-22 17:14:43,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:14:43,098 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-22 17:14:43,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:14:43,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1135756757, now seen corresponding path program 1 times [2023-11-22 17:14:43,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:14:43,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896436350] [2023-11-22 17:14:43,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:14:43,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:14:43,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:14:43,100 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 17:14:43,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-22 17:14:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 17:14:43,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-22 17:14:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 17:14:43,187 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-22 17:14:43,187 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-22 17:14:43,188 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (37 of 38 remaining) [2023-11-22 17:14:43,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 38 remaining) [2023-11-22 17:14:43,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 38 remaining) [2023-11-22 17:14:43,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 38 remaining) [2023-11-22 17:14:43,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 38 remaining) [2023-11-22 17:14:43,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 38 remaining) [2023-11-22 17:14:43,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 38 remaining) [2023-11-22 17:14:43,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 38 remaining) [2023-11-22 17:14:43,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 38 remaining) [2023-11-22 17:14:43,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 38 remaining) [2023-11-22 17:14:43,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 38 remaining) [2023-11-22 17:14:43,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 38 remaining) [2023-11-22 17:14:43,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 38 remaining) [2023-11-22 17:14:43,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 38 remaining) [2023-11-22 17:14:43,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 38 remaining) [2023-11-22 17:14:43,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 38 remaining) [2023-11-22 17:14:43,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 38 remaining) [2023-11-22 17:14:43,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 38 remaining) [2023-11-22 17:14:43,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 38 remaining) [2023-11-22 17:14:43,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 38 remaining) [2023-11-22 17:14:43,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 38 remaining) [2023-11-22 17:14:43,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 38 remaining) [2023-11-22 17:14:43,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 38 remaining) [2023-11-22 17:14:43,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 38 remaining) [2023-11-22 17:14:43,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 38 remaining) [2023-11-22 17:14:43,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 38 remaining) [2023-11-22 17:14:43,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 38 remaining) [2023-11-22 17:14:43,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 38 remaining) [2023-11-22 17:14:43,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 38 remaining) [2023-11-22 17:14:43,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 38 remaining) [2023-11-22 17:14:43,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 38 remaining) [2023-11-22 17:14:43,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (6 of 38 remaining) [2023-11-22 17:14:43,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (5 of 38 remaining) [2023-11-22 17:14:43,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE (4 of 38 remaining) [2023-11-22 17:14:43,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE (3 of 38 remaining) [2023-11-22 17:14:43,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (2 of 38 remaining) [2023-11-22 17:14:43,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (1 of 38 remaining) [2023-11-22 17:14:43,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK (0 of 38 remaining) [2023-11-22 17:14:43,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-22 17:14:43,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:14:43,408 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:14:43,411 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 17:14:43,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-22 17:14:43,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short5 could not be translated [2023-11-22 17:14:43,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated [2023-11-22 17:14:43,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-22 17:14:43,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 05:14:43 BoogieIcfgContainer [2023-11-22 17:14:43,427 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 17:14:43,428 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 17:14:43,428 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 17:14:43,428 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 17:14:43,428 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:14:38" (3/4) ... [2023-11-22 17:14:43,430 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-22 17:14:43,431 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 17:14:43,431 INFO L158 Benchmark]: Toolchain (without parser) took 5671.02ms. Allocated memory was 60.8MB in the beginning and 107.0MB in the end (delta: 46.1MB). Free memory was 33.5MB in the beginning and 80.2MB in the end (delta: -46.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 17:14:43,431 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 60.8MB. Free memory was 43.6MB in the beginning and 43.5MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 17:14:43,432 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.35ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 33.3MB in the beginning and 43.1MB in the end (delta: -9.7MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2023-11-22 17:14:43,432 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.82ms. Allocated memory is still 73.4MB. Free memory was 43.1MB in the beginning and 41.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 17:14:43,432 INFO L158 Benchmark]: Boogie Preprocessor took 53.96ms. Allocated memory is still 73.4MB. Free memory was 41.0MB in the beginning and 37.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 17:14:43,432 INFO L158 Benchmark]: RCFGBuilder took 629.05ms. Allocated memory is still 73.4MB. Free memory was 37.9MB in the beginning and 28.7MB in the end (delta: 9.2MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2023-11-22 17:14:43,433 INFO L158 Benchmark]: TraceAbstraction took 4543.45ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 49.7MB in the beginning and 80.2MB in the end (delta: -30.5MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2023-11-22 17:14:43,433 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 107.0MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 17:14:43,434 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.11ms. Allocated memory is still 60.8MB. Free memory was 43.6MB in the beginning and 43.5MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.35ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 33.3MB in the beginning and 43.1MB in the end (delta: -9.7MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.82ms. Allocated memory is still 73.4MB. Free memory was 43.1MB in the beginning and 41.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.96ms. Allocated memory is still 73.4MB. Free memory was 41.0MB in the beginning and 37.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 629.05ms. Allocated memory is still 73.4MB. Free memory was 37.9MB in the beginning and 28.7MB in the end (delta: 9.2MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4543.45ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 49.7MB in the beginning and 80.2MB in the end (delta: -30.5MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 107.0MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - UnprovableResult [Line: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 12. Possible FailurePath: [L533] int i = 0; [L534] int y = 0; [L535] List a = (List) malloc(sizeof(struct node)); [L536] COND FALSE !(a == 0) VAL [a={6:0}, i=0, y=0] [L537] List t; [L538] List p = a; VAL [a={6:0}, i=0, p={6:0}, y=0] [L539] i < 10 && __VERIFIER_nondet_int() [L539] i < 10 && __VERIFIER_nondet_int() VAL [a={6:0}, i=0, p={6:0}, y=0] [L539] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L547] y < 10 && __VERIFIER_nondet_int() [L547] y < 10 && __VERIFIER_nondet_int() VAL [a={6:0}, i=0, p={6:0}, y=0] [L547] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L555] p->h = 3 [L556] p->n = (void*)__VERIFIER_nondet_ulong() [L557] i = 0 [L558] y = 0 [L559] p = a VAL [a={6:0}, i=0, p={6:0}, y=0] [L560] EXPR p->h [L560] COND FALSE !(p->h == 1) [L564] EXPR p->h [L564] COND FALSE !(p->h == 2) [L568] EXPR p->h [L568] COND TRUE p->h != 3 || (i + y) < 20 [L569] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "list-ext_2.c", 3, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 645 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 645 mSDsluCounter, 729 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 389 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 822 IncrementalHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 340 mSDtfsCounter, 822 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=3, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 203 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 411 SizeOfPredicates, 19 NumberOfNonLiveVariables, 404 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 10/10 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-22 17:14:43,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample