./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-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 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:56:53,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:56:53,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:56:53,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:56:53,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:56:53,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:56:53,607 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:56:53,607 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:56:53,608 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:56:53,610 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:56:53,610 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:56:53,610 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:56:53,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:56:53,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:56:53,614 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:56:53,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:56:53,615 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:56:53,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:56:53,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:56:53,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:56:53,616 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:56:53,616 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:56:53,616 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:56:53,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:56:53,617 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:56:53,617 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:56:53,617 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:56:53,617 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:56:53,618 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:56:53,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:56:53,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:56:53,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:56:53,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:56:53,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:56:53,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:56:53,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:56:53,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:56:53,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:56:53,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:56:53,620 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:56:53,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:56:53,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:56:53,621 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 -> 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 [2024-11-19 06:56:53,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:56:53,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:56:53,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:56:53,913 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:56:53,914 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:56:53,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2024-11-19 06:56:55,343 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:56:55,600 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:56:55,601 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2024-11-19 06:56:55,612 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81524ff8b/e2ae0944ad88499285c05de548979018/FLAGcb4037458 [2024-11-19 06:56:55,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81524ff8b/e2ae0944ad88499285c05de548979018 [2024-11-19 06:56:55,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:56:55,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:56:55,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:56:55,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:56:55,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:56:55,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:56:55" (1/1) ... [2024-11-19 06:56:55,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59eb282f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:55, skipping insertion in model container [2024-11-19 06:56:55,938 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:56:55" (1/1) ... [2024-11-19 06:56:55,989 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:56:56,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:56:56,305 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:56:56,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:56:56,377 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:56:56,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:56 WrapperNode [2024-11-19 06:56:56,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:56:56,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:56:56,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:56:56,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:56:56,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:56" (1/1) ... [2024-11-19 06:56:56,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:56" (1/1) ... [2024-11-19 06:56:56,423 INFO L138 Inliner]: procedures = 119, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2024-11-19 06:56:56,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:56:56,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:56:56,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:56:56,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:56:56,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:56" (1/1) ... [2024-11-19 06:56:56,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:56" (1/1) ... [2024-11-19 06:56:56,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:56" (1/1) ... [2024-11-19 06:56:56,473 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2024-11-19 06:56:56,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:56" (1/1) ... [2024-11-19 06:56:56,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:56" (1/1) ... [2024-11-19 06:56:56,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:56" (1/1) ... [2024-11-19 06:56:56,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:56" (1/1) ... [2024-11-19 06:56:56,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:56" (1/1) ... [2024-11-19 06:56:56,498 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:56" (1/1) ... [2024-11-19 06:56:56,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:56:56,501 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:56:56,502 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:56:56,502 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:56:56,502 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:56" (1/1) ... [2024-11-19 06:56:56,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:56:56,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:56:56,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:56:56,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:56:56,594 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-19 06:56:56,595 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-19 06:56:56,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 06:56:56,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 06:56:56,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:56:56,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 06:56:56,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:56:56,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:56:56,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:56:56,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:56:56,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:56:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:56:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:56:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:56:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:56:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:56:56,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:56:56,756 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:56:56,758 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:56:57,171 INFO L? ?]: Removed 101 outVars from TransFormulas that were not future-live. [2024-11-19 06:56:57,172 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:56:57,190 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:56:57,192 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-19 06:56:57,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:56:57 BoogieIcfgContainer [2024-11-19 06:56:57,193 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:56:57,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:56:57,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:56:57,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:56:57,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:56:55" (1/3) ... [2024-11-19 06:56:57,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e9dd318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:56:57, skipping insertion in model container [2024-11-19 06:56:57,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:56" (2/3) ... [2024-11-19 06:56:57,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e9dd318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:56:57, skipping insertion in model container [2024-11-19 06:56:57,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:56:57" (3/3) ... [2024-11-19 06:56:57,204 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-2.i [2024-11-19 06:56:57,222 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:56:57,222 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2024-11-19 06:56:57,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:56:57,282 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1b5e192, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:56:57,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2024-11-19 06:56:57,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 68 states have (on average 2.0588235294117645) internal successors, (140), 121 states have internal predecessors, (140), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:56:57,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 06:56:57,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:57,294 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 06:56:57,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 06:56:57,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:57,303 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-19 06:56:57,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:57,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810192575] [2024-11-19 06:56:57,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:57,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:57,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:57,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:57,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810192575] [2024-11-19 06:56:57,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810192575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:57,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:57,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:56:57,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645908111] [2024-11-19 06:56:57,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:57,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:56:57,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:57,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:56:57,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:56:57,584 INFO L87 Difference]: Start difference. First operand has 126 states, 68 states have (on average 2.0588235294117645) internal successors, (140), 121 states have internal predecessors, (140), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:57,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:57,759 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2024-11-19 06:56:57,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:56:57,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-19 06:56:57,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:57,768 INFO L225 Difference]: With dead ends: 117 [2024-11-19 06:56:57,768 INFO L226 Difference]: Without dead ends: 115 [2024-11-19 06:56:57,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:56:57,773 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 88 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:57,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 79 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:56:57,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-19 06:56:57,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-19 06:56:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 65 states have (on average 1.8615384615384616) internal successors, (121), 113 states have internal predecessors, (121), 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) [2024-11-19 06:56:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2024-11-19 06:56:57,809 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 3 [2024-11-19 06:56:57,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:57,810 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2024-11-19 06:56:57,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:57,810 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2024-11-19 06:56:57,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 06:56:57,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:57,811 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 06:56:57,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:56:57,811 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 06:56:57,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:57,812 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-19 06:56:57,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:57,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267781095] [2024-11-19 06:56:57,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:57,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:57,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:57,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:57,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267781095] [2024-11-19 06:56:57,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267781095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:57,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:57,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:56:57,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868160470] [2024-11-19 06:56:57,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:57,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:56:57,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:57,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:56:57,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:56:57,908 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:58,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:58,054 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2024-11-19 06:56:58,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:56:58,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-19 06:56:58,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:58,056 INFO L225 Difference]: With dead ends: 120 [2024-11-19 06:56:58,057 INFO L226 Difference]: Without dead ends: 120 [2024-11-19 06:56:58,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:56:58,058 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 82 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:58,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 90 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:56:58,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-19 06:56:58,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-19 06:56:58,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 72 states have (on average 1.75) internal successors, (126), 118 states have internal predecessors, (126), 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) [2024-11-19 06:56:58,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2024-11-19 06:56:58,070 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 3 [2024-11-19 06:56:58,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:58,070 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2024-11-19 06:56:58,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:58,070 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2024-11-19 06:56:58,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 06:56:58,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:58,071 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:58,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:56:58,071 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 06:56:58,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:58,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1771462867, now seen corresponding path program 1 times [2024-11-19 06:56:58,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:58,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448743101] [2024-11-19 06:56:58,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:58,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:58,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:58,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448743101] [2024-11-19 06:56:58,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448743101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:58,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:58,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:56:58,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138181951] [2024-11-19 06:56:58,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:58,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:56:58,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:58,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:56:58,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:56:58,282 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:58,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:58,466 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2024-11-19 06:56:58,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:58,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 06:56:58,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:58,468 INFO L225 Difference]: With dead ends: 112 [2024-11-19 06:56:58,468 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 06:56:58,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:58,469 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 112 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:58,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 65 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:56:58,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 06:56:58,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-19 06:56:58,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 75 states have (on average 1.6133333333333333) internal successors, (121), 110 states have internal predecessors, (121), 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) [2024-11-19 06:56:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2024-11-19 06:56:58,484 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 8 [2024-11-19 06:56:58,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:58,484 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2024-11-19 06:56:58,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2024-11-19 06:56:58,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 06:56:58,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:58,485 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:58,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:56:58,486 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 06:56:58,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:58,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1771462866, now seen corresponding path program 1 times [2024-11-19 06:56:58,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:58,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191555366] [2024-11-19 06:56:58,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:58,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:58,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:58,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:58,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191555366] [2024-11-19 06:56:58,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191555366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:58,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:58,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:56:58,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033747876] [2024-11-19 06:56:58,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:58,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:56:58,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:58,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:56:58,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:56:58,750 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:59,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:59,025 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2024-11-19 06:56:59,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:56:59,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 06:56:59,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:59,027 INFO L225 Difference]: With dead ends: 124 [2024-11-19 06:56:59,027 INFO L226 Difference]: Without dead ends: 124 [2024-11-19 06:56:59,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:56:59,028 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 104 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:59,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 131 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:56:59,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-19 06:56:59,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2024-11-19 06:56:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.5465116279069768) internal successors, (133), 120 states have internal predecessors, (133), 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) [2024-11-19 06:56:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2024-11-19 06:56:59,034 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 8 [2024-11-19 06:56:59,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:59,035 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2024-11-19 06:56:59,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2024-11-19 06:56:59,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:56:59,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:59,035 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:59,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:56:59,036 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 06:56:59,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:59,036 INFO L85 PathProgramCache]: Analyzing trace with hash -67468603, now seen corresponding path program 1 times [2024-11-19 06:56:59,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:59,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619141005] [2024-11-19 06:56:59,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:59,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:59,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:59,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:59,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619141005] [2024-11-19 06:56:59,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619141005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:59,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:59,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:56:59,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752983448] [2024-11-19 06:56:59,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:59,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:56:59,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:59,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:56:59,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:56:59,087 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:59,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:59,194 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2024-11-19 06:56:59,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:56:59,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-19 06:56:59,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:59,195 INFO L225 Difference]: With dead ends: 127 [2024-11-19 06:56:59,195 INFO L226 Difference]: Without dead ends: 127 [2024-11-19 06:56:59,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:59,197 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 105 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:59,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 139 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:56:59,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-19 06:56:59,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2024-11-19 06:56:59,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 86 states have (on average 1.5116279069767442) internal successors, (130), 119 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:59,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2024-11-19 06:56:59,203 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 12 [2024-11-19 06:56:59,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:59,204 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2024-11-19 06:56:59,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:59,204 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2024-11-19 06:56:59,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:56:59,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:59,205 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:59,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:56:59,205 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 06:56:59,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:59,205 INFO L85 PathProgramCache]: Analyzing trace with hash -50514577, now seen corresponding path program 1 times [2024-11-19 06:56:59,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:59,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666360577] [2024-11-19 06:56:59,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:59,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:59,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:59,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666360577] [2024-11-19 06:56:59,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666360577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:59,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:59,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:56:59,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855475566] [2024-11-19 06:56:59,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:59,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:56:59,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:59,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:56:59,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:56:59,341 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:59,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:59,536 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2024-11-19 06:56:59,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:56:59,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2024-11-19 06:56:59,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:59,538 INFO L225 Difference]: With dead ends: 121 [2024-11-19 06:56:59,538 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 06:56:59,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:56:59,539 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 28 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:59,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 244 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:56:59,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 06:56:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-19 06:56:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 86 states have (on average 1.5) internal successors, (129), 118 states have internal predecessors, (129), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2024-11-19 06:56:59,552 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 12 [2024-11-19 06:56:59,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:59,552 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2024-11-19 06:56:59,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2024-11-19 06:56:59,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:56:59,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:59,554 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:59,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:56:59,555 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 06:56:59,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:59,555 INFO L85 PathProgramCache]: Analyzing trace with hash -50514576, now seen corresponding path program 1 times [2024-11-19 06:56:59,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:59,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218698655] [2024-11-19 06:56:59,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:59,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:59,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:59,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218698655] [2024-11-19 06:56:59,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218698655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:59,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:59,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:56:59,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098930542] [2024-11-19 06:56:59,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:59,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:56:59,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:59,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:56:59,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:56:59,753 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:59,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:59,939 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2024-11-19 06:56:59,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:56:59,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2024-11-19 06:56:59,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:59,940 INFO L225 Difference]: With dead ends: 121 [2024-11-19 06:56:59,940 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 06:56:59,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:56:59,943 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 13 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:59,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 286 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:56:59,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 06:56:59,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2024-11-19 06:56:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 86 states have (on average 1.441860465116279) internal successors, (124), 113 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2024-11-19 06:56:59,950 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 12 [2024-11-19 06:56:59,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:59,950 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2024-11-19 06:56:59,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2024-11-19 06:56:59,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 06:56:59,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:59,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:59,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:56:59,951 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 06:56:59,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:59,951 INFO L85 PathProgramCache]: Analyzing trace with hash -57269445, now seen corresponding path program 1 times [2024-11-19 06:56:59,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:59,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456878576] [2024-11-19 06:56:59,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:59,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:57:00,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:57:00,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:57:00,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456878576] [2024-11-19 06:57:00,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456878576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:57:00,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:57:00,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:57:00,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231097513] [2024-11-19 06:57:00,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:57:00,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:57:00,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:57:00,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:57:00,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:57:00,083 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:00,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:57:00,246 INFO L93 Difference]: Finished difference Result 164 states and 183 transitions. [2024-11-19 06:57:00,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:57:00,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 06:57:00,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:57:00,248 INFO L225 Difference]: With dead ends: 164 [2024-11-19 06:57:00,248 INFO L226 Difference]: Without dead ends: 164 [2024-11-19 06:57:00,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:57:00,249 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 178 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:57:00,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 256 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:57:00,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-19 06:57:00,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 122. [2024-11-19 06:57:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 120 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:00,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2024-11-19 06:57:00,260 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 15 [2024-11-19 06:57:00,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:57:00,261 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2024-11-19 06:57:00,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:00,261 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2024-11-19 06:57:00,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 06:57:00,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:57:00,262 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:57:00,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:57:00,262 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 06:57:00,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:57:00,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1974458520, now seen corresponding path program 1 times [2024-11-19 06:57:00,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:57:00,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288364919] [2024-11-19 06:57:00,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:57:00,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:57:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:57:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:57:00,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:57:00,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288364919] [2024-11-19 06:57:00,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288364919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:57:00,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:57:00,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:57:00,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667571890] [2024-11-19 06:57:00,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:57:00,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:57:00,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:57:00,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:57:00,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:57:00,323 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:00,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:57:00,443 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2024-11-19 06:57:00,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:57:00,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2024-11-19 06:57:00,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:57:00,444 INFO L225 Difference]: With dead ends: 125 [2024-11-19 06:57:00,444 INFO L226 Difference]: Without dead ends: 125 [2024-11-19 06:57:00,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:57:00,445 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 10 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:57:00,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 272 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:57:00,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-19 06:57:00,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2024-11-19 06:57:00,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 119 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:00,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2024-11-19 06:57:00,450 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 19 [2024-11-19 06:57:00,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:57:00,450 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2024-11-19 06:57:00,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:00,450 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2024-11-19 06:57:00,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 06:57:00,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:57:00,451 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:57:00,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:57:00,452 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 06:57:00,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:57:00,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1219739801, now seen corresponding path program 1 times [2024-11-19 06:57:00,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:57:00,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776990439] [2024-11-19 06:57:00,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:57:00,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:57:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:57:00,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 06:57:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:57:00,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 06:57:00,501 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 06:57:00,503 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2024-11-19 06:57:00,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2024-11-19 06:57:00,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2024-11-19 06:57:00,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2024-11-19 06:57:00,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2024-11-19 06:57:00,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2024-11-19 06:57:00,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2024-11-19 06:57:00,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2024-11-19 06:57:00,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2024-11-19 06:57:00,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2024-11-19 06:57:00,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2024-11-19 06:57:00,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2024-11-19 06:57:00,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2024-11-19 06:57:00,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2024-11-19 06:57:00,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2024-11-19 06:57:00,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2024-11-19 06:57:00,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2024-11-19 06:57:00,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2024-11-19 06:57:00,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2024-11-19 06:57:00,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2024-11-19 06:57:00,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2024-11-19 06:57:00,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2024-11-19 06:57:00,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2024-11-19 06:57:00,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2024-11-19 06:57:00,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2024-11-19 06:57:00,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2024-11-19 06:57:00,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2024-11-19 06:57:00,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2024-11-19 06:57:00,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2024-11-19 06:57:00,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2024-11-19 06:57:00,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2024-11-19 06:57:00,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 53 remaining) [2024-11-19 06:57:00,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 53 remaining) [2024-11-19 06:57:00,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 53 remaining) [2024-11-19 06:57:00,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 53 remaining) [2024-11-19 06:57:00,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2024-11-19 06:57:00,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2024-11-19 06:57:00,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2024-11-19 06:57:00,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2024-11-19 06:57:00,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE (13 of 53 remaining) [2024-11-19 06:57:00,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (12 of 53 remaining) [2024-11-19 06:57:00,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (11 of 53 remaining) [2024-11-19 06:57:00,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2024-11-19 06:57:00,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2024-11-19 06:57:00,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (8 of 53 remaining) [2024-11-19 06:57:00,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE (7 of 53 remaining) [2024-11-19 06:57:00,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE (6 of 53 remaining) [2024-11-19 06:57:00,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2024-11-19 06:57:00,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2024-11-19 06:57:00,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (3 of 53 remaining) [2024-11-19 06:57:00,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE (2 of 53 remaining) [2024-11-19 06:57:00,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE (1 of 53 remaining) [2024-11-19 06:57:00,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK (0 of 53 remaining) [2024-11-19 06:57:00,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:57:00,517 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:57:00,536 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 06:57:00,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:57:00 BoogieIcfgContainer [2024-11-19 06:57:00,538 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 06:57:00,539 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 06:57:00,539 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 06:57:00,539 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 06:57:00,540 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:56:57" (3/4) ... [2024-11-19 06:57:00,542 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 06:57:00,543 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 06:57:00,544 INFO L158 Benchmark]: Toolchain (without parser) took 4618.01ms. Allocated memory was 151.0MB in the beginning and 209.7MB in the end (delta: 58.7MB). Free memory was 94.7MB in the beginning and 111.0MB in the end (delta: -16.2MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2024-11-19 06:57:00,544 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 151.0MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:57:00,544 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.69ms. Allocated memory is still 151.0MB. Free memory was 94.7MB in the beginning and 74.1MB in the end (delta: 20.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 06:57:00,545 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.98ms. Allocated memory is still 151.0MB. Free memory was 74.1MB in the beginning and 72.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:57:00,545 INFO L158 Benchmark]: Boogie Preprocessor took 76.99ms. Allocated memory was 151.0MB in the beginning and 209.7MB in the end (delta: 58.7MB). Free memory was 72.0MB in the beginning and 180.6MB in the end (delta: -108.6MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2024-11-19 06:57:00,545 INFO L158 Benchmark]: RCFGBuilder took 691.41ms. Allocated memory is still 209.7MB. Free memory was 180.6MB in the beginning and 154.4MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-19 06:57:00,545 INFO L158 Benchmark]: TraceAbstraction took 3342.27ms. Allocated memory is still 209.7MB. Free memory was 154.4MB in the beginning and 112.0MB in the end (delta: 42.3MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2024-11-19 06:57:00,546 INFO L158 Benchmark]: Witness Printer took 4.51ms. Allocated memory is still 209.7MB. Free memory was 112.0MB in the beginning and 111.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:57:00,547 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.25ms. Allocated memory is still 151.0MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 450.69ms. Allocated memory is still 151.0MB. Free memory was 94.7MB in the beginning and 74.1MB in the end (delta: 20.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.98ms. Allocated memory is still 151.0MB. Free memory was 74.1MB in the beginning and 72.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.99ms. Allocated memory was 151.0MB in the beginning and 209.7MB in the end (delta: 58.7MB). Free memory was 72.0MB in the beginning and 180.6MB in the end (delta: -108.6MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * RCFGBuilder took 691.41ms. Allocated memory is still 209.7MB. Free memory was 180.6MB in the beginning and 154.4MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3342.27ms. Allocated memory is still 209.7MB. Free memory was 154.4MB in the beginning and 112.0MB in the end (delta: 42.3MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. * Witness Printer took 4.51ms. Allocated memory is still 209.7MB. Free memory was 112.0MB in the beginning and 111.0MB 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.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: 993]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 993. Possible FailurePath: [L1006] SLL* list = malloc(sizeof(SLL)); [L1007] list->next = ((void*)0) [L1008] list->colour = BLACK [L1010] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1034] end = ((void*)0) [L1035] end = list VAL [end={-1:0}, list={-1:0}] [L1038] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1039] EXPR end->colour [L1039] COND FALSE !(!(BLACK == end->colour)) [L1041] COND TRUE ((void*)0) != end VAL [end={-1:0}, list={-1:0}] [L1043] EXPR end->colour [L1043] COND FALSE !(RED == end->colour) [L1049] EXPR end->next [L1049] COND TRUE !(end->next) [L1049] CALL reach_error() [L993] COND FALSE !(0) [L993] __assert_fail ("0", "sll-rb-cnstr_1-2.c", 13, __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: -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: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free 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: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free 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: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: 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, 126 locations, 53 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 720 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 720 mSDsluCounter, 1562 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 893 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1379 IncrementalHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 669 mSDtfsCounter, 1379 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=0, InterpolantAutomatonStates: 46, 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, 9 MinimizatonAttempts, 61 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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 [2024-11-19 06:57:00,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-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 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:57:02,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:57:02,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 06:57:02,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:57:02,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:57:02,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:57:02,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:57:02,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:57:02,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:57:02,873 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:57:02,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:57:02,874 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:57:02,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:57:02,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:57:02,877 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:57:02,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:57:02,878 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:57:02,878 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:57:02,878 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:57:02,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:57:02,879 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:57:02,883 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:57:02,883 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:57:02,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:57:02,883 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:57:02,884 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:57:02,884 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:57:02,884 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:57:02,884 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:57:02,884 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:57:02,885 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:57:02,885 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:57:02,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:57:02,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:57:02,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:57:02,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:57:02,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:57:02,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:57:02,893 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:57:02,894 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:57:02,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:57:02,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:57:02,896 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:57:02,896 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:57:02,896 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 -> 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 [2024-11-19 06:57:03,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:57:03,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:57:03,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:57:03,262 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:57:03,263 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:57:03,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2024-11-19 06:57:04,853 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:57:05,131 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:57:05,131 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2024-11-19 06:57:05,153 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fec822cf4/5825adfbcee94da7be6091887c7ead16/FLAG6bc8de76d [2024-11-19 06:57:05,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fec822cf4/5825adfbcee94da7be6091887c7ead16 [2024-11-19 06:57:05,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:57:05,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:57:05,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:57:05,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:57:05,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:57:05,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:57:05" (1/1) ... [2024-11-19 06:57:05,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f8a8a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:05, skipping insertion in model container [2024-11-19 06:57:05,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:57:05" (1/1) ... [2024-11-19 06:57:05,233 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:57:05,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:57:05,613 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:57:05,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:57:05,699 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:57:05,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:05 WrapperNode [2024-11-19 06:57:05,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:57:05,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:57:05,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:57:05,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:57:05,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:05" (1/1) ... [2024-11-19 06:57:05,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:05" (1/1) ... [2024-11-19 06:57:05,761 INFO L138 Inliner]: procedures = 122, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2024-11-19 06:57:05,763 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:57:05,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:57:05,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:57:05,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:57:05,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:05" (1/1) ... [2024-11-19 06:57:05,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:05" (1/1) ... [2024-11-19 06:57:05,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:05" (1/1) ... [2024-11-19 06:57:05,814 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2024-11-19 06:57:05,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:05" (1/1) ... [2024-11-19 06:57:05,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:05" (1/1) ... [2024-11-19 06:57:05,828 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:05" (1/1) ... [2024-11-19 06:57:05,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:05" (1/1) ... [2024-11-19 06:57:05,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:05" (1/1) ... [2024-11-19 06:57:05,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:05" (1/1) ... [2024-11-19 06:57:05,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:57:05,855 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:57:05,855 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:57:05,855 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:57:05,856 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:05" (1/1) ... [2024-11-19 06:57:05,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:57:05,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:57:05,898 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:57:05,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:57:05,945 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-19 06:57:05,946 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-19 06:57:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 06:57:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 06:57:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:57:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:57:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:57:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:57:05,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:57:05,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:57:05,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:57:05,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 06:57:05,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 06:57:05,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 06:57:05,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 06:57:05,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:57:05,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:57:06,109 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:57:06,112 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:57:06,668 INFO L? ?]: Removed 101 outVars from TransFormulas that were not future-live. [2024-11-19 06:57:06,669 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:57:06,683 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:57:06,683 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-19 06:57:06,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:57:06 BoogieIcfgContainer [2024-11-19 06:57:06,684 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:57:06,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:57:06,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:57:06,689 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:57:06,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:57:05" (1/3) ... [2024-11-19 06:57:06,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b30a9e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:57:06, skipping insertion in model container [2024-11-19 06:57:06,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:05" (2/3) ... [2024-11-19 06:57:06,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b30a9e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:57:06, skipping insertion in model container [2024-11-19 06:57:06,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:57:06" (3/3) ... [2024-11-19 06:57:06,691 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-2.i [2024-11-19 06:57:06,707 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:57:06,707 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2024-11-19 06:57:06,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:57:06,761 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6da393b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:57:06,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2024-11-19 06:57:06,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 68 states have (on average 2.0588235294117645) internal successors, (140), 121 states have internal predecessors, (140), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:57:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 06:57:06,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:57:06,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 06:57:06,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 06:57:06,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:57:06,781 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-19 06:57:06,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:57:06,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763660844] [2024-11-19 06:57:06,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:57:06,795 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 [2024-11-19 06:57:06,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:57:06,799 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) [2024-11-19 06:57:06,800 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 [2024-11-19 06:57:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:57:06,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:57:06,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:57:06,979 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 [2024-11-19 06:57:06,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:57:06,993 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:57:06,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:57:06,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763660844] [2024-11-19 06:57:06,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763660844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:57:06,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:57:06,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:57:06,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021985156] [2024-11-19 06:57:06,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:57:07,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:57:07,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:57:07,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:57:07,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:57:07,035 INFO L87 Difference]: Start difference. First operand has 126 states, 68 states have (on average 2.0588235294117645) internal successors, (140), 121 states have internal predecessors, (140), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:07,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:57:07,297 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2024-11-19 06:57:07,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:57:07,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-19 06:57:07,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:57:07,308 INFO L225 Difference]: With dead ends: 117 [2024-11-19 06:57:07,309 INFO L226 Difference]: Without dead ends: 115 [2024-11-19 06:57:07,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:57:07,314 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 88 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:57:07,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 79 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:57:07,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-19 06:57:07,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-19 06:57:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 65 states have (on average 1.8615384615384616) internal successors, (121), 113 states have internal predecessors, (121), 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) [2024-11-19 06:57:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2024-11-19 06:57:07,355 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 3 [2024-11-19 06:57:07,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:57:07,355 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2024-11-19 06:57:07,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2024-11-19 06:57:07,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 06:57:07,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:57:07,356 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 06:57:07,359 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 (2)] Forceful destruction successful, exit code 0 [2024-11-19 06:57:07,557 WARN L453 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 [2024-11-19 06:57:07,557 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 06:57:07,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:57:07,558 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-19 06:57:07,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:57:07,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010533371] [2024-11-19 06:57:07,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:57:07,559 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 [2024-11-19 06:57:07,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:57:07,561 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) [2024-11-19 06:57:07,563 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 [2024-11-19 06:57:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:57:07,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:57:07,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:57:07,617 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 [2024-11-19 06:57:07,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:57:07,630 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:57:07,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:57:07,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010533371] [2024-11-19 06:57:07,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010533371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:57:07,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:57:07,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:57:07,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404737286] [2024-11-19 06:57:07,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:57:07,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:57:07,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:57:07,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:57:07,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:57:07,634 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:07,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:57:07,913 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2024-11-19 06:57:07,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:57:07,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-19 06:57:07,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:57:07,916 INFO L225 Difference]: With dead ends: 120 [2024-11-19 06:57:07,916 INFO L226 Difference]: Without dead ends: 120 [2024-11-19 06:57:07,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:57:07,917 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 82 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:57:07,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 90 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:57:07,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-19 06:57:07,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-19 06:57:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 72 states have (on average 1.75) internal successors, (126), 118 states have internal predecessors, (126), 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) [2024-11-19 06:57:07,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2024-11-19 06:57:07,933 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 3 [2024-11-19 06:57:07,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:57:07,933 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2024-11-19 06:57:07,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:07,934 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2024-11-19 06:57:07,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 06:57:07,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:57:07,934 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:57:07,938 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 (3)] Ended with exit code 0 [2024-11-19 06:57:08,135 WARN L453 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 [2024-11-19 06:57:08,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 06:57:08,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:57:08,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1771462867, now seen corresponding path program 1 times [2024-11-19 06:57:08,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:57:08,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960386208] [2024-11-19 06:57:08,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:57:08,138 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 [2024-11-19 06:57:08,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:57:08,141 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) [2024-11-19 06:57:08,143 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 [2024-11-19 06:57:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:57:08,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:57:08,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:57:08,212 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 [2024-11-19 06:57:08,261 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 06:57:08,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-19 06:57:08,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:57:08,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:57:08,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:57:08,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960386208] [2024-11-19 06:57:08,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960386208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:57:08,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:57:08,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:57:08,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586737752] [2024-11-19 06:57:08,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:57:08,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:57:08,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:57:08,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:57:08,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:57:08,282 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:08,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:57:08,603 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2024-11-19 06:57:08,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:57:08,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 06:57:08,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:57:08,606 INFO L225 Difference]: With dead ends: 112 [2024-11-19 06:57:08,607 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 06:57:08,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:57:08,609 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 112 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:57:08,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 65 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:57:08,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 06:57:08,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-19 06:57:08,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 75 states have (on average 1.6133333333333333) internal successors, (121), 110 states have internal predecessors, (121), 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) [2024-11-19 06:57:08,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2024-11-19 06:57:08,624 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 8 [2024-11-19 06:57:08,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:57:08,625 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2024-11-19 06:57:08,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:08,625 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2024-11-19 06:57:08,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 06:57:08,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:57:08,625 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:57:08,630 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 (4)] Ended with exit code 0 [2024-11-19 06:57:08,827 WARN L453 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 [2024-11-19 06:57:08,828 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 06:57:08,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:57:08,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1771462866, now seen corresponding path program 1 times [2024-11-19 06:57:08,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:57:08,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248239776] [2024-11-19 06:57:08,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:57:08,829 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 [2024-11-19 06:57:08,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:57:08,833 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) [2024-11-19 06:57:08,834 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 [2024-11-19 06:57:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:57:08,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 06:57:08,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:57:08,905 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 [2024-11-19 06:57:08,972 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 06:57:08,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-19 06:57:08,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:57:08,988 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:57:08,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:57:08,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248239776] [2024-11-19 06:57:08,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248239776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:57:08,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:57:08,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:57:08,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075877870] [2024-11-19 06:57:08,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:57:08,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:57:08,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:57:08,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:57:08,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:57:08,991 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:57:09,347 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2024-11-19 06:57:09,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:57:09,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 06:57:09,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:57:09,348 INFO L225 Difference]: With dead ends: 124 [2024-11-19 06:57:09,348 INFO L226 Difference]: Without dead ends: 124 [2024-11-19 06:57:09,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:57:09,349 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 104 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:57:09,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 101 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:57:09,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-19 06:57:09,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2024-11-19 06:57:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.5465116279069768) internal successors, (133), 120 states have internal predecessors, (133), 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) [2024-11-19 06:57:09,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2024-11-19 06:57:09,358 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 8 [2024-11-19 06:57:09,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:57:09,358 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2024-11-19 06:57:09,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:09,359 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2024-11-19 06:57:09,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:57:09,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:57:09,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:57:09,366 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 [2024-11-19 06:57:09,562 WARN L453 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 [2024-11-19 06:57:09,563 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 06:57:09,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:57:09,563 INFO L85 PathProgramCache]: Analyzing trace with hash -67468603, now seen corresponding path program 1 times [2024-11-19 06:57:09,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:57:09,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615130993] [2024-11-19 06:57:09,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:57:09,564 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 [2024-11-19 06:57:09,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:57:09,570 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) [2024-11-19 06:57:09,572 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 [2024-11-19 06:57:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:57:09,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:57:09,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:57:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:57:09,647 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:57:09,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:57:09,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615130993] [2024-11-19 06:57:09,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615130993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:57:09,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:57:09,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:57:09,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102602323] [2024-11-19 06:57:09,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:57:09,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:57:09,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:57:09,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:57:09,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:57:09,649 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:57:09,880 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2024-11-19 06:57:09,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:57:09,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-19 06:57:09,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:57:09,882 INFO L225 Difference]: With dead ends: 127 [2024-11-19 06:57:09,882 INFO L226 Difference]: Without dead ends: 127 [2024-11-19 06:57:09,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:57:09,883 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 105 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:57:09,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 139 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:57:09,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-19 06:57:09,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2024-11-19 06:57:09,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 86 states have (on average 1.5116279069767442) internal successors, (130), 119 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:09,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2024-11-19 06:57:09,892 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 12 [2024-11-19 06:57:09,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:57:09,892 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2024-11-19 06:57:09,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:09,893 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2024-11-19 06:57:09,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:57:09,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:57:09,893 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:57:09,898 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 (6)] Ended with exit code 0 [2024-11-19 06:57:10,096 WARN L453 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 [2024-11-19 06:57:10,097 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 06:57:10,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:57:10,097 INFO L85 PathProgramCache]: Analyzing trace with hash -50514577, now seen corresponding path program 1 times [2024-11-19 06:57:10,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:57:10,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184450822] [2024-11-19 06:57:10,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:57:10,098 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 [2024-11-19 06:57:10,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:57:10,101 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) [2024-11-19 06:57:10,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 (7)] Waiting until timeout for monitored process [2024-11-19 06:57:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:57:10,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:57:10,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:57:10,177 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 [2024-11-19 06:57:10,201 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 15 treesize of output 1 [2024-11-19 06:57:10,221 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 19 treesize of output 11 [2024-11-19 06:57:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:57:10,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:57:10,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:57:10,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184450822] [2024-11-19 06:57:10,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184450822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:57:10,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:57:10,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:57:10,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479226745] [2024-11-19 06:57:10,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:57:10,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:57:10,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:57:10,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:57:10,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:57:10,244 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:10,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:57:10,640 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2024-11-19 06:57:10,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:57:10,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2024-11-19 06:57:10,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:57:10,641 INFO L225 Difference]: With dead ends: 121 [2024-11-19 06:57:10,641 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 06:57:10,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:57:10,642 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 28 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:57:10,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 244 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:57:10,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 06:57:10,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-19 06:57:10,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 86 states have (on average 1.5) internal successors, (129), 118 states have internal predecessors, (129), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2024-11-19 06:57:10,648 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 12 [2024-11-19 06:57:10,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:57:10,648 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2024-11-19 06:57:10,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2024-11-19 06:57:10,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:57:10,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:57:10,649 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:57:10,653 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 (7)] Ended with exit code 0 [2024-11-19 06:57:10,849 WARN L453 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 [2024-11-19 06:57:10,850 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 06:57:10,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:57:10,850 INFO L85 PathProgramCache]: Analyzing trace with hash -50514576, now seen corresponding path program 1 times [2024-11-19 06:57:10,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:57:10,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681183924] [2024-11-19 06:57:10,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:57:10,851 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 [2024-11-19 06:57:10,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:57:10,854 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) [2024-11-19 06:57:10,855 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 [2024-11-19 06:57:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:57:10,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:57:10,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:57:10,925 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 [2024-11-19 06:57:10,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:57:10,955 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 15 treesize of output 1 [2024-11-19 06:57:11,003 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 17 treesize of output 9 [2024-11-19 06:57:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:57:11,042 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:57:11,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:57:11,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681183924] [2024-11-19 06:57:11,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681183924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:57:11,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:57:11,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:57:11,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67107340] [2024-11-19 06:57:11,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:57:11,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:57:11,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:57:11,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:57:11,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:57:11,045 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:11,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:57:11,420 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2024-11-19 06:57:11,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:57:11,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2024-11-19 06:57:11,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:57:11,422 INFO L225 Difference]: With dead ends: 121 [2024-11-19 06:57:11,422 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 06:57:11,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:57:11,423 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 13 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:57:11,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 286 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:57:11,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 06:57:11,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2024-11-19 06:57:11,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 86 states have (on average 1.441860465116279) internal successors, (124), 113 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:11,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2024-11-19 06:57:11,433 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 12 [2024-11-19 06:57:11,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:57:11,434 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2024-11-19 06:57:11,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:11,434 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2024-11-19 06:57:11,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 06:57:11,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:57:11,434 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:57:11,439 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 (8)] Ended with exit code 0 [2024-11-19 06:57:11,635 WARN L453 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 [2024-11-19 06:57:11,635 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 06:57:11,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:57:11,636 INFO L85 PathProgramCache]: Analyzing trace with hash -57269445, now seen corresponding path program 1 times [2024-11-19 06:57:11,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:57:11,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040631695] [2024-11-19 06:57:11,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:57:11,636 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 [2024-11-19 06:57:11,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:57:11,638 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) [2024-11-19 06:57:11,640 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 [2024-11-19 06:57:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:57:11,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:57:11,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:57:11,699 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 [2024-11-19 06:57:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:57:11,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:57:11,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:57:11,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040631695] [2024-11-19 06:57:11,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040631695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:57:11,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:57:11,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:57:11,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351503666] [2024-11-19 06:57:11,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:57:11,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:57:11,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:57:11,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:57:11,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:57:11,750 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:11,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:57:11,994 INFO L93 Difference]: Finished difference Result 164 states and 183 transitions. [2024-11-19 06:57:11,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:57:11,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 06:57:11,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:57:11,996 INFO L225 Difference]: With dead ends: 164 [2024-11-19 06:57:11,996 INFO L226 Difference]: Without dead ends: 164 [2024-11-19 06:57:11,998 INFO L431 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 [2024-11-19 06:57:11,998 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 66 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:57:11,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 249 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:57:11,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-19 06:57:12,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 122. [2024-11-19 06:57:12,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 120 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:12,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2024-11-19 06:57:12,008 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 15 [2024-11-19 06:57:12,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:57:12,008 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2024-11-19 06:57:12,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:12,009 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2024-11-19 06:57:12,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 06:57:12,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:57:12,009 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:57:12,017 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 (9)] Ended with exit code 0 [2024-11-19 06:57:12,210 WARN L453 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 [2024-11-19 06:57:12,210 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 06:57:12,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:57:12,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1974458520, now seen corresponding path program 1 times [2024-11-19 06:57:12,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:57:12,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087727543] [2024-11-19 06:57:12,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:57:12,211 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 [2024-11-19 06:57:12,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:57:12,212 INFO L229 MonitoredProcess]: Starting monitored process 10 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) [2024-11-19 06:57:12,213 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 (10)] Waiting until timeout for monitored process [2024-11-19 06:57:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:57:12,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:57:12,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:57:12,276 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 [2024-11-19 06:57:12,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:57:12,335 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:57:12,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:57:12,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087727543] [2024-11-19 06:57:12,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087727543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:57:12,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:57:12,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:57:12,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419325592] [2024-11-19 06:57:12,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:57:12,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:57:12,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:57:12,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:57:12,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:57:12,338 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:12,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:57:12,615 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2024-11-19 06:57:12,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:57:12,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2024-11-19 06:57:12,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:57:12,617 INFO L225 Difference]: With dead ends: 163 [2024-11-19 06:57:12,617 INFO L226 Difference]: Without dead ends: 163 [2024-11-19 06:57:12,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:57:12,617 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 59 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:57:12,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 251 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:57:12,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-19 06:57:12,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 126. [2024-11-19 06:57:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 97 states have (on average 1.402061855670103) internal successors, (136), 124 states have internal predecessors, (136), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:12,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2024-11-19 06:57:12,624 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 19 [2024-11-19 06:57:12,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:57:12,624 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2024-11-19 06:57:12,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:57:12,624 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2024-11-19 06:57:12,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 06:57:12,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:57:12,625 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:57:12,632 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 (10)] Ended with exit code 0 [2024-11-19 06:57:12,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 [2024-11-19 06:57:12,825 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 06:57:12,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:57:12,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1219739801, now seen corresponding path program 1 times [2024-11-19 06:57:12,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:57:12,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424788665] [2024-11-19 06:57:12,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:57:12,826 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 [2024-11-19 06:57:12,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:57:12,829 INFO L229 MonitoredProcess]: Starting monitored process 11 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) [2024-11-19 06:57:12,831 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 (11)] Waiting until timeout for monitored process [2024-11-19 06:57:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:57:12,883 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 06:57:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:57:12,932 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 06:57:12,932 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 06:57:12,933 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2024-11-19 06:57:12,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2024-11-19 06:57:12,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2024-11-19 06:57:12,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2024-11-19 06:57:12,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2024-11-19 06:57:12,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2024-11-19 06:57:12,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2024-11-19 06:57:12,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2024-11-19 06:57:12,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2024-11-19 06:57:12,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2024-11-19 06:57:12,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2024-11-19 06:57:12,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2024-11-19 06:57:12,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2024-11-19 06:57:12,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2024-11-19 06:57:12,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2024-11-19 06:57:12,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2024-11-19 06:57:12,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2024-11-19 06:57:12,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2024-11-19 06:57:12,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2024-11-19 06:57:12,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2024-11-19 06:57:12,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2024-11-19 06:57:12,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2024-11-19 06:57:12,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2024-11-19 06:57:12,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2024-11-19 06:57:12,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2024-11-19 06:57:12,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2024-11-19 06:57:12,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2024-11-19 06:57:12,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2024-11-19 06:57:12,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2024-11-19 06:57:12,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2024-11-19 06:57:12,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2024-11-19 06:57:12,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 53 remaining) [2024-11-19 06:57:12,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 53 remaining) [2024-11-19 06:57:12,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 53 remaining) [2024-11-19 06:57:12,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 53 remaining) [2024-11-19 06:57:12,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2024-11-19 06:57:12,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2024-11-19 06:57:12,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2024-11-19 06:57:12,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2024-11-19 06:57:12,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE (13 of 53 remaining) [2024-11-19 06:57:12,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (12 of 53 remaining) [2024-11-19 06:57:12,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (11 of 53 remaining) [2024-11-19 06:57:12,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2024-11-19 06:57:12,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2024-11-19 06:57:12,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (8 of 53 remaining) [2024-11-19 06:57:12,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE (7 of 53 remaining) [2024-11-19 06:57:12,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE (6 of 53 remaining) [2024-11-19 06:57:12,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2024-11-19 06:57:12,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2024-11-19 06:57:12,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (3 of 53 remaining) [2024-11-19 06:57:12,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE (2 of 53 remaining) [2024-11-19 06:57:12,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE (1 of 53 remaining) [2024-11-19 06:57:12,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK (0 of 53 remaining) [2024-11-19 06:57:12,950 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 (11)] Ended with exit code 0 [2024-11-19 06:57:13,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 [2024-11-19 06:57:13,145 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:57:13,164 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 06:57:13,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:57:13 BoogieIcfgContainer [2024-11-19 06:57:13,167 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 06:57:13,170 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 06:57:13,170 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 06:57:13,170 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 06:57:13,170 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:57:06" (3/4) ... [2024-11-19 06:57:13,173 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 06:57:13,174 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 06:57:13,175 INFO L158 Benchmark]: Toolchain (without parser) took 7999.11ms. Allocated memory was 58.7MB in the beginning and 81.8MB in the end (delta: 23.1MB). Free memory was 33.9MB in the beginning and 41.9MB in the end (delta: -8.1MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2024-11-19 06:57:13,175 INFO L158 Benchmark]: CDTParser took 1.05ms. Allocated memory is still 58.7MB. Free memory was 33.5MB in the beginning and 33.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:57:13,175 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.15ms. Allocated memory was 58.7MB in the beginning and 81.8MB in the end (delta: 23.1MB). Free memory was 33.7MB in the beginning and 53.5MB in the end (delta: -19.8MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2024-11-19 06:57:13,175 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.81ms. Allocated memory is still 81.8MB. Free memory was 53.5MB in the beginning and 51.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:57:13,176 INFO L158 Benchmark]: Boogie Preprocessor took 89.67ms. Allocated memory is still 81.8MB. Free memory was 51.4MB in the beginning and 48.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:57:13,176 INFO L158 Benchmark]: RCFGBuilder took 828.61ms. Allocated memory is still 81.8MB. Free memory was 48.3MB in the beginning and 42.2MB in the end (delta: 6.1MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2024-11-19 06:57:13,176 INFO L158 Benchmark]: TraceAbstraction took 6482.03ms. Allocated memory is still 81.8MB. Free memory was 41.8MB in the beginning and 41.9MB in the end (delta: -171.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:57:13,176 INFO L158 Benchmark]: Witness Printer took 4.61ms. Allocated memory is still 81.8MB. Free memory is still 41.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:57:13,179 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.05ms. Allocated memory is still 58.7MB. Free memory was 33.5MB in the beginning and 33.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 525.15ms. Allocated memory was 58.7MB in the beginning and 81.8MB in the end (delta: 23.1MB). Free memory was 33.7MB in the beginning and 53.5MB in the end (delta: -19.8MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.81ms. Allocated memory is still 81.8MB. Free memory was 53.5MB in the beginning and 51.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.67ms. Allocated memory is still 81.8MB. Free memory was 51.4MB in the beginning and 48.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 828.61ms. Allocated memory is still 81.8MB. Free memory was 48.3MB in the beginning and 42.2MB in the end (delta: 6.1MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6482.03ms. Allocated memory is still 81.8MB. Free memory was 41.8MB in the beginning and 41.9MB in the end (delta: -171.9kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.61ms. Allocated memory is still 81.8MB. Free memory is still 41.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 993]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 993. Possible FailurePath: [L1006] SLL* list = malloc(sizeof(SLL)); [L1007] list->next = ((void*)0) [L1008] list->colour = BLACK [L1010] SLL* end = list; VAL [end={6:0}, list={6:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1034] end = ((void*)0) [L1035] end = list VAL [end={6:0}, list={6:0}] [L1038] COND FALSE !(!(((void*)0) != end)) VAL [end={6:0}, list={6:0}] [L1039] EXPR end->colour [L1039] COND FALSE !(!(BLACK == end->colour)) [L1041] COND TRUE ((void*)0) != end VAL [end={6:0}, list={6:0}] [L1043] EXPR end->colour [L1043] COND FALSE !(RED == end->colour) [L1049] EXPR end->next [L1049] COND TRUE !(end->next) [L1049] CALL reach_error() [L993] COND FALSE !(0) [L993] __assert_fail ("0", "sll-rb-cnstr_1-2.c", 13, __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: -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: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free 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: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free 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: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: 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, 126 locations, 53 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 657 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 657 mSDsluCounter, 1504 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 843 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1264 IncrementalHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 661 mSDtfsCounter, 1264 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=0, InterpolantAutomatonStates: 46, 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, 9 MinimizatonAttempts, 94 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 444 SizeOfPredicates, 19 NumberOfNonLiveVariables, 523 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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 [2024-11-19 06:57:13,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample