./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-properties/list-1.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/list-properties/list-1.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 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:59:58,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:59:58,561 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:59:58,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:59:58,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:59:58,598 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:59:58,599 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:59:58,601 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:59:58,601 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:59:58,602 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:59:58,602 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:59:58,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:59:58,603 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:59:58,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:59:58,605 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:59:58,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:59:58,606 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:59:58,606 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:59:58,607 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:59:58,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:59:58,607 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:59:58,611 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:59:58,611 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:59:58,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:59:58,612 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:59:58,612 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:59:58,612 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:59:58,613 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:59:58,613 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:59:58,613 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:59:58,614 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:59:58,614 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:59:58,614 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:59:58,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:59:58,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:59:58,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:59:58,615 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:59:58,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:59:58,615 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:59:58,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:59:58,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:59:58,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:59:58,617 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 -> 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 [2024-11-09 07:59:58,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:59:58,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:59:58,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:59:58,889 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:59:58,889 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:59:58,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list-1.i [2024-11-09 08:00:00,299 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 08:00:00,534 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 08:00:00,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i [2024-11-09 08:00:00,546 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be8f57abb/3f73088485ca41e79656af24196620c6/FLAG7058dc272 [2024-11-09 08:00:00,557 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be8f57abb/3f73088485ca41e79656af24196620c6 [2024-11-09 08:00:00,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 08:00:00,562 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 08:00:00,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 08:00:00,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 08:00:00,570 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 08:00:00,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:00:00" (1/1) ... [2024-11-09 08:00:00,572 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40cd2e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:00, skipping insertion in model container [2024-11-09 08:00:00,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:00:00" (1/1) ... [2024-11-09 08:00:00,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 08:00:00,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:00:00,974 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 08:00:01,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:00:01,060 INFO L204 MainTranslator]: Completed translation [2024-11-09 08:00:01,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:01 WrapperNode [2024-11-09 08:00:01,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 08:00:01,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 08:00:01,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 08:00:01,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 08:00:01,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:01" (1/1) ... [2024-11-09 08:00:01,082 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:01" (1/1) ... [2024-11-09 08:00:01,102 INFO L138 Inliner]: procedures = 124, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2024-11-09 08:00:01,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 08:00:01,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 08:00:01,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 08:00:01,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 08:00:01,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:01" (1/1) ... [2024-11-09 08:00:01,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:01" (1/1) ... [2024-11-09 08:00:01,116 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:01" (1/1) ... [2024-11-09 08:00:01,132 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [2, 12]. 86 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 08:00:01,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:01" (1/1) ... [2024-11-09 08:00:01,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:01" (1/1) ... [2024-11-09 08:00:01,143 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:01" (1/1) ... [2024-11-09 08:00:01,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:01" (1/1) ... [2024-11-09 08:00:01,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:01" (1/1) ... [2024-11-09 08:00:01,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:01" (1/1) ... [2024-11-09 08:00:01,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 08:00:01,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 08:00:01,156 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 08:00:01,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 08:00:01,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:01" (1/1) ... [2024-11-09 08:00:01,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:00:01,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:00:01,201 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 08:00:01,208 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 08:00:01,255 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-09 08:00:01,255 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-09 08:00:01,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 08:00:01,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 08:00:01,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 08:00:01,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 08:00:01,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 08:00:01,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 08:00:01,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 08:00:01,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 08:00:01,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 08:00:01,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 08:00:01,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 08:00:01,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 08:00:01,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 08:00:01,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 08:00:01,400 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 08:00:01,402 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 08:00:01,422 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-09 08:00:01,688 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2024-11-09 08:00:01,689 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 08:00:01,701 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 08:00:01,701 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-09 08:00:01,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:00:01 BoogieIcfgContainer [2024-11-09 08:00:01,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 08:00:01,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 08:00:01,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 08:00:01,721 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 08:00:01,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:00:00" (1/3) ... [2024-11-09 08:00:01,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abf391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:00:01, skipping insertion in model container [2024-11-09 08:00:01,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:01" (2/3) ... [2024-11-09 08:00:01,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abf391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:00:01, skipping insertion in model container [2024-11-09 08:00:01,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:00:01" (3/3) ... [2024-11-09 08:00:01,723 INFO L112 eAbstractionObserver]: Analyzing ICFG list-1.i [2024-11-09 08:00:01,739 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 08:00:01,739 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-11-09 08:00:01,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 08:00:01,794 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;@36d5ea2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 08:00:01,794 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-09 08:00:01,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 41 states have (on average 1.951219512195122) internal successors, (80), 69 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:01,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 08:00:01,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:00:01,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:00:01,804 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 08:00:01,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:00:01,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238161, now seen corresponding path program 1 times [2024-11-09 08:00:01,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:00:01,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166857421] [2024-11-09 08:00:01,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:00:01,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:00:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:00:02,082 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 08:00:02,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:00:02,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166857421] [2024-11-09 08:00:02,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166857421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:00:02,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:00:02,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:00:02,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649033077] [2024-11-09 08:00:02,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:00:02,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:00:02,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:00:02,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:00:02,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:00:02,117 INFO L87 Difference]: Start difference. First operand has 71 states, 41 states have (on average 1.951219512195122) internal successors, (80), 69 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:02,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:00:02,292 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2024-11-09 08:00:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:00:02,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 08:00:02,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:00:02,299 INFO L225 Difference]: With dead ends: 72 [2024-11-09 08:00:02,299 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 08:00:02,300 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 08:00:02,303 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 61 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:00:02,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 66 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:00:02,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 08:00:02,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-09 08:00:02,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 64 states have internal predecessors, (75), 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 08:00:02,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2024-11-09 08:00:02,332 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 7 [2024-11-09 08:00:02,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:00:02,333 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2024-11-09 08:00:02,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:02,333 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2024-11-09 08:00:02,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 08:00:02,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:00:02,334 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:00:02,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 08:00:02,334 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 08:00:02,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:00:02,335 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238162, now seen corresponding path program 1 times [2024-11-09 08:00:02,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:00:02,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218709342] [2024-11-09 08:00:02,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:00:02,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:00:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:00:02,477 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 08:00:02,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:00:02,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218709342] [2024-11-09 08:00:02,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218709342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:00:02,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:00:02,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:00:02,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12837216] [2024-11-09 08:00:02,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:00:02,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:00:02,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:00:02,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:00:02,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:00:02,485 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:02,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:00:02,621 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2024-11-09 08:00:02,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:00:02,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 08:00:02,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:00:02,622 INFO L225 Difference]: With dead ends: 79 [2024-11-09 08:00:02,623 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 08:00:02,623 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 08:00:02,624 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 59 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:00:02,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 69 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:00:02,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 08:00:02,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-09 08:00:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.45) internal successors, (87), 78 states have internal predecessors, (87), 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 08:00:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2024-11-09 08:00:02,636 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 7 [2024-11-09 08:00:02,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:00:02,636 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2024-11-09 08:00:02,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2024-11-09 08:00:02,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 08:00:02,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:00:02,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:00:02,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 08:00:02,639 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 08:00:02,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:00:02,641 INFO L85 PathProgramCache]: Analyzing trace with hash -502587362, now seen corresponding path program 1 times [2024-11-09 08:00:02,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:00:02,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032472141] [2024-11-09 08:00:02,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:00:02,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:00:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:00:02,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:00:02,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:00:02,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032472141] [2024-11-09 08:00:02,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032472141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:00:02,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:00:02,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:00:02,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766192773] [2024-11-09 08:00:02,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:00:02,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:00:02,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:00:02,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:00:02,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:00:02,826 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:02,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:00:02,937 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2024-11-09 08:00:02,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:00:02,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 08:00:02,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:00:02,939 INFO L225 Difference]: With dead ends: 86 [2024-11-09 08:00:02,939 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 08:00:02,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:00:02,940 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 15 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:00:02,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 177 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:00:02,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 08:00:02,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2024-11-09 08:00:02,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 81 states have internal predecessors, (90), 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 08:00:02,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2024-11-09 08:00:02,953 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 15 [2024-11-09 08:00:02,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:00:02,956 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2024-11-09 08:00:02,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:02,956 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2024-11-09 08:00:02,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 08:00:02,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:00:02,957 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:00:02,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 08:00:02,958 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 08:00:02,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:00:02,958 INFO L85 PathProgramCache]: Analyzing trace with hash 761251652, now seen corresponding path program 1 times [2024-11-09 08:00:02,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:00:02,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421426943] [2024-11-09 08:00:02,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:00:02,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:00:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:00:03,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:00:03,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:00:03,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421426943] [2024-11-09 08:00:03,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421426943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:00:03,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:00:03,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 08:00:03,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38809478] [2024-11-09 08:00:03,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:00:03,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:00:03,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:00:03,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:00:03,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:00:03,131 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:03,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:00:03,286 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2024-11-09 08:00:03,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:00:03,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 08:00:03,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:00:03,288 INFO L225 Difference]: With dead ends: 85 [2024-11-09 08:00:03,288 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 08:00:03,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:00:03,289 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 16 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:00:03,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 142 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:00:03,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 08:00:03,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 08:00:03,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 84 states have internal predecessors, (96), 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 08:00:03,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2024-11-09 08:00:03,298 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 15 [2024-11-09 08:00:03,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:00:03,298 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2024-11-09 08:00:03,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:03,298 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2024-11-09 08:00:03,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 08:00:03,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:00:03,300 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:00:03,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 08:00:03,300 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 08:00:03,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:00:03,302 INFO L85 PathProgramCache]: Analyzing trace with hash 761251653, now seen corresponding path program 1 times [2024-11-09 08:00:03,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:00:03,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282733104] [2024-11-09 08:00:03,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:00:03,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:00:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:00:03,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:00:03,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:00:03,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282733104] [2024-11-09 08:00:03,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282733104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:00:03,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:00:03,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 08:00:03,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428685730] [2024-11-09 08:00:03,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:00:03,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:00:03,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:00:03,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:00:03,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:00:03,596 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:03,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:00:03,773 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2024-11-09 08:00:03,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:00:03,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 08:00:03,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:00:03,775 INFO L225 Difference]: With dead ends: 86 [2024-11-09 08:00:03,775 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 08:00:03,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:00:03,778 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 12 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:00:03,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 159 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:00:03,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 08:00:03,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2024-11-09 08:00:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 75 states have internal predecessors, (85), 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 08:00:03,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2024-11-09 08:00:03,790 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 15 [2024-11-09 08:00:03,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:00:03,790 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2024-11-09 08:00:03,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:03,791 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2024-11-09 08:00:03,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 08:00:03,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:00:03,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:00:03,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 08:00:03,792 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 08:00:03,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:00:03,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1997696085, now seen corresponding path program 1 times [2024-11-09 08:00:03,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:00:03,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041848006] [2024-11-09 08:00:03,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:00:03,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:00:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:00:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:00:03,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:00:03,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041848006] [2024-11-09 08:00:03,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041848006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:00:03,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:00:03,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:00:03,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287447479] [2024-11-09 08:00:03,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:00:03,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:00:03,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:00:03,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:00:03,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:00:03,885 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:03,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:00:03,971 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2024-11-09 08:00:03,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:00:03,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 08:00:03,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:00:03,973 INFO L225 Difference]: With dead ends: 89 [2024-11-09 08:00:03,973 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 08:00:03,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:00:03,974 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:00:03,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 168 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:00:03,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 08:00:03,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2024-11-09 08:00:03,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.380952380952381) internal successors, (87), 77 states have internal predecessors, (87), 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 08:00:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2024-11-09 08:00:03,979 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 17 [2024-11-09 08:00:03,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:00:03,979 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2024-11-09 08:00:03,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:03,980 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2024-11-09 08:00:03,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 08:00:03,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:00:03,980 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:00:03,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 08:00:03,981 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 08:00:03,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:00:03,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2001456982, now seen corresponding path program 1 times [2024-11-09 08:00:03,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:00:03,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698577032] [2024-11-09 08:00:03,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:00:03,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:00:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:00:04,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:00:04,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:00:04,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698577032] [2024-11-09 08:00:04,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698577032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:00:04,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:00:04,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 08:00:04,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210585313] [2024-11-09 08:00:04,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:00:04,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:00:04,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:00:04,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:00:04,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:00:04,088 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:04,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:00:04,213 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2024-11-09 08:00:04,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:00:04,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 08:00:04,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:00:04,214 INFO L225 Difference]: With dead ends: 76 [2024-11-09 08:00:04,214 INFO L226 Difference]: Without dead ends: 76 [2024-11-09 08:00:04,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:00:04,215 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 12 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:00:04,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 122 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:00:04,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-09 08:00:04,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-09 08:00:04,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 75 states have internal predecessors, (85), 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 08:00:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2024-11-09 08:00:04,226 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 17 [2024-11-09 08:00:04,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:00:04,226 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2024-11-09 08:00:04,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:04,226 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2024-11-09 08:00:04,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 08:00:04,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:00:04,227 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:00:04,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 08:00:04,230 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 08:00:04,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:00:04,231 INFO L85 PathProgramCache]: Analyzing trace with hash 2001456983, now seen corresponding path program 1 times [2024-11-09 08:00:04,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:00:04,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266312228] [2024-11-09 08:00:04,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:00:04,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:00:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:00:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:00:04,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:00:04,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266312228] [2024-11-09 08:00:04,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266312228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:00:04,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:00:04,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 08:00:04,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440518560] [2024-11-09 08:00:04,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:00:04,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:00:04,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:00:04,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:00:04,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:00:04,425 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:04,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:00:04,560 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2024-11-09 08:00:04,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:00:04,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 08:00:04,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:00:04,561 INFO L225 Difference]: With dead ends: 72 [2024-11-09 08:00:04,561 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 08:00:04,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:00:04,562 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 5 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:00:04,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 139 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:00:04,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 08:00:04,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2024-11-09 08:00:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.309090909090909) internal successors, (72), 63 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2024-11-09 08:00:04,570 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 17 [2024-11-09 08:00:04,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:00:04,571 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-11-09 08:00:04,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2024-11-09 08:00:04,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 08:00:04,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:00:04,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:00:04,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 08:00:04,572 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 08:00:04,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:00:04,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1800652660, now seen corresponding path program 1 times [2024-11-09 08:00:04,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:00:04,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714212786] [2024-11-09 08:00:04,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:00:04,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:00:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 08:00:04,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 08:00:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 08:00:04,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 08:00:04,615 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 08:00:04,616 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2024-11-09 08:00:04,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2024-11-09 08:00:04,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2024-11-09 08:00:04,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2024-11-09 08:00:04,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2024-11-09 08:00:04,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2024-11-09 08:00:04,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2024-11-09 08:00:04,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2024-11-09 08:00:04,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2024-11-09 08:00:04,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2024-11-09 08:00:04,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2024-11-09 08:00:04,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2024-11-09 08:00:04,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2024-11-09 08:00:04,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2024-11-09 08:00:04,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2024-11-09 08:00:04,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2024-11-09 08:00:04,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2024-11-09 08:00:04,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2024-11-09 08:00:04,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2024-11-09 08:00:04,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2024-11-09 08:00:04,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2024-11-09 08:00:04,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2024-11-09 08:00:04,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2024-11-09 08:00:04,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2024-11-09 08:00:04,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2024-11-09 08:00:04,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (0 of 26 remaining) [2024-11-09 08:00:04,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 08:00:04,632 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:00:04,650 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 08:00:04,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 08:00:04 BoogieIcfgContainer [2024-11-09 08:00:04,655 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 08:00:04,655 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 08:00:04,655 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 08:00:04,656 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 08:00:04,656 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:00:01" (3/4) ... [2024-11-09 08:00:04,659 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 08:00:04,660 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 08:00:04,661 INFO L158 Benchmark]: Toolchain (without parser) took 4099.82ms. Allocated memory was 163.6MB in the beginning and 211.8MB in the end (delta: 48.2MB). Free memory was 105.7MB in the beginning and 148.5MB in the end (delta: -42.7MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-11-09 08:00:04,661 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 163.6MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 08:00:04,661 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.57ms. Allocated memory is still 163.6MB. Free memory was 105.3MB in the beginning and 86.0MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 08:00:04,662 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.59ms. Allocated memory is still 163.6MB. Free memory was 86.0MB in the beginning and 83.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 08:00:04,662 INFO L158 Benchmark]: Boogie Preprocessor took 50.22ms. Allocated memory is still 163.6MB. Free memory was 83.9MB in the beginning and 81.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 08:00:04,662 INFO L158 Benchmark]: RCFGBuilder took 546.06ms. Allocated memory is still 163.6MB. Free memory was 81.5MB in the beginning and 130.3MB in the end (delta: -48.8MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2024-11-09 08:00:04,662 INFO L158 Benchmark]: TraceAbstraction took 2938.11ms. Allocated memory is still 211.8MB. Free memory was 180.4MB in the beginning and 149.5MB in the end (delta: 30.9MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2024-11-09 08:00:04,663 INFO L158 Benchmark]: Witness Printer took 5.20ms. Allocated memory is still 211.8MB. Free memory was 149.5MB in the beginning and 148.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 08:00:04,664 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 163.6MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 496.57ms. Allocated memory is still 163.6MB. Free memory was 105.3MB in the beginning and 86.0MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.59ms. Allocated memory is still 163.6MB. Free memory was 86.0MB in the beginning and 83.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.22ms. Allocated memory is still 163.6MB. Free memory was 83.9MB in the beginning and 81.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 546.06ms. Allocated memory is still 163.6MB. Free memory was 81.5MB in the beginning and 130.3MB in the end (delta: -48.8MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2938.11ms. Allocated memory is still 211.8MB. Free memory was 180.4MB in the beginning and 149.5MB in the end (delta: 30.9MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. * Witness Printer took 5.20ms. Allocated memory is still 211.8MB. Free memory was 149.5MB in the beginning and 148.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] List a = (List) malloc(sizeof(struct node)); [L533] COND FALSE !(a == 0) VAL [a={-1:0}] [L534] List t; [L535] List p = a; VAL [a={-1:0}, p={-1:0}] [L536] COND FALSE !(__VERIFIER_nondet_int()) [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] p->h = 3 [L551] p = a VAL [p={-1:0}] [L552] EXPR p->h [L552] COND FALSE !(p->h == 1) [L554] EXPR p->h [L554] COND FALSE !(p->h == 2) [L556] EXPR p->h [L556] COND FALSE !(p->h != 3) [L558] return 0; VAL [\result=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: -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: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 192 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 192 mSDsluCounter, 1042 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 706 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1010 IncrementalHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 336 mSDtfsCounter, 1010 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=4, InterpolantAutomatonStates: 52, 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, 33 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 466 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 12/12 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 08:00:04,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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/list-properties/list-1.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 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 08:00:06,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 08:00:06,899 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 08:00:06,906 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 08:00:06,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 08:00:06,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 08:00:06,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 08:00:06,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 08:00:06,945 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 08:00:06,946 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 08:00:06,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 08:00:06,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 08:00:06,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 08:00:06,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 08:00:06,949 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 08:00:06,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 08:00:06,950 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 08:00:06,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 08:00:06,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 08:00:06,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 08:00:06,951 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 08:00:06,954 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 08:00:06,955 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 08:00:06,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 08:00:06,955 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 08:00:06,955 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 08:00:06,955 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 08:00:06,956 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 08:00:06,956 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 08:00:06,956 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 08:00:06,956 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 08:00:06,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 08:00:06,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 08:00:06,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 08:00:06,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 08:00:06,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:00:06,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 08:00:06,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 08:00:06,958 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 08:00:06,958 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 08:00:06,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 08:00:06,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 08:00:06,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 08:00:06,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 08:00:06,961 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 -> 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 [2024-11-09 08:00:07,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 08:00:07,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 08:00:07,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 08:00:07,295 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 08:00:07,295 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 08:00:07,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list-1.i [2024-11-09 08:00:08,833 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 08:00:09,093 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 08:00:09,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i [2024-11-09 08:00:09,112 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02c9cdb65/5ce4326d8a984559abd9ea7acd60e886/FLAGf32628b52 [2024-11-09 08:00:09,427 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02c9cdb65/5ce4326d8a984559abd9ea7acd60e886 [2024-11-09 08:00:09,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 08:00:09,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 08:00:09,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 08:00:09,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 08:00:09,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 08:00:09,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:00:09" (1/1) ... [2024-11-09 08:00:09,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f9b5dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:09, skipping insertion in model container [2024-11-09 08:00:09,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:00:09" (1/1) ... [2024-11-09 08:00:09,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 08:00:09,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:00:09,850 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 08:00:09,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:00:09,936 INFO L204 MainTranslator]: Completed translation [2024-11-09 08:00:09,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:09 WrapperNode [2024-11-09 08:00:09,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 08:00:09,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 08:00:09,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 08:00:09,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 08:00:09,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:09" (1/1) ... [2024-11-09 08:00:09,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:09" (1/1) ... [2024-11-09 08:00:09,989 INFO L138 Inliner]: procedures = 127, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-11-09 08:00:09,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 08:00:09,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 08:00:09,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 08:00:09,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 08:00:10,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:09" (1/1) ... [2024-11-09 08:00:10,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:09" (1/1) ... [2024-11-09 08:00:10,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:09" (1/1) ... [2024-11-09 08:00:10,023 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [2, 12]. 86 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 08:00:10,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:09" (1/1) ... [2024-11-09 08:00:10,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:09" (1/1) ... [2024-11-09 08:00:10,039 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:09" (1/1) ... [2024-11-09 08:00:10,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:09" (1/1) ... [2024-11-09 08:00:10,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:09" (1/1) ... [2024-11-09 08:00:10,050 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:09" (1/1) ... [2024-11-09 08:00:10,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 08:00:10,062 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 08:00:10,062 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 08:00:10,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 08:00:10,063 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:09" (1/1) ... [2024-11-09 08:00:10,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:00:10,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:00:10,090 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 08:00:10,093 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 08:00:10,127 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-09 08:00:10,128 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-09 08:00:10,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 08:00:10,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 08:00:10,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 08:00:10,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 08:00:10,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 08:00:10,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 08:00:10,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 08:00:10,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 08:00:10,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 08:00:10,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 08:00:10,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 08:00:10,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 08:00:10,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 08:00:10,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 08:00:10,245 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 08:00:10,247 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 08:00:10,272 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-09 08:00:10,611 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2024-11-09 08:00:10,611 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 08:00:10,627 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 08:00:10,627 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-09 08:00:10,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:00:10 BoogieIcfgContainer [2024-11-09 08:00:10,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 08:00:10,630 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 08:00:10,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 08:00:10,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 08:00:10,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:00:09" (1/3) ... [2024-11-09 08:00:10,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc2116c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:00:10, skipping insertion in model container [2024-11-09 08:00:10,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:00:09" (2/3) ... [2024-11-09 08:00:10,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc2116c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:00:10, skipping insertion in model container [2024-11-09 08:00:10,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:00:10" (3/3) ... [2024-11-09 08:00:10,637 INFO L112 eAbstractionObserver]: Analyzing ICFG list-1.i [2024-11-09 08:00:10,652 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 08:00:10,652 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-11-09 08:00:10,696 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 08:00:10,704 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;@40c8a69d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 08:00:10,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-09 08:00:10,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 41 states have (on average 1.951219512195122) internal successors, (80), 69 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:10,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 08:00:10,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:00:10,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:00:10,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 08:00:10,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:00:10,723 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238161, now seen corresponding path program 1 times [2024-11-09 08:00:10,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 08:00:10,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832623919] [2024-11-09 08:00:10,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:00:10,736 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 08:00:10,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 08:00:10,740 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 08:00:10,741 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 08:00:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:00:10,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 08:00:10,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:00:10,918 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 08:00:10,963 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 08:00:10,965 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:00:10,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 08:00:10,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832623919] [2024-11-09 08:00:10,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832623919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:00:10,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:00:10,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:00:10,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383740095] [2024-11-09 08:00:10,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:00:10,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:00:10,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 08:00:11,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:00:11,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:00:11,007 INFO L87 Difference]: Start difference. First operand has 71 states, 41 states have (on average 1.951219512195122) internal successors, (80), 69 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:11,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:00:11,275 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2024-11-09 08:00:11,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:00:11,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 08:00:11,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:00:11,283 INFO L225 Difference]: With dead ends: 72 [2024-11-09 08:00:11,283 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 08:00:11,284 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 08:00:11,289 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 61 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:00:11,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 66 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:00:11,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 08:00:11,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-09 08:00:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 64 states have internal predecessors, (75), 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 08:00:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2024-11-09 08:00:11,327 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 7 [2024-11-09 08:00:11,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:00:11,327 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2024-11-09 08:00:11,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:11,327 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2024-11-09 08:00:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 08:00:11,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:00:11,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:00:11,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 08:00:11,531 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 08:00:11,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 08:00:11,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:00:11,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238162, now seen corresponding path program 1 times [2024-11-09 08:00:11,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 08:00:11,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619177239] [2024-11-09 08:00:11,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:00:11,534 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 08:00:11,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 08:00:11,537 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 08:00:11,538 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 08:00:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:00:11,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 08:00:11,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:00:11,609 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 08:00:11,682 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 08:00:11,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:00:11,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 08:00:11,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619177239] [2024-11-09 08:00:11,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619177239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:00:11,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:00:11,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:00:11,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808394459] [2024-11-09 08:00:11,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:00:11,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:00:11,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 08:00:11,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:00:11,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:00:11,688 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:11,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:00:11,884 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2024-11-09 08:00:11,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:00:11,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 08:00:11,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:00:11,885 INFO L225 Difference]: With dead ends: 79 [2024-11-09 08:00:11,886 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 08:00:11,886 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 08:00:11,887 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 59 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:00:11,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 69 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:00:11,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 08:00:11,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-09 08:00:11,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.45) internal successors, (87), 78 states have internal predecessors, (87), 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 08:00:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2024-11-09 08:00:11,898 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 7 [2024-11-09 08:00:11,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:00:11,899 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2024-11-09 08:00:11,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2024-11-09 08:00:11,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 08:00:11,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:00:11,900 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:00:11,905 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 08:00:12,104 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 08:00:12,105 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 08:00:12,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:00:12,106 INFO L85 PathProgramCache]: Analyzing trace with hash -502587362, now seen corresponding path program 1 times [2024-11-09 08:00:12,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 08:00:12,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361734208] [2024-11-09 08:00:12,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:00:12,108 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 08:00:12,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 08:00:12,111 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 08:00:12,112 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 08:00:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:00:12,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 08:00:12,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:00:12,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:00:12,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:00:12,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:00:12,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 08:00:12,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361734208] [2024-11-09 08:00:12,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361734208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:00:12,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:00:12,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:00:12,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130870311] [2024-11-09 08:00:12,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:00:12,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:00:12,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 08:00:12,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:00:12,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:00:12,266 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:12,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:00:12,498 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2024-11-09 08:00:12,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:00:12,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 08:00:12,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:00:12,500 INFO L225 Difference]: With dead ends: 86 [2024-11-09 08:00:12,500 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 08:00:12,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:00:12,501 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 15 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:00:12,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 177 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:00:12,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 08:00:12,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2024-11-09 08:00:12,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 81 states have internal predecessors, (90), 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 08:00:12,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2024-11-09 08:00:12,515 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 15 [2024-11-09 08:00:12,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:00:12,515 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2024-11-09 08:00:12,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:12,515 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2024-11-09 08:00:12,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 08:00:12,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:00:12,516 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:00:12,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 08:00:12,721 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 08:00:12,722 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 08:00:12,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:00:12,723 INFO L85 PathProgramCache]: Analyzing trace with hash 761251652, now seen corresponding path program 1 times [2024-11-09 08:00:12,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 08:00:12,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472360921] [2024-11-09 08:00:12,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:00:12,727 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 08:00:12,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 08:00:12,730 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 08:00:12,731 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 08:00:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:00:12,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 08:00:12,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:00:12,794 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 08:00:12,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 08:00:12,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 08:00:12,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:00:12,859 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:00:12,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 08:00:12,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472360921] [2024-11-09 08:00:12,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [472360921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:00:12,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:00:12,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 08:00:12,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525376919] [2024-11-09 08:00:12,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:00:12,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:00:12,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 08:00:12,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:00:12,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:00:12,862 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:13,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:00:13,166 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2024-11-09 08:00:13,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:00:13,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 08:00:13,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:00:13,168 INFO L225 Difference]: With dead ends: 85 [2024-11-09 08:00:13,168 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 08:00:13,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:00:13,170 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 16 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:00:13,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 142 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 08:00:13,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 08:00:13,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 08:00:13,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 84 states have internal predecessors, (96), 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 08:00:13,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2024-11-09 08:00:13,183 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 15 [2024-11-09 08:00:13,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:00:13,183 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2024-11-09 08:00:13,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:13,184 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2024-11-09 08:00:13,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 08:00:13,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:00:13,184 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:00:13,189 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 08:00:13,385 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 08:00:13,385 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 08:00:13,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:00:13,386 INFO L85 PathProgramCache]: Analyzing trace with hash 761251653, now seen corresponding path program 1 times [2024-11-09 08:00:13,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 08:00:13,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236633564] [2024-11-09 08:00:13,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:00:13,387 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 08:00:13,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 08:00:13,390 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 08:00:13,391 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 08:00:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:00:13,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 08:00:13,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:00:13,454 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 08:00:13,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 08:00:13,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 08:00:13,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 08:00:13,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:00:13,593 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:00:13,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 08:00:13,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236633564] [2024-11-09 08:00:13,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236633564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:00:13,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:00:13,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 08:00:13,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779284273] [2024-11-09 08:00:13,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:00:13,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:00:13,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 08:00:13,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:00:13,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:00:13,596 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:13,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:00:13,930 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2024-11-09 08:00:13,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:00:13,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 08:00:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:00:13,931 INFO L225 Difference]: With dead ends: 86 [2024-11-09 08:00:13,931 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 08:00:13,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:00:13,933 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 12 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:00:13,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 159 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 08:00:13,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 08:00:13,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2024-11-09 08:00:13,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 75 states have internal predecessors, (85), 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 08:00:13,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2024-11-09 08:00:13,937 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 15 [2024-11-09 08:00:13,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:00:13,938 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2024-11-09 08:00:13,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:13,938 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2024-11-09 08:00:13,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 08:00:13,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:00:13,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:00:13,945 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 08:00:14,141 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 08:00:14,142 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 08:00:14,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:00:14,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1997696085, now seen corresponding path program 1 times [2024-11-09 08:00:14,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 08:00:14,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879573412] [2024-11-09 08:00:14,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:00:14,144 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 08:00:14,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 08:00:14,147 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 08:00:14,149 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 08:00:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:00:14,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 08:00:14,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:00:14,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:00:14,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:00:14,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:00:14,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 08:00:14,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879573412] [2024-11-09 08:00:14,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879573412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:00:14,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:00:14,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:00:14,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769699577] [2024-11-09 08:00:14,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:00:14,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:00:14,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 08:00:14,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:00:14,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:00:14,289 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:14,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:00:14,472 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2024-11-09 08:00:14,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:00:14,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 08:00:14,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:00:14,473 INFO L225 Difference]: With dead ends: 89 [2024-11-09 08:00:14,473 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 08:00:14,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:00:14,475 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:00:14,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 168 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:00:14,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 08:00:14,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2024-11-09 08:00:14,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.380952380952381) internal successors, (87), 77 states have internal predecessors, (87), 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 08:00:14,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2024-11-09 08:00:14,486 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 17 [2024-11-09 08:00:14,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:00:14,486 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2024-11-09 08:00:14,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:14,486 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2024-11-09 08:00:14,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 08:00:14,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:00:14,488 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:00:14,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 08:00:14,688 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 08:00:14,689 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 08:00:14,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:00:14,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2001456982, now seen corresponding path program 1 times [2024-11-09 08:00:14,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 08:00:14,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752348438] [2024-11-09 08:00:14,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:00:14,690 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 08:00:14,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 08:00:14,691 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 08:00:14,692 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 08:00:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:00:14,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 08:00:14,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:00:14,765 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 08:00:14,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 08:00:14,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 08:00:14,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:00:14,829 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:00:14,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 08:00:14,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752348438] [2024-11-09 08:00:14,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752348438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:00:14,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:00:14,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 08:00:14,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124912296] [2024-11-09 08:00:14,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:00:14,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:00:14,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 08:00:14,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:00:14,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:00:14,832 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:15,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:00:15,068 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2024-11-09 08:00:15,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:00:15,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 08:00:15,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:00:15,069 INFO L225 Difference]: With dead ends: 76 [2024-11-09 08:00:15,069 INFO L226 Difference]: Without dead ends: 76 [2024-11-09 08:00:15,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:00:15,070 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 12 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:00:15,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 122 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:00:15,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-09 08:00:15,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-09 08:00:15,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 75 states have internal predecessors, (85), 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 08:00:15,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2024-11-09 08:00:15,077 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 17 [2024-11-09 08:00:15,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:00:15,077 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2024-11-09 08:00:15,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:15,082 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2024-11-09 08:00:15,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 08:00:15,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:00:15,083 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:00:15,088 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 08:00:15,286 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 08:00:15,286 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 08:00:15,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:00:15,287 INFO L85 PathProgramCache]: Analyzing trace with hash 2001456983, now seen corresponding path program 1 times [2024-11-09 08:00:15,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 08:00:15,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550545898] [2024-11-09 08:00:15,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:00:15,288 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 08:00:15,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 08:00:15,289 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 08:00:15,290 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 08:00:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:00:15,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 08:00:15,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:00:15,368 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 08:00:15,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 08:00:15,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 08:00:15,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 08:00:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:00:15,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:00:15,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 08:00:15,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [550545898] [2024-11-09 08:00:15,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [550545898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:00:15,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:00:15,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 08:00:15,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635528223] [2024-11-09 08:00:15,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:00:15,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:00:15,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 08:00:15,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:00:15,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:00:15,476 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:15,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:00:15,733 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2024-11-09 08:00:15,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:00:15,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 08:00:15,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:00:15,734 INFO L225 Difference]: With dead ends: 72 [2024-11-09 08:00:15,734 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 08:00:15,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:00:15,735 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 5 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:00:15,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 139 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:00:15,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 08:00:15,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2024-11-09 08:00:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.309090909090909) internal successors, (72), 63 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2024-11-09 08:00:15,738 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 17 [2024-11-09 08:00:15,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:00:15,738 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-11-09 08:00:15,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:15,739 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2024-11-09 08:00:15,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 08:00:15,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:00:15,740 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:00:15,743 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 08:00:15,942 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 08:00:15,943 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 08:00:15,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:00:15,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1800652660, now seen corresponding path program 1 times [2024-11-09 08:00:15,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 08:00:15,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727234199] [2024-11-09 08:00:15,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:00:15,944 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 08:00:15,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 08:00:15,945 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 08:00:15,947 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 08:00:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 08:00:15,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 08:00:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 08:00:16,037 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 08:00:16,037 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 08:00:16,038 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2024-11-09 08:00:16,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2024-11-09 08:00:16,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2024-11-09 08:00:16,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2024-11-09 08:00:16,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2024-11-09 08:00:16,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2024-11-09 08:00:16,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2024-11-09 08:00:16,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2024-11-09 08:00:16,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2024-11-09 08:00:16,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2024-11-09 08:00:16,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2024-11-09 08:00:16,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2024-11-09 08:00:16,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2024-11-09 08:00:16,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2024-11-09 08:00:16,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2024-11-09 08:00:16,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2024-11-09 08:00:16,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2024-11-09 08:00:16,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2024-11-09 08:00:16,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2024-11-09 08:00:16,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2024-11-09 08:00:16,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2024-11-09 08:00:16,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2024-11-09 08:00:16,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2024-11-09 08:00:16,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2024-11-09 08:00:16,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2024-11-09 08:00:16,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (0 of 26 remaining) [2024-11-09 08:00:16,051 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 08:00:16,243 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 08:00:16,246 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:00:16,259 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 08:00:16,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 08:00:16 BoogieIcfgContainer [2024-11-09 08:00:16,262 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 08:00:16,263 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 08:00:16,263 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 08:00:16,263 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 08:00:16,263 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:00:10" (3/4) ... [2024-11-09 08:00:16,265 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 08:00:16,266 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 08:00:16,267 INFO L158 Benchmark]: Toolchain (without parser) took 6837.04ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 43.2MB in the beginning and 61.0MB in the end (delta: -17.7MB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. [2024-11-09 08:00:16,267 INFO L158 Benchmark]: CDTParser took 0.94ms. Allocated memory is still 48.2MB. Free memory was 28.9MB in the beginning and 28.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 08:00:16,267 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.77ms. Allocated memory is still 71.3MB. Free memory was 43.0MB in the beginning and 43.1MB in the end (delta: -172.5kB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-11-09 08:00:16,268 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.09ms. Allocated memory is still 71.3MB. Free memory was 43.1MB in the beginning and 41.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 08:00:16,268 INFO L158 Benchmark]: Boogie Preprocessor took 70.74ms. Allocated memory is still 71.3MB. Free memory was 41.1MB in the beginning and 38.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 08:00:16,268 INFO L158 Benchmark]: RCFGBuilder took 565.51ms. Allocated memory is still 71.3MB. Free memory was 38.5MB in the beginning and 35.4MB in the end (delta: 3.1MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-11-09 08:00:16,268 INFO L158 Benchmark]: TraceAbstraction took 5632.69ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 34.7MB in the beginning and 61.7MB in the end (delta: -27.0MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2024-11-09 08:00:16,269 INFO L158 Benchmark]: Witness Printer took 3.61ms. Allocated memory is still 90.2MB. Free memory is still 61.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 08:00:16,270 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.94ms. Allocated memory is still 48.2MB. Free memory was 28.9MB in the beginning and 28.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 506.77ms. Allocated memory is still 71.3MB. Free memory was 43.0MB in the beginning and 43.1MB in the end (delta: -172.5kB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.09ms. Allocated memory is still 71.3MB. Free memory was 43.1MB in the beginning and 41.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.74ms. Allocated memory is still 71.3MB. Free memory was 41.1MB in the beginning and 38.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 565.51ms. Allocated memory is still 71.3MB. Free memory was 38.5MB in the beginning and 35.4MB in the end (delta: 3.1MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5632.69ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 34.7MB in the beginning and 61.7MB in the end (delta: -27.0MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * Witness Printer took 3.61ms. Allocated memory is still 90.2MB. Free memory is still 61.0MB. 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: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] List a = (List) malloc(sizeof(struct node)); [L533] COND FALSE !(a == 0) VAL [a={6:0}] [L534] List t; [L535] List p = a; VAL [a={6:0}, p={6:0}] [L536] COND FALSE !(__VERIFIER_nondet_int()) [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] p->h = 3 [L551] p = a VAL [p={6:0}] [L552] EXPR p->h [L552] COND FALSE !(p->h == 1) [L554] EXPR p->h [L554] COND FALSE !(p->h == 2) [L556] EXPR p->h [L556] COND FALSE !(p->h != 3) [L558] return 0; VAL [\result=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: -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: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 192 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 192 mSDsluCounter, 1042 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 706 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1010 IncrementalHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 336 mSDtfsCounter, 1010 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=4, InterpolantAutomatonStates: 52, 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, 33 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 504 SizeOfPredicates, 15 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 12/12 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 08:00:16,302 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