./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/lockfree-3.2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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/memsafety/lockfree-3.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 31ec15b2e966aee42d8cde3b6798712776e0e885e8b3f5267212ea76fdd72bb4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:43:05,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:43:05,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:43:05,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:43:05,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:43:05,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:43:05,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:43:05,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:43:05,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:43:05,494 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:43:05,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:43:05,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:43:05,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:43:05,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:43:05,498 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:43:05,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:43:05,499 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:43:05,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:43:05,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:43:05,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:43:05,500 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:43:05,503 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:43:05,504 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:43:05,504 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:43:05,504 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:43:05,504 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:43:05,505 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:43:05,505 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:43:05,505 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:43:05,505 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:43:05,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:43:05,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:43:05,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:43:05,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:43:05,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:43:05,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:43:05,507 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:43:05,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:43:05,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:43:05,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:43:05,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:43:05,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:43:05,509 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 -> 31ec15b2e966aee42d8cde3b6798712776e0e885e8b3f5267212ea76fdd72bb4 [2024-11-09 07:43:05,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:43:05,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:43:05,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:43:05,804 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:43:05,804 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:43:05,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.2.i [2024-11-09 07:43:07,266 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:43:07,533 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:43:07,533 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.2.i [2024-11-09 07:43:07,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715a63831/65c317533f1a44a1b8a3004e507a3f6d/FLAGa43b65dc9 [2024-11-09 07:43:07,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715a63831/65c317533f1a44a1b8a3004e507a3f6d [2024-11-09 07:43:07,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:43:07,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:43:07,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:43:07,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:43:07,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:43:07,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:43:07" (1/1) ... [2024-11-09 07:43:07,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@756f4c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:07, skipping insertion in model container [2024-11-09 07:43:07,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:43:07" (1/1) ... [2024-11-09 07:43:07,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:43:07,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:43:07,992 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:43:08,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:43:08,080 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:43:08,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:08 WrapperNode [2024-11-09 07:43:08,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:43:08,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:43:08,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:43:08,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:43:08,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:08" (1/1) ... [2024-11-09 07:43:08,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:08" (1/1) ... [2024-11-09 07:43:08,126 INFO L138 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 134 [2024-11-09 07:43:08,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:43:08,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:43:08,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:43:08,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:43:08,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:08" (1/1) ... [2024-11-09 07:43:08,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:08" (1/1) ... [2024-11-09 07:43:08,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:08" (1/1) ... [2024-11-09 07:43:08,160 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-09 07:43:08,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:08" (1/1) ... [2024-11-09 07:43:08,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:08" (1/1) ... [2024-11-09 07:43:08,169 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:08" (1/1) ... [2024-11-09 07:43:08,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:08" (1/1) ... [2024-11-09 07:43:08,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:08" (1/1) ... [2024-11-09 07:43:08,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:08" (1/1) ... [2024-11-09 07:43:08,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:43:08,184 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:43:08,185 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:43:08,185 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:43:08,185 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:08" (1/1) ... [2024-11-09 07:43:08,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:43:08,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:43:08,228 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-09 07:43:08,235 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-09 07:43:08,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:43:08,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:43:08,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:43:08,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:43:08,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:43:08,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:43:08,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:43:08,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:43:08,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:43:08,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:43:08,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:43:08,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:43:08,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:43:08,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:43:08,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:43:08,458 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:43:08,459 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:43:08,714 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-09 07:43:08,714 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:43:08,733 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:43:08,734 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 07:43:08,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:43:08 BoogieIcfgContainer [2024-11-09 07:43:08,734 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:43:08,736 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:43:08,736 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:43:08,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:43:08,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:43:07" (1/3) ... [2024-11-09 07:43:08,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522c121b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:43:08, skipping insertion in model container [2024-11-09 07:43:08,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:08" (2/3) ... [2024-11-09 07:43:08,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522c121b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:43:08, skipping insertion in model container [2024-11-09 07:43:08,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:43:08" (3/3) ... [2024-11-09 07:43:08,744 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.2.i [2024-11-09 07:43:08,760 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:43:08,761 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-11-09 07:43:08,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:43:08,803 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;@26e4f747, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:43:08,803 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-09 07:43:08,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 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-09 07:43:08,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:43:08,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:08,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:43:08,815 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:43:08,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:08,819 INFO L85 PathProgramCache]: Analyzing trace with hash 28819106, now seen corresponding path program 1 times [2024-11-09 07:43:08,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:08,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819089126] [2024-11-09 07:43:08,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:08,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:08,943 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-09 07:43:08,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:08,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819089126] [2024-11-09 07:43:08,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819089126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:08,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:08,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:43:08,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364513717] [2024-11-09 07:43:08,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:08,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:43:08,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:08,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:43:08,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:43:08,982 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:08,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:08,997 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2024-11-09 07:43:08,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:43:08,998 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 07:43:08,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:09,004 INFO L225 Difference]: With dead ends: 64 [2024-11-09 07:43:09,005 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 07:43:09,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:43:09,010 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:09,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:09,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 07:43:09,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-09 07:43:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:09,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2024-11-09 07:43:09,039 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2024-11-09 07:43:09,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:09,040 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2024-11-09 07:43:09,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:09,040 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2024-11-09 07:43:09,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:43:09,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:09,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:09,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:43:09,042 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:43:09,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:09,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1806851052, now seen corresponding path program 1 times [2024-11-09 07:43:09,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:09,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982810072] [2024-11-09 07:43:09,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:09,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:09,127 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-09 07:43:09,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:09,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982810072] [2024-11-09 07:43:09,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982810072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:09,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:09,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:43:09,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063755818] [2024-11-09 07:43:09,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:09,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:43:09,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:09,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:43:09,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:09,134 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:09,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:09,151 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2024-11-09 07:43:09,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:43:09,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 07:43:09,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:09,153 INFO L225 Difference]: With dead ends: 63 [2024-11-09 07:43:09,153 INFO L226 Difference]: Without dead ends: 63 [2024-11-09 07:43:09,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:09,154 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:09,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-09 07:43:09,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-09 07:43:09,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 62 states have internal predecessors, (80), 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-09 07:43:09,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2024-11-09 07:43:09,162 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 7 [2024-11-09 07:43:09,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:09,162 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2024-11-09 07:43:09,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:09,163 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2024-11-09 07:43:09,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:43:09,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:09,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:09,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:43:09,164 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:43:09,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:09,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1806910634, now seen corresponding path program 1 times [2024-11-09 07:43:09,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:09,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014114794] [2024-11-09 07:43:09,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:09,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:09,249 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-09 07:43:09,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:09,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014114794] [2024-11-09 07:43:09,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014114794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:09,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:09,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:43:09,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10067182] [2024-11-09 07:43:09,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:09,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:43:09,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:09,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:43:09,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:09,255 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:09,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:09,299 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2024-11-09 07:43:09,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:43:09,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 07:43:09,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:09,301 INFO L225 Difference]: With dead ends: 111 [2024-11-09 07:43:09,301 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 07:43:09,304 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-09 07:43:09,305 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 62 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:09,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 138 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:09,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 07:43:09,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2024-11-09 07:43:09,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 92 states have internal predecessors, (137), 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-09 07:43:09,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2024-11-09 07:43:09,321 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 7 [2024-11-09 07:43:09,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:09,321 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2024-11-09 07:43:09,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:09,322 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2024-11-09 07:43:09,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:43:09,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:09,323 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:09,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:43:09,323 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:43:09,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:09,324 INFO L85 PathProgramCache]: Analyzing trace with hash 177749355, now seen corresponding path program 1 times [2024-11-09 07:43:09,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:09,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047883678] [2024-11-09 07:43:09,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:09,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:09,429 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-09 07:43:09,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:09,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047883678] [2024-11-09 07:43:09,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047883678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:09,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:09,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:43:09,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583501059] [2024-11-09 07:43:09,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:09,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:43:09,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:09,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:43:09,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:09,433 INFO L87 Difference]: Start difference. First operand 93 states and 137 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-09 07:43:09,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:09,521 INFO L93 Difference]: Finished difference Result 122 states and 174 transitions. [2024-11-09 07:43:09,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:43:09,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-09 07:43:09,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:09,523 INFO L225 Difference]: With dead ends: 122 [2024-11-09 07:43:09,523 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 07:43:09,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-09 07:43:09,524 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 34 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:09,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 208 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:09,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 07:43:09,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2024-11-09 07:43:09,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 90 states have (on average 1.9) internal successors, (171), 109 states have internal predecessors, (171), 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-09 07:43:09,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 171 transitions. [2024-11-09 07:43:09,538 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 171 transitions. Word has length 8 [2024-11-09 07:43:09,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:09,538 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 171 transitions. [2024-11-09 07:43:09,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-09 07:43:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 171 transitions. [2024-11-09 07:43:09,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:43:09,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:09,539 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:09,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:43:09,539 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:43:09,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:09,540 INFO L85 PathProgramCache]: Analyzing trace with hash 179653412, now seen corresponding path program 1 times [2024-11-09 07:43:09,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:09,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880106494] [2024-11-09 07:43:09,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:09,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:09,598 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-09 07:43:09,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:09,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880106494] [2024-11-09 07:43:09,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880106494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:09,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:09,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:43:09,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036983688] [2024-11-09 07:43:09,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:09,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:43:09,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:09,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:43:09,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:09,602 INFO L87 Difference]: Start difference. First operand 110 states and 171 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-09 07:43:09,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:09,680 INFO L93 Difference]: Finished difference Result 207 states and 321 transitions. [2024-11-09 07:43:09,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:43:09,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-09 07:43:09,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:09,682 INFO L225 Difference]: With dead ends: 207 [2024-11-09 07:43:09,682 INFO L226 Difference]: Without dead ends: 204 [2024-11-09 07:43:09,682 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-09 07:43:09,687 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:09,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 121 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-09 07:43:09,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 183. [2024-11-09 07:43:09,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 163 states have (on average 1.8711656441717792) internal successors, (305), 182 states have internal predecessors, (305), 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-09 07:43:09,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 305 transitions. [2024-11-09 07:43:09,711 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 305 transitions. Word has length 8 [2024-11-09 07:43:09,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:09,713 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 305 transitions. [2024-11-09 07:43:09,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-09 07:43:09,713 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 305 transitions. [2024-11-09 07:43:09,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:43:09,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:09,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:09,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:43:09,715 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:43:09,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:09,715 INFO L85 PathProgramCache]: Analyzing trace with hash 179596397, now seen corresponding path program 1 times [2024-11-09 07:43:09,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:09,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421887849] [2024-11-09 07:43:09,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:09,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:09,813 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-09 07:43:09,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:09,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421887849] [2024-11-09 07:43:09,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421887849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:09,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:09,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:43:09,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741285380] [2024-11-09 07:43:09,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:09,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:43:09,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:09,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:43:09,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:09,816 INFO L87 Difference]: Start difference. First operand 183 states and 305 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-09 07:43:09,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:09,907 INFO L93 Difference]: Finished difference Result 274 states and 434 transitions. [2024-11-09 07:43:09,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:43:09,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-09 07:43:09,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:09,910 INFO L225 Difference]: With dead ends: 274 [2024-11-09 07:43:09,910 INFO L226 Difference]: Without dead ends: 274 [2024-11-09 07:43:09,910 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-09 07:43:09,911 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 67 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:09,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 172 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:09,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-09 07:43:09,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 253. [2024-11-09 07:43:09,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 235 states have (on average 1.7872340425531914) internal successors, (420), 252 states have internal predecessors, (420), 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-09 07:43:09,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 420 transitions. [2024-11-09 07:43:09,931 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 420 transitions. Word has length 8 [2024-11-09 07:43:09,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:09,932 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 420 transitions. [2024-11-09 07:43:09,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-09 07:43:09,932 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 420 transitions. [2024-11-09 07:43:09,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:43:09,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:09,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:09,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:43:09,933 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:43:09,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:09,933 INFO L85 PathProgramCache]: Analyzing trace with hash 179596398, now seen corresponding path program 1 times [2024-11-09 07:43:09,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:09,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829837191] [2024-11-09 07:43:09,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:09,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:10,053 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-09 07:43:10,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:10,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829837191] [2024-11-09 07:43:10,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829837191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:10,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:10,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:43:10,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823323058] [2024-11-09 07:43:10,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:10,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:43:10,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:10,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:43:10,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:10,055 INFO L87 Difference]: Start difference. First operand 253 states and 420 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-09 07:43:10,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:10,103 INFO L93 Difference]: Finished difference Result 269 states and 421 transitions. [2024-11-09 07:43:10,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:43:10,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-09 07:43:10,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:10,105 INFO L225 Difference]: With dead ends: 269 [2024-11-09 07:43:10,105 INFO L226 Difference]: Without dead ends: 269 [2024-11-09 07:43:10,105 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-09 07:43:10,106 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 66 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:10,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 179 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:10,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-09 07:43:10,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 251. [2024-11-09 07:43:10,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 235 states have (on average 1.7361702127659575) internal successors, (408), 250 states have internal predecessors, (408), 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-09 07:43:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 408 transitions. [2024-11-09 07:43:10,128 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 408 transitions. Word has length 8 [2024-11-09 07:43:10,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:10,132 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 408 transitions. [2024-11-09 07:43:10,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-09 07:43:10,133 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 408 transitions. [2024-11-09 07:43:10,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:43:10,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:10,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:10,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:43:10,134 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:43:10,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:10,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1272529015, now seen corresponding path program 1 times [2024-11-09 07:43:10,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:10,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320362098] [2024-11-09 07:43:10,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:10,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:10,190 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-09 07:43:10,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:10,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320362098] [2024-11-09 07:43:10,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320362098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:10,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:10,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:43:10,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236350456] [2024-11-09 07:43:10,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:10,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:43:10,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:10,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:43:10,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:10,193 INFO L87 Difference]: Start difference. First operand 251 states and 408 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-09 07:43:10,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:10,221 INFO L93 Difference]: Finished difference Result 212 states and 309 transitions. [2024-11-09 07:43:10,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:43:10,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-11-09 07:43:10,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:10,222 INFO L225 Difference]: With dead ends: 212 [2024-11-09 07:43:10,223 INFO L226 Difference]: Without dead ends: 212 [2024-11-09 07:43:10,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:10,224 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 46 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:10,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 199 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:10,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-09 07:43:10,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 188. [2024-11-09 07:43:10,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 176 states have (on average 1.6534090909090908) internal successors, (291), 187 states have internal predecessors, (291), 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-09 07:43:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 291 transitions. [2024-11-09 07:43:10,238 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 291 transitions. Word has length 9 [2024-11-09 07:43:10,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:10,238 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 291 transitions. [2024-11-09 07:43:10,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-09 07:43:10,238 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 291 transitions. [2024-11-09 07:43:10,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:43:10,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:10,238 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:10,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:43:10,239 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:43:10,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:10,239 INFO L85 PathProgramCache]: Analyzing trace with hash 845049582, now seen corresponding path program 1 times [2024-11-09 07:43:10,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:10,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669197904] [2024-11-09 07:43:10,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:10,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:10,282 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-09 07:43:10,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:10,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669197904] [2024-11-09 07:43:10,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669197904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:10,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:10,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:43:10,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236324373] [2024-11-09 07:43:10,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:10,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:43:10,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:10,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:43:10,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:10,287 INFO L87 Difference]: Start difference. First operand 188 states and 291 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:10,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:10,318 INFO L93 Difference]: Finished difference Result 275 states and 409 transitions. [2024-11-09 07:43:10,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:43:10,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 07:43:10,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:10,322 INFO L225 Difference]: With dead ends: 275 [2024-11-09 07:43:10,322 INFO L226 Difference]: Without dead ends: 275 [2024-11-09 07:43:10,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:10,323 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 38 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:10,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 191 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:10,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-09 07:43:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 259. [2024-11-09 07:43:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 247 states have (on average 1.591093117408907) internal successors, (393), 258 states have internal predecessors, (393), 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-09 07:43:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 393 transitions. [2024-11-09 07:43:10,334 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 393 transitions. Word has length 10 [2024-11-09 07:43:10,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:10,334 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 393 transitions. [2024-11-09 07:43:10,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:10,335 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 393 transitions. [2024-11-09 07:43:10,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:43:10,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:10,335 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:10,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:43:10,336 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:43:10,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:10,336 INFO L85 PathProgramCache]: Analyzing trace with hash 22246394, now seen corresponding path program 1 times [2024-11-09 07:43:10,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:10,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261597923] [2024-11-09 07:43:10,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:10,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:43:10,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:43:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:43:10,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 07:43:10,402 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:43:10,403 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2024-11-09 07:43:10,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2024-11-09 07:43:10,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2024-11-09 07:43:10,407 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2024-11-09 07:43:10,407 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2024-11-09 07:43:10,407 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2024-11-09 07:43:10,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2024-11-09 07:43:10,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2024-11-09 07:43:10,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2024-11-09 07:43:10,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2024-11-09 07:43:10,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2024-11-09 07:43:10,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2024-11-09 07:43:10,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2024-11-09 07:43:10,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2024-11-09 07:43:10,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2024-11-09 07:43:10,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2024-11-09 07:43:10,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2024-11-09 07:43:10,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2024-11-09 07:43:10,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2024-11-09 07:43:10,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2024-11-09 07:43:10,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:43:10,413 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:10,455 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:43:10,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:43:10 BoogieIcfgContainer [2024-11-09 07:43:10,459 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:43:10,460 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:43:10,460 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:43:10,460 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:43:10,461 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:43:08" (3/4) ... [2024-11-09 07:43:10,463 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 07:43:10,464 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:43:10,465 INFO L158 Benchmark]: Toolchain (without parser) took 2895.56ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 101.9MB in the beginning and 72.4MB in the end (delta: 29.5MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. [2024-11-09 07:43:10,465 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 58.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:43:10,465 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.96ms. Allocated memory is still 155.2MB. Free memory was 101.5MB in the beginning and 124.0MB in the end (delta: -22.5MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2024-11-09 07:43:10,465 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.03ms. Allocated memory is still 155.2MB. Free memory was 124.0MB in the beginning and 121.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:43:10,465 INFO L158 Benchmark]: Boogie Preprocessor took 56.02ms. Allocated memory is still 155.2MB. Free memory was 121.9MB in the beginning and 118.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:43:10,466 INFO L158 Benchmark]: RCFGBuilder took 549.80ms. Allocated memory is still 155.2MB. Free memory was 118.9MB in the beginning and 108.5MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 07:43:10,466 INFO L158 Benchmark]: TraceAbstraction took 1723.08ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 107.8MB in the beginning and 72.4MB in the end (delta: 35.4MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. [2024-11-09 07:43:10,466 INFO L158 Benchmark]: Witness Printer took 4.41ms. Allocated memory is still 186.6MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:43:10,467 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.17ms. Allocated memory is still 96.5MB. Free memory is still 58.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 509.96ms. Allocated memory is still 155.2MB. Free memory was 101.5MB in the beginning and 124.0MB in the end (delta: -22.5MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.03ms. Allocated memory is still 155.2MB. Free memory was 124.0MB in the beginning and 121.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.02ms. Allocated memory is still 155.2MB. Free memory was 121.9MB in the beginning and 118.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 549.80ms. Allocated memory is still 155.2MB. Free memory was 118.9MB in the beginning and 108.5MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1723.08ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 107.8MB in the beginning and 72.4MB in the end (delta: 35.4MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. * Witness Printer took 4.41ms. Allocated memory is still 186.6MB. Free memory is still 72.4MB. 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: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] S || 1 != pc4 || __VERIFIER_nondet_int() [L594] S || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L538] x1->data = 0 VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc4 || __VERIFIER_nondet_int() [L594] S || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND FALSE !(S || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [S={0:0}, \result=0, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - 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: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 376 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 376 mSDsluCounter, 1440 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 679 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 197 IncrementalHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 761 mSDtfsCounter, 197 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=259occurred in iteration=9, InterpolantAutomatonStates: 29, 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, 130 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 154 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-09 07:43:10,502 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/memsafety/lockfree-3.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 31ec15b2e966aee42d8cde3b6798712776e0e885e8b3f5267212ea76fdd72bb4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:43:12,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:43:12,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 07:43:12,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:43:12,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:43:12,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:43:12,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:43:12,819 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:43:12,819 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:43:12,819 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:43:12,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:43:12,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:43:12,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:43:12,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:43:12,825 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:43:12,825 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:43:12,826 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:43:12,826 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:43:12,826 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:43:12,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:43:12,826 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:43:12,827 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:43:12,827 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:43:12,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:43:12,829 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:43:12,830 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:43:12,830 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:43:12,830 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:43:12,830 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:43:12,831 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:43:12,831 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:43:12,831 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:43:12,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:43:12,831 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:43:12,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:43:12,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:43:12,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:43:12,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:43:12,833 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 07:43:12,833 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:43:12,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:43:12,834 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:43:12,834 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:43:12,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:43:12,835 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 -> 31ec15b2e966aee42d8cde3b6798712776e0e885e8b3f5267212ea76fdd72bb4 [2024-11-09 07:43:13,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:43:13,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:43:13,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:43:13,185 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:43:13,186 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:43:13,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.2.i [2024-11-09 07:43:14,748 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:43:14,991 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:43:14,992 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.2.i [2024-11-09 07:43:15,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a22eaec7e/fad11026a90e4bb490965eba7f52e021/FLAGb2a21f818 [2024-11-09 07:43:15,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a22eaec7e/fad11026a90e4bb490965eba7f52e021 [2024-11-09 07:43:15,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:43:15,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:43:15,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:43:15,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:43:15,344 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:43:15,345 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:43:15" (1/1) ... [2024-11-09 07:43:15,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ceff6c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:15, skipping insertion in model container [2024-11-09 07:43:15,346 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:43:15" (1/1) ... [2024-11-09 07:43:15,393 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:43:15,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:43:15,751 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:43:15,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:43:15,858 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:43:15,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:15 WrapperNode [2024-11-09 07:43:15,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:43:15,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:43:15,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:43:15,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:43:15,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:15" (1/1) ... [2024-11-09 07:43:15,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:15" (1/1) ... [2024-11-09 07:43:15,910 INFO L138 Inliner]: procedures = 128, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 133 [2024-11-09 07:43:15,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:43:15,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:43:15,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:43:15,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:43:15,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:15" (1/1) ... [2024-11-09 07:43:15,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:15" (1/1) ... [2024-11-09 07:43:15,930 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:15" (1/1) ... [2024-11-09 07:43:15,954 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-09 07:43:15,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:15" (1/1) ... [2024-11-09 07:43:15,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:15" (1/1) ... [2024-11-09 07:43:15,962 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:15" (1/1) ... [2024-11-09 07:43:15,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:15" (1/1) ... [2024-11-09 07:43:15,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:15" (1/1) ... [2024-11-09 07:43:15,974 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:15" (1/1) ... [2024-11-09 07:43:15,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:43:15,980 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:43:15,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:43:15,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:43:15,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:15" (1/1) ... [2024-11-09 07:43:15,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:43:16,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:43:16,023 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-09 07:43:16,026 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-09 07:43:16,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 07:43:16,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 07:43:16,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:43:16,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:43:16,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:43:16,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:43:16,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:43:16,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:43:16,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:43:16,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 07:43:16,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 07:43:16,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 07:43:16,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 07:43:16,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:43:16,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:43:16,201 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:43:16,203 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:43:16,627 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-09 07:43:16,627 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:43:16,641 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:43:16,641 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 07:43:16,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:43:16 BoogieIcfgContainer [2024-11-09 07:43:16,642 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:43:16,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:43:16,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:43:16,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:43:16,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:43:15" (1/3) ... [2024-11-09 07:43:16,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5886fe4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:43:16, skipping insertion in model container [2024-11-09 07:43:16,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:15" (2/3) ... [2024-11-09 07:43:16,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5886fe4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:43:16, skipping insertion in model container [2024-11-09 07:43:16,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:43:16" (3/3) ... [2024-11-09 07:43:16,652 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.2.i [2024-11-09 07:43:16,669 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:43:16,669 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-11-09 07:43:16,721 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:43:16,729 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;@3dd01980, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:43:16,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-09 07:43:16,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 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-09 07:43:16,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:43:16,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:16,741 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:43:16,742 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:43:16,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:16,748 INFO L85 PathProgramCache]: Analyzing trace with hash 28819106, now seen corresponding path program 1 times [2024-11-09 07:43:16,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:43:16,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227007692] [2024-11-09 07:43:16,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:16,761 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-09 07:43:16,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:43:16,765 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-09 07:43:16,793 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-09 07:43:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:16,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 07:43:16,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:43:16,895 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-09 07:43:16,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:43:16,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:43:16,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227007692] [2024-11-09 07:43:16,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227007692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:16,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:16,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:43:16,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395229954] [2024-11-09 07:43:16,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:16,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:43:16,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:43:16,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:43:16,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:43:16,933 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:16,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:16,949 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2024-11-09 07:43:16,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:43:16,952 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 07:43:16,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:16,960 INFO L225 Difference]: With dead ends: 64 [2024-11-09 07:43:16,960 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 07:43:16,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:43:16,966 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:16,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:16,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 07:43:16,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-09 07:43:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:16,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2024-11-09 07:43:16,999 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2024-11-09 07:43:16,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:16,999 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2024-11-09 07:43:16,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:17,000 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2024-11-09 07:43:17,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:43:17,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:17,000 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:17,007 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-09 07:43:17,201 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-09 07:43:17,201 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:43:17,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:17,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1806851052, now seen corresponding path program 1 times [2024-11-09 07:43:17,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:43:17,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118942111] [2024-11-09 07:43:17,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:17,203 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-09 07:43:17,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:43:17,206 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-09 07:43:17,210 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-09 07:43:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:17,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:43:17,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:43:17,353 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-09 07:43:17,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:43:17,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:43:17,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118942111] [2024-11-09 07:43:17,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118942111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:17,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:17,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:43:17,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698963155] [2024-11-09 07:43:17,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:17,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:43:17,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:43:17,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:43:17,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:17,361 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:17,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:17,452 INFO L93 Difference]: Finished difference Result 101 states and 127 transitions. [2024-11-09 07:43:17,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:43:17,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 07:43:17,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:17,454 INFO L225 Difference]: With dead ends: 101 [2024-11-09 07:43:17,454 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 07:43:17,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:43:17,456 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 45 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:17,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 208 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:17,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 07:43:17,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 79. [2024-11-09 07:43:17,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 59 states have (on average 1.9152542372881356) internal successors, (113), 78 states have internal predecessors, (113), 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-09 07:43:17,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 113 transitions. [2024-11-09 07:43:17,466 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 113 transitions. Word has length 7 [2024-11-09 07:43:17,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:17,468 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 113 transitions. [2024-11-09 07:43:17,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:17,468 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2024-11-09 07:43:17,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:43:17,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:17,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:17,473 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-09 07:43:17,669 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-09 07:43:17,670 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:43:17,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:17,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1806910634, now seen corresponding path program 1 times [2024-11-09 07:43:17,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:43:17,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514072789] [2024-11-09 07:43:17,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:17,671 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-09 07:43:17,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:43:17,675 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-09 07:43:17,676 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-09 07:43:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:17,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:43:17,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:43:17,768 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-09 07:43:17,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:43:17,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:43:17,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514072789] [2024-11-09 07:43:17,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514072789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:17,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:17,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:43:17,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643581426] [2024-11-09 07:43:17,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:17,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:43:17,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:43:17,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:43:17,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:17,771 INFO L87 Difference]: Start difference. First operand 79 states and 113 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:17,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:17,814 INFO L93 Difference]: Finished difference Result 126 states and 177 transitions. [2024-11-09 07:43:17,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:43:17,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 07:43:17,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:17,817 INFO L225 Difference]: With dead ends: 126 [2024-11-09 07:43:17,817 INFO L226 Difference]: Without dead ends: 126 [2024-11-09 07:43:17,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:17,818 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 62 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:17,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 138 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:17,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-09 07:43:17,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2024-11-09 07:43:17,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.9204545454545454) internal successors, (169), 107 states have internal predecessors, (169), 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-09 07:43:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 169 transitions. [2024-11-09 07:43:17,831 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 169 transitions. Word has length 7 [2024-11-09 07:43:17,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:17,832 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 169 transitions. [2024-11-09 07:43:17,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 169 transitions. [2024-11-09 07:43:17,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:43:17,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:17,833 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:17,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 07:43:18,033 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-09 07:43:18,034 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:43:18,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:18,039 INFO L85 PathProgramCache]: Analyzing trace with hash 179653412, now seen corresponding path program 1 times [2024-11-09 07:43:18,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:43:18,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048005610] [2024-11-09 07:43:18,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:18,040 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-09 07:43:18,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:43:18,043 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-09 07:43:18,044 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-09 07:43:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:18,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 07:43:18,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:43:18,105 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-09 07:43:18,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:43:18,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:43:18,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048005610] [2024-11-09 07:43:18,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048005610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:18,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:18,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:43:18,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394311571] [2024-11-09 07:43:18,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:18,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:43:18,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:43:18,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:43:18,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:18,108 INFO L87 Difference]: Start difference. First operand 108 states and 169 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-09 07:43:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:18,230 INFO L93 Difference]: Finished difference Result 203 states and 317 transitions. [2024-11-09 07:43:18,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:43:18,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-09 07:43:18,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:18,233 INFO L225 Difference]: With dead ends: 203 [2024-11-09 07:43:18,233 INFO L226 Difference]: Without dead ends: 200 [2024-11-09 07:43:18,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-09 07:43:18,237 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:18,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 121 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:18,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-09 07:43:18,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 180. [2024-11-09 07:43:18,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 160 states have (on average 1.8875) internal successors, (302), 179 states have internal predecessors, (302), 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-09 07:43:18,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 302 transitions. [2024-11-09 07:43:18,257 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 302 transitions. Word has length 8 [2024-11-09 07:43:18,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:18,257 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 302 transitions. [2024-11-09 07:43:18,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-09 07:43:18,258 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 302 transitions. [2024-11-09 07:43:18,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:43:18,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:18,258 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:18,262 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 (5)] Ended with exit code 0 [2024-11-09 07:43:18,459 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-09 07:43:18,459 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:43:18,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:18,460 INFO L85 PathProgramCache]: Analyzing trace with hash 179596397, now seen corresponding path program 1 times [2024-11-09 07:43:18,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:43:18,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224616989] [2024-11-09 07:43:18,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:18,461 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-09 07:43:18,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:43:18,462 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-09 07:43:18,463 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-09 07:43:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:18,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:43:18,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:43:18,576 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-09 07:43:18,583 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-09 07:43:18,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:43:18,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:43:18,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224616989] [2024-11-09 07:43:18,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224616989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:18,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:18,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:43:18,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709220437] [2024-11-09 07:43:18,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:18,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:43:18,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:43:18,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:43:18,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:18,589 INFO L87 Difference]: Start difference. First operand 180 states and 302 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-09 07:43:18,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:18,748 INFO L93 Difference]: Finished difference Result 270 states and 430 transitions. [2024-11-09 07:43:18,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:43:18,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-09 07:43:18,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:18,754 INFO L225 Difference]: With dead ends: 270 [2024-11-09 07:43:18,754 INFO L226 Difference]: Without dead ends: 270 [2024-11-09 07:43:18,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-09 07:43:18,755 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 67 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:18,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 172 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:43:18,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-09 07:43:18,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 249. [2024-11-09 07:43:18,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 231 states have (on average 1.800865800865801) internal successors, (416), 248 states have internal predecessors, (416), 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-09 07:43:18,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 416 transitions. [2024-11-09 07:43:18,778 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 416 transitions. Word has length 8 [2024-11-09 07:43:18,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:18,778 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 416 transitions. [2024-11-09 07:43:18,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-09 07:43:18,778 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 416 transitions. [2024-11-09 07:43:18,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:43:18,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:18,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:18,782 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-09 07:43:18,979 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-09 07:43:18,980 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:43:18,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:18,980 INFO L85 PathProgramCache]: Analyzing trace with hash 179596398, now seen corresponding path program 1 times [2024-11-09 07:43:18,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:43:18,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899068671] [2024-11-09 07:43:18,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:18,981 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-09 07:43:18,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:43:18,982 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-09 07:43:18,983 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-09 07:43:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:19,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:43:19,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:43:19,039 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-09 07:43:19,047 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-09 07:43:19,047 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:43:19,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:43:19,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899068671] [2024-11-09 07:43:19,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899068671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:19,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:19,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:43:19,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622278383] [2024-11-09 07:43:19,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:19,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:43:19,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:43:19,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:43:19,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:19,048 INFO L87 Difference]: Start difference. First operand 249 states and 416 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-09 07:43:19,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:19,153 INFO L93 Difference]: Finished difference Result 265 states and 417 transitions. [2024-11-09 07:43:19,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:43:19,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-09 07:43:19,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:19,155 INFO L225 Difference]: With dead ends: 265 [2024-11-09 07:43:19,155 INFO L226 Difference]: Without dead ends: 265 [2024-11-09 07:43:19,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-09 07:43:19,156 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 66 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:19,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 179 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:19,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-09 07:43:19,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 247. [2024-11-09 07:43:19,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 231 states have (on average 1.748917748917749) internal successors, (404), 246 states have internal predecessors, (404), 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-09 07:43:19,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 404 transitions. [2024-11-09 07:43:19,165 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 404 transitions. Word has length 8 [2024-11-09 07:43:19,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:19,165 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 404 transitions. [2024-11-09 07:43:19,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-09 07:43:19,165 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 404 transitions. [2024-11-09 07:43:19,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:43:19,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:19,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:19,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-09 07:43:19,366 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-09 07:43:19,367 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:43:19,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:19,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1272529015, now seen corresponding path program 1 times [2024-11-09 07:43:19,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:43:19,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738329441] [2024-11-09 07:43:19,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:19,368 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-09 07:43:19,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:43:19,370 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-09 07:43:19,371 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-09 07:43:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:19,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:43:19,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:43:19,444 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-09 07:43:19,444 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:43:19,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:43:19,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738329441] [2024-11-09 07:43:19,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738329441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:19,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:19,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:43:19,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411467594] [2024-11-09 07:43:19,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:19,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:43:19,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:43:19,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:43:19,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:19,447 INFO L87 Difference]: Start difference. First operand 247 states and 404 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-09 07:43:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:19,474 INFO L93 Difference]: Finished difference Result 207 states and 304 transitions. [2024-11-09 07:43:19,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:43:19,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-11-09 07:43:19,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:19,476 INFO L225 Difference]: With dead ends: 207 [2024-11-09 07:43:19,476 INFO L226 Difference]: Without dead ends: 207 [2024-11-09 07:43:19,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:19,477 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 46 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:19,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 199 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:19,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-09 07:43:19,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 183. [2024-11-09 07:43:19,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 171 states have (on average 1.672514619883041) internal successors, (286), 182 states have internal predecessors, (286), 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-09 07:43:19,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 286 transitions. [2024-11-09 07:43:19,484 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 286 transitions. Word has length 9 [2024-11-09 07:43:19,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:19,484 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 286 transitions. [2024-11-09 07:43:19,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-09 07:43:19,484 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 286 transitions. [2024-11-09 07:43:19,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:43:19,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:19,485 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:19,491 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-09 07:43:19,687 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-09 07:43:19,688 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:43:19,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:19,689 INFO L85 PathProgramCache]: Analyzing trace with hash 845049582, now seen corresponding path program 1 times [2024-11-09 07:43:19,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:43:19,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516728404] [2024-11-09 07:43:19,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:19,689 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-09 07:43:19,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:43:19,692 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-09 07:43:19,693 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-09 07:43:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:19,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:43:19,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:43:19,754 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-09 07:43:19,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:43:19,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:43:19,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516728404] [2024-11-09 07:43:19,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516728404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:19,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:19,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:43:19,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261479536] [2024-11-09 07:43:19,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:19,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:43:19,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:43:19,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:43:19,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:19,756 INFO L87 Difference]: Start difference. First operand 183 states and 286 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:19,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:19,785 INFO L93 Difference]: Finished difference Result 265 states and 399 transitions. [2024-11-09 07:43:19,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:43:19,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 07:43:19,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:19,787 INFO L225 Difference]: With dead ends: 265 [2024-11-09 07:43:19,787 INFO L226 Difference]: Without dead ends: 265 [2024-11-09 07:43:19,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:19,788 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 38 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:19,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 191 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:19,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-09 07:43:19,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 249. [2024-11-09 07:43:19,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 237 states have (on average 1.6160337552742616) internal successors, (383), 248 states have internal predecessors, (383), 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-09 07:43:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 383 transitions. [2024-11-09 07:43:19,795 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 383 transitions. Word has length 10 [2024-11-09 07:43:19,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:19,796 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 383 transitions. [2024-11-09 07:43:19,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:19,796 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 383 transitions. [2024-11-09 07:43:19,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:43:19,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:19,797 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:19,801 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-09 07:43:19,999 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-09 07:43:20,000 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:43:20,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:20,000 INFO L85 PathProgramCache]: Analyzing trace with hash 22246394, now seen corresponding path program 1 times [2024-11-09 07:43:20,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:43:20,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065819757] [2024-11-09 07:43:20,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:20,001 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-09 07:43:20,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:43:20,002 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-09 07:43:20,003 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-09 07:43:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:43:20,074 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:43:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:43:20,133 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 07:43:20,133 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:43:20,134 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2024-11-09 07:43:20,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2024-11-09 07:43:20,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2024-11-09 07:43:20,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2024-11-09 07:43:20,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2024-11-09 07:43:20,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2024-11-09 07:43:20,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2024-11-09 07:43:20,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2024-11-09 07:43:20,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2024-11-09 07:43:20,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2024-11-09 07:43:20,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2024-11-09 07:43:20,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2024-11-09 07:43:20,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2024-11-09 07:43:20,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2024-11-09 07:43:20,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2024-11-09 07:43:20,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2024-11-09 07:43:20,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2024-11-09 07:43:20,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2024-11-09 07:43:20,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2024-11-09 07:43:20,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2024-11-09 07:43:20,154 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-09 07:43:20,343 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-09 07:43:20,346 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:20,369 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:43:20,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:43:20 BoogieIcfgContainer [2024-11-09 07:43:20,372 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:43:20,373 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:43:20,373 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:43:20,373 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:43:20,373 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:43:16" (3/4) ... [2024-11-09 07:43:20,375 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 07:43:20,376 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:43:20,377 INFO L158 Benchmark]: Toolchain (without parser) took 5041.54ms. Allocated memory was 56.6MB in the beginning and 86.0MB in the end (delta: 29.4MB). Free memory was 37.5MB in the beginning and 30.7MB in the end (delta: 6.8MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2024-11-09 07:43:20,377 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 44.0MB. Free memory is still 20.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:43:20,377 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.73ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 37.3MB in the beginning and 43.7MB in the end (delta: -6.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 07:43:20,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.24ms. Allocated memory is still 69.2MB. Free memory was 43.7MB in the beginning and 41.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:43:20,382 INFO L158 Benchmark]: Boogie Preprocessor took 69.20ms. Allocated memory is still 69.2MB. Free memory was 41.5MB in the beginning and 38.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:43:20,382 INFO L158 Benchmark]: RCFGBuilder took 661.54ms. Allocated memory is still 69.2MB. Free memory was 38.4MB in the beginning and 33.6MB in the end (delta: 4.8MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2024-11-09 07:43:20,383 INFO L158 Benchmark]: TraceAbstraction took 3726.91ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 32.9MB in the beginning and 31.1MB in the end (delta: 1.8MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-11-09 07:43:20,383 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 86.0MB. Free memory was 31.1MB in the beginning and 30.7MB in the end (delta: 380.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:43:20,385 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.93ms. Allocated memory is still 44.0MB. Free memory is still 20.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.73ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 37.3MB in the beginning and 43.7MB in the end (delta: -6.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.24ms. Allocated memory is still 69.2MB. Free memory was 43.7MB in the beginning and 41.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.20ms. Allocated memory is still 69.2MB. Free memory was 41.5MB in the beginning and 38.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 661.54ms. Allocated memory is still 69.2MB. Free memory was 38.4MB in the beginning and 33.6MB in the end (delta: 4.8MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3726.91ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 32.9MB in the beginning and 31.1MB in the end (delta: 1.8MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 86.0MB. Free memory was 31.1MB in the beginning and 30.7MB in the end (delta: 380.4kB). 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: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] S || 1 != pc4 || __VERIFIER_nondet_int() [L594] S || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L538] x1->data = 0 VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc4 || __VERIFIER_nondet_int() [L594] S || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L594] COND FALSE !(S || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [S={0:0}, \result=0, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - 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: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 387 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 387 mSDsluCounter, 1289 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 606 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 191 IncrementalHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 683 mSDtfsCounter, 191 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=5, InterpolantAutomatonStates: 26, 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, 8 MinimizatonAttempts, 139 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 149 SizeOfPredicates, 5 NumberOfNonLiveVariables, 314 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-09 07:43:20,410 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