./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:13:34,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:13:34,650 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:13:34,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:13:34,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:13:34,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:13:34,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:13:34,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:13:34,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:13:34,677 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:13:34,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:13:34,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:13:34,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:13:34,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:13:34,679 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:13:34,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:13:34,680 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:13:34,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:13:34,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:13:34,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:13:34,681 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:13:34,684 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:13:34,684 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:13:34,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:13:34,685 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:13:34,685 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:13:34,685 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:13:34,686 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:13:34,686 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:13:34,686 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:13:34,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:13:34,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:13:34,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:13:34,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:13:34,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:13:34,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:13:34,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:13:34,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:13:34,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:13:34,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:13:34,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:13:34,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:13:34,690 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-clean/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-clean/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 -> 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da [2024-10-11 18:13:34,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:13:34,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:13:34,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:13:34,934 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:13:34,934 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:13:34,936 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i [2024-10-11 18:13:36,286 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:13:36,502 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:13:36,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i [2024-10-11 18:13:36,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b37e257ce/766ff2d57f984c03aa3ae412b73215c4/FLAG504b90070 [2024-10-11 18:13:36,860 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b37e257ce/766ff2d57f984c03aa3ae412b73215c4 [2024-10-11 18:13:36,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:13:36,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:13:36,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:13:36,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:13:36,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:13:36,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:13:36" (1/1) ... [2024-10-11 18:13:36,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1509f046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:36, skipping insertion in model container [2024-10-11 18:13:36,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:13:36" (1/1) ... [2024-10-11 18:13:36,918 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:13:37,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:13:37,235 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:13:37,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:13:37,303 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:13:37,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:37 WrapperNode [2024-10-11 18:13:37,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:13:37,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:13:37,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:13:37,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:13:37,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:37" (1/1) ... [2024-10-11 18:13:37,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:37" (1/1) ... [2024-10-11 18:13:37,340 INFO L138 Inliner]: procedures = 124, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2024-10-11 18:13:37,341 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:13:37,341 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:13:37,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:13:37,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:13:37,351 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:37" (1/1) ... [2024-10-11 18:13:37,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:37" (1/1) ... [2024-10-11 18:13:37,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:37" (1/1) ... [2024-10-11 18:13:37,367 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-10-11 18:13:37,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:37" (1/1) ... [2024-10-11 18:13:37,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:37" (1/1) ... [2024-10-11 18:13:37,376 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:37" (1/1) ... [2024-10-11 18:13:37,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:37" (1/1) ... [2024-10-11 18:13:37,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:37" (1/1) ... [2024-10-11 18:13:37,385 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:37" (1/1) ... [2024-10-11 18:13:37,387 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:13:37,388 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:13:37,389 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:13:37,389 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:13:37,389 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:37" (1/1) ... [2024-10-11 18:13:37,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:13:37,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:13:37,428 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:13:37,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:13:37,472 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-10-11 18:13:37,472 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-10-11 18:13:37,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 18:13:37,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 18:13:37,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 18:13:37,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 18:13:37,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:13:37,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:13:37,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:13:37,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:13:37,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:13:37,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:13:37,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:13:37,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 18:13:37,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:13:37,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:13:37,573 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:13:37,574 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:13:37,592 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-10-11 18:13:37,782 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-10-11 18:13:37,782 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:13:37,830 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:13:37,830 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 18:13:37,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:13:37 BoogieIcfgContainer [2024-10-11 18:13:37,831 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:13:37,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:13:37,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:13:37,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:13:37,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:13:36" (1/3) ... [2024-10-11 18:13:37,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2a4e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:13:37, skipping insertion in model container [2024-10-11 18:13:37,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:37" (2/3) ... [2024-10-11 18:13:37,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2a4e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:13:37, skipping insertion in model container [2024-10-11 18:13:37,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:13:37" (3/3) ... [2024-10-11 18:13:37,843 INFO L112 eAbstractionObserver]: Analyzing ICFG list_flag-2.i [2024-10-11 18:13:37,860 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:13:37,860 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-10-11 18:13:37,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:13:37,919 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;@485ae610, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:13:37,920 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-10-11 18:13:37,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 51 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:37,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:13:37,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:13:37,932 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:13:37,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-10-11 18:13:37,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:13:37,938 INFO L85 PathProgramCache]: Analyzing trace with hash 152784394, now seen corresponding path program 1 times [2024-10-11 18:13:37,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:13:37,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632449866] [2024-10-11 18:13:37,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:37,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:13:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:38,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:13:38,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632449866] [2024-10-11 18:13:38,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632449866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:13:38,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:13:38,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:13:38,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631502709] [2024-10-11 18:13:38,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:13:38,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 18:13:38,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:13:38,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 18:13:38,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 18:13:38,130 INFO L87 Difference]: Start difference. First operand has 53 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 51 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:38,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:13:38,167 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2024-10-11 18:13:38,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 18:13:38,170 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 18:13:38,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:13:38,175 INFO L225 Difference]: With dead ends: 52 [2024-10-11 18:13:38,175 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 18:13:38,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 18:13:38,180 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:13:38,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:13:38,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 18:13:38,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-11 18:13:38,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 2.04) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 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-10-11 18:13:38,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2024-10-11 18:13:38,217 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 5 [2024-10-11 18:13:38,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:13:38,217 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2024-10-11 18:13:38,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2024-10-11 18:13:38,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 18:13:38,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:13:38,218 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 18:13:38,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:13:38,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-10-11 18:13:38,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:13:38,220 INFO L85 PathProgramCache]: Analyzing trace with hash 441315247, now seen corresponding path program 1 times [2024-10-11 18:13:38,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:13:38,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777821277] [2024-10-11 18:13:38,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:38,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:13:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:38,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:13:38,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777821277] [2024-10-11 18:13:38,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777821277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:13:38,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:13:38,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:13:38,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315576287] [2024-10-11 18:13:38,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:13:38,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:13:38,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:13:38,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:13:38,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:13:38,412 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:38,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:13:38,545 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2024-10-11 18:13:38,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:13:38,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 18:13:38,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:13:38,547 INFO L225 Difference]: With dead ends: 50 [2024-10-11 18:13:38,547 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 18:13:38,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:13:38,549 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 44 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:13:38,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 35 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:13:38,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 18:13:38,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-11 18:13:38,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 49 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2024-10-11 18:13:38,561 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 6 [2024-10-11 18:13:38,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:13:38,561 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2024-10-11 18:13:38,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:38,562 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2024-10-11 18:13:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 18:13:38,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:13:38,563 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 18:13:38,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:13:38,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-10-11 18:13:38,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:13:38,564 INFO L85 PathProgramCache]: Analyzing trace with hash 441315248, now seen corresponding path program 1 times [2024-10-11 18:13:38,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:13:38,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173036705] [2024-10-11 18:13:38,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:38,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:13:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:38,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:38,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:13:38,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173036705] [2024-10-11 18:13:38,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173036705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:13:38,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:13:38,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:13:38,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68493213] [2024-10-11 18:13:38,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:13:38,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:13:38,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:13:38,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:13:38,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:13:38,739 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:38,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:13:38,856 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2024-10-11 18:13:38,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:13:38,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 18:13:38,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:13:38,857 INFO L225 Difference]: With dead ends: 59 [2024-10-11 18:13:38,857 INFO L226 Difference]: Without dead ends: 59 [2024-10-11 18:13:38,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:13:38,859 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 44 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:13:38,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 52 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:13:38,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-11 18:13:38,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-11 18:13:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 58 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2024-10-11 18:13:38,869 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 6 [2024-10-11 18:13:38,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:13:38,869 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2024-10-11 18:13:38,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2024-10-11 18:13:38,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:13:38,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:13:38,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:13:38,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:13:38,870 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-10-11 18:13:38,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:13:38,871 INFO L85 PathProgramCache]: Analyzing trace with hash -805543949, now seen corresponding path program 1 times [2024-10-11 18:13:38,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:13:38,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621405421] [2024-10-11 18:13:38,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:38,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:13:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:39,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:39,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:13:39,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621405421] [2024-10-11 18:13:39,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621405421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:13:39,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:13:39,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:13:39,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117929421] [2024-10-11 18:13:39,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:13:39,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:13:39,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:13:39,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:13:39,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:13:39,066 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-10-11 18:13:39,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:13:39,156 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2024-10-11 18:13:39,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:13:39,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-10-11 18:13:39,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:13:39,158 INFO L225 Difference]: With dead ends: 66 [2024-10-11 18:13:39,158 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 18:13:39,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:13:39,160 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:13:39,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 99 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:13:39,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 18:13:39,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2024-10-11 18:13:39,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 61 states have internal predecessors, (71), 0 states have call successors, (0), 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-10-11 18:13:39,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2024-10-11 18:13:39,170 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 11 [2024-10-11 18:13:39,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:13:39,171 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2024-10-11 18:13:39,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-10-11 18:13:39,171 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2024-10-11 18:13:39,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:13:39,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:13:39,175 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:13:39,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:13:39,175 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-10-11 18:13:39,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:13:39,176 INFO L85 PathProgramCache]: Analyzing trace with hash -825583796, now seen corresponding path program 1 times [2024-10-11 18:13:39,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:13:39,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758744536] [2024-10-11 18:13:39,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:39,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:13:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:39,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:13:39,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758744536] [2024-10-11 18:13:39,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758744536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:13:39,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:13:39,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:13:39,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069334868] [2024-10-11 18:13:39,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:13:39,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:13:39,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:13:39,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:13:39,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:13:39,307 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-10-11 18:13:39,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:13:39,411 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2024-10-11 18:13:39,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:13:39,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-10-11 18:13:39,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:13:39,412 INFO L225 Difference]: With dead ends: 73 [2024-10-11 18:13:39,412 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 18:13:39,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:13:39,413 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:13:39,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 95 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:13:39,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 18:13:39,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2024-10-11 18:13:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.553191489361702) internal successors, (73), 63 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:39,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2024-10-11 18:13:39,440 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 11 [2024-10-11 18:13:39,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:13:39,441 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2024-10-11 18:13:39,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-10-11 18:13:39,441 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2024-10-11 18:13:39,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 18:13:39,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:13:39,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:13:39,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:13:39,442 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-10-11 18:13:39,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:13:39,443 INFO L85 PathProgramCache]: Analyzing trace with hash 797851177, now seen corresponding path program 1 times [2024-10-11 18:13:39,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:13:39,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539187582] [2024-10-11 18:13:39,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:39,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:13:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 18:13:39,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 18:13:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 18:13:39,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 18:13:39,507 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 18:13:39,508 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (21 of 22 remaining) [2024-10-11 18:13:39,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 22 remaining) [2024-10-11 18:13:39,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 22 remaining) [2024-10-11 18:13:39,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 22 remaining) [2024-10-11 18:13:39,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 22 remaining) [2024-10-11 18:13:39,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 22 remaining) [2024-10-11 18:13:39,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 22 remaining) [2024-10-11 18:13:39,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 22 remaining) [2024-10-11 18:13:39,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 22 remaining) [2024-10-11 18:13:39,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 22 remaining) [2024-10-11 18:13:39,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 22 remaining) [2024-10-11 18:13:39,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 22 remaining) [2024-10-11 18:13:39,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 22 remaining) [2024-10-11 18:13:39,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 22 remaining) [2024-10-11 18:13:39,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 22 remaining) [2024-10-11 18:13:39,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 22 remaining) [2024-10-11 18:13:39,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 22 remaining) [2024-10-11 18:13:39,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 22 remaining) [2024-10-11 18:13:39,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 22 remaining) [2024-10-11 18:13:39,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 22 remaining) [2024-10-11 18:13:39,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 22 remaining) [2024-10-11 18:13:39,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 22 remaining) [2024-10-11 18:13:39,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 18:13:39,525 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 18:13:39,547 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 18:13:39,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:13:39 BoogieIcfgContainer [2024-10-11 18:13:39,553 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 18:13:39,554 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 18:13:39,554 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 18:13:39,555 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 18:13:39,555 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:13:37" (3/4) ... [2024-10-11 18:13:39,557 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 18:13:39,558 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 18:13:39,559 INFO L158 Benchmark]: Toolchain (without parser) took 2693.60ms. Allocated memory was 127.9MB in the beginning and 201.3MB in the end (delta: 73.4MB). Free memory was 56.5MB in the beginning and 164.1MB in the end (delta: -107.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:13:39,561 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 127.9MB. Free memory was 89.7MB in the beginning and 89.5MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:13:39,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.15ms. Allocated memory was 127.9MB in the beginning and 167.8MB in the end (delta: 39.8MB). Free memory was 56.3MB in the beginning and 130.5MB in the end (delta: -74.2MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2024-10-11 18:13:39,562 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.31ms. Allocated memory is still 167.8MB. Free memory was 130.5MB in the beginning and 128.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 18:13:39,562 INFO L158 Benchmark]: Boogie Preprocessor took 45.94ms. Allocated memory is still 167.8MB. Free memory was 128.4MB in the beginning and 126.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 18:13:39,562 INFO L158 Benchmark]: RCFGBuilder took 442.33ms. Allocated memory is still 167.8MB. Free memory was 126.3MB in the beginning and 106.2MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 18:13:39,562 INFO L158 Benchmark]: TraceAbstraction took 1718.80ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 105.3MB in the beginning and 164.1MB in the end (delta: -58.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:13:39,563 INFO L158 Benchmark]: Witness Printer took 4.66ms. Allocated memory is still 201.3MB. Free memory is still 164.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:13:39,565 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 127.9MB. Free memory was 89.7MB in the beginning and 89.5MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 437.15ms. Allocated memory was 127.9MB in the beginning and 167.8MB in the end (delta: 39.8MB). Free memory was 56.3MB in the beginning and 130.5MB in the end (delta: -74.2MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.31ms. Allocated memory is still 167.8MB. Free memory was 130.5MB in the beginning and 128.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.94ms. Allocated memory is still 167.8MB. Free memory was 128.4MB in the beginning and 126.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 442.33ms. Allocated memory is still 167.8MB. Free memory was 126.3MB in the beginning and 106.2MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1718.80ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 105.3MB in the beginning and 164.1MB in the end (delta: -58.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.66ms. Allocated memory is still 201.3MB. Free memory is still 164.1MB. 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] int flag = __VERIFIER_nondet_int(); [L533] List p, a, t; [L534] a = (List) malloc(sizeof(struct node)) [L535] COND FALSE !(a == 0) VAL [a={-1:0}, flag=0] [L536] p = a VAL [a={-1:0}, flag=0, p={-1:0}] [L537] COND FALSE !(__VERIFIER_nondet_int()) [L548] p->h = 3 [L549] p = a VAL [flag=0, p={-1:0}] [L550] COND FALSE !(\read(flag)) [L554] EXPR p->h [L554] COND FALSE !(p->h == 2) [L556] EXPR p->h [L556] COND FALSE !(p->h != 3) - 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, 54 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 332 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 173 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 304 IncrementalHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 159 mSDtfsCounter, 304 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=5, InterpolantAutomatonStates: 23, 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, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 161 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2/2 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-10-11 18:13:39,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:13:41,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:13:41,835 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 18:13:41,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:13:41,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:13:41,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:13:41,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:13:41,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:13:41,873 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:13:41,876 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:13:41,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:13:41,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:13:41,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:13:41,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:13:41,878 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:13:41,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:13:41,878 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:13:41,878 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:13:41,878 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:13:41,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:13:41,879 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:13:41,880 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:13:41,881 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:13:41,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:13:41,881 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:13:41,882 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 18:13:41,882 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:13:41,882 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 18:13:41,882 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:13:41,883 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:13:41,883 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:13:41,883 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:13:41,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:13:41,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:13:41,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:13:41,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:13:41,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:13:41,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:13:41,887 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 18:13:41,887 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 18:13:41,887 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:13:41,888 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:13:41,888 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:13:41,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:13:41,888 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 18:13:41,889 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-clean/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-clean/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 -> 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da [2024-10-11 18:13:42,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:13:42,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:13:42,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:13:42,242 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:13:42,242 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:13:42,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i [2024-10-11 18:13:43,785 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:13:44,013 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:13:44,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i [2024-10-11 18:13:44,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/59024b76a/690b62498fe740b298b47077b7841dbc/FLAGd8c52c5ef [2024-10-11 18:13:44,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/59024b76a/690b62498fe740b298b47077b7841dbc [2024-10-11 18:13:44,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:13:44,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:13:44,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:13:44,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:13:44,365 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:13:44,366 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:13:44" (1/1) ... [2024-10-11 18:13:44,367 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18b9a3a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:44, skipping insertion in model container [2024-10-11 18:13:44,367 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:13:44" (1/1) ... [2024-10-11 18:13:44,401 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:13:44,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:13:44,731 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:13:44,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:13:44,812 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:13:44,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:44 WrapperNode [2024-10-11 18:13:44,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:13:44,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:13:44,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:13:44,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:13:44,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:44" (1/1) ... [2024-10-11 18:13:44,843 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:44" (1/1) ... [2024-10-11 18:13:44,872 INFO L138 Inliner]: procedures = 127, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2024-10-11 18:13:44,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:13:44,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:13:44,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:13:44,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:13:44,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:44" (1/1) ... [2024-10-11 18:13:44,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:44" (1/1) ... [2024-10-11 18:13:44,886 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:44" (1/1) ... [2024-10-11 18:13:44,908 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-10-11 18:13:44,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:44" (1/1) ... [2024-10-11 18:13:44,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:44" (1/1) ... [2024-10-11 18:13:44,918 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:44" (1/1) ... [2024-10-11 18:13:44,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:44" (1/1) ... [2024-10-11 18:13:44,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:44" (1/1) ... [2024-10-11 18:13:44,933 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:44" (1/1) ... [2024-10-11 18:13:44,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:13:44,942 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:13:44,942 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:13:44,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:13:44,955 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:44" (1/1) ... [2024-10-11 18:13:44,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:13:44,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:13:44,985 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:13:44,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:13:45,038 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-10-11 18:13:45,039 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-10-11 18:13:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 18:13:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 18:13:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:13:45,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:13:45,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:13:45,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:13:45,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:13:45,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:13:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 18:13:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 18:13:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 18:13:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 18:13:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:13:45,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:13:45,189 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:13:45,193 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:13:45,224 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-10-11 18:13:45,497 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-10-11 18:13:45,498 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:13:45,535 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:13:45,535 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 18:13:45,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:13:45 BoogieIcfgContainer [2024-10-11 18:13:45,535 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:13:45,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:13:45,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:13:45,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:13:45,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:13:44" (1/3) ... [2024-10-11 18:13:45,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f54a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:13:45, skipping insertion in model container [2024-10-11 18:13:45,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:44" (2/3) ... [2024-10-11 18:13:45,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f54a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:13:45, skipping insertion in model container [2024-10-11 18:13:45,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:13:45" (3/3) ... [2024-10-11 18:13:45,545 INFO L112 eAbstractionObserver]: Analyzing ICFG list_flag-2.i [2024-10-11 18:13:45,564 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:13:45,564 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-10-11 18:13:45,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:13:45,617 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;@4a2772e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:13:45,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-10-11 18:13:45,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 51 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:45,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:13:45,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:13:45,628 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:13:45,628 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-10-11 18:13:45,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:13:45,633 INFO L85 PathProgramCache]: Analyzing trace with hash 152784394, now seen corresponding path program 1 times [2024-10-11 18:13:45,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:13:45,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616895202] [2024-10-11 18:13:45,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:45,646 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-10-11 18:13:45,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:13:45,649 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 18:13:45,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 18:13:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:45,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 18:13:45,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:13:45,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:45,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:13:45,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:13:45,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616895202] [2024-10-11 18:13:45,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616895202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:13:45,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:13:45,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:13:45,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828676131] [2024-10-11 18:13:45,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:13:45,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 18:13:45,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:13:45,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 18:13:45,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 18:13:45,806 INFO L87 Difference]: Start difference. First operand has 53 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 51 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:45,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:13:45,847 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2024-10-11 18:13:45,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 18:13:45,850 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 18:13:45,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:13:45,856 INFO L225 Difference]: With dead ends: 52 [2024-10-11 18:13:45,856 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 18:13:45,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 18:13:45,862 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:13:45,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:13:45,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 18:13:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-11 18:13:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 2.04) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 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-10-11 18:13:45,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2024-10-11 18:13:45,900 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 5 [2024-10-11 18:13:45,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:13:45,900 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2024-10-11 18:13:45,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:45,901 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2024-10-11 18:13:45,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 18:13:45,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:13:45,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 18:13:45,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 18:13:46,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 18:13:46,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-10-11 18:13:46,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:13:46,105 INFO L85 PathProgramCache]: Analyzing trace with hash 441315247, now seen corresponding path program 1 times [2024-10-11 18:13:46,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:13:46,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699762668] [2024-10-11 18:13:46,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:46,105 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-10-11 18:13:46,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:13:46,109 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 18:13:46,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 18:13:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:46,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:13:46,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:13:46,207 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-10-11 18:13:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:46,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:13:46,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:13:46,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699762668] [2024-10-11 18:13:46,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699762668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:13:46,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:13:46,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:13:46,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139620398] [2024-10-11 18:13:46,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:13:46,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:13:46,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:13:46,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:13:46,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:13:46,258 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:46,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:13:46,450 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2024-10-11 18:13:46,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:13:46,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 18:13:46,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:13:46,453 INFO L225 Difference]: With dead ends: 50 [2024-10-11 18:13:46,453 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 18:13:46,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-11 18:13:46,454 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 44 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:13:46,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 35 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:13:46,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 18:13:46,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-11 18:13:46,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 49 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2024-10-11 18:13:46,461 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 6 [2024-10-11 18:13:46,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:13:46,461 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2024-10-11 18:13:46,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:46,462 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2024-10-11 18:13:46,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 18:13:46,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:13:46,462 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 18:13:46,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 18:13:46,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 18:13:46,665 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-10-11 18:13:46,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:13:46,666 INFO L85 PathProgramCache]: Analyzing trace with hash 441315248, now seen corresponding path program 1 times [2024-10-11 18:13:46,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:13:46,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033820463] [2024-10-11 18:13:46,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:46,667 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-10-11 18:13:46,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:13:46,669 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 18:13:46,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 18:13:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:46,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 18:13:46,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:13:46,740 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-10-11 18:13:46,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:46,816 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:13:46,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:13:46,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033820463] [2024-10-11 18:13:46,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033820463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:13:46,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:13:46,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:13:46,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684353900] [2024-10-11 18:13:46,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:13:46,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:13:46,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:13:46,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:13:46,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:13:46,822 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:47,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:13:47,047 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2024-10-11 18:13:47,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:13:47,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 18:13:47,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:13:47,048 INFO L225 Difference]: With dead ends: 59 [2024-10-11 18:13:47,048 INFO L226 Difference]: Without dead ends: 59 [2024-10-11 18:13:47,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-11 18:13:47,050 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 44 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:13:47,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 52 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:13:47,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-11 18:13:47,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-11 18:13:47,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 58 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:47,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2024-10-11 18:13:47,059 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 6 [2024-10-11 18:13:47,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:13:47,060 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2024-10-11 18:13:47,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:47,060 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2024-10-11 18:13:47,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:13:47,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:13:47,061 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:13:47,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 18:13:47,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-10-11 18:13:47,262 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-10-11 18:13:47,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:13:47,263 INFO L85 PathProgramCache]: Analyzing trace with hash -805543949, now seen corresponding path program 1 times [2024-10-11 18:13:47,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:13:47,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501992833] [2024-10-11 18:13:47,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:47,264 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-10-11 18:13:47,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:13:47,267 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-10-11 18:13:47,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 18:13:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:47,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 18:13:47,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:13:47,381 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-10-11 18:13:47,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:47,414 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:13:47,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:13:47,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501992833] [2024-10-11 18:13:47,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501992833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:13:47,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:13:47,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:13:47,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295872409] [2024-10-11 18:13:47,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:13:47,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:13:47,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:13:47,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:13:47,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:13:47,419 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-10-11 18:13:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:13:47,624 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2024-10-11 18:13:47,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:13:47,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-10-11 18:13:47,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:13:47,625 INFO L225 Difference]: With dead ends: 66 [2024-10-11 18:13:47,626 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 18:13:47,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:13:47,627 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:13:47,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 99 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:13:47,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 18:13:47,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2024-10-11 18:13:47,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 61 states have internal predecessors, (71), 0 states have call successors, (0), 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-10-11 18:13:47,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2024-10-11 18:13:47,634 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 11 [2024-10-11 18:13:47,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:13:47,634 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2024-10-11 18:13:47,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-10-11 18:13:47,634 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2024-10-11 18:13:47,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:13:47,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:13:47,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:13:47,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 18:13:47,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-10-11 18:13:47,836 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-10-11 18:13:47,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:13:47,837 INFO L85 PathProgramCache]: Analyzing trace with hash -825583796, now seen corresponding path program 1 times [2024-10-11 18:13:47,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:13:47,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774872033] [2024-10-11 18:13:47,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:47,837 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-10-11 18:13:47,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:13:47,841 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-10-11 18:13:47,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 18:13:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:47,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 18:13:47,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:13:47,925 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-10-11 18:13:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:47,949 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:13:47,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:13:47,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774872033] [2024-10-11 18:13:47,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774872033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:13:47,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:13:47,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:13:47,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315035398] [2024-10-11 18:13:47,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:13:47,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:13:47,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:13:47,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:13:47,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:13:47,951 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-10-11 18:13:48,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:13:48,162 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2024-10-11 18:13:48,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:13:48,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-10-11 18:13:48,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:13:48,164 INFO L225 Difference]: With dead ends: 65 [2024-10-11 18:13:48,165 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 18:13:48,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:13:48,166 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 13 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:13:48,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 99 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:13:48,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 18:13:48,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2024-10-11 18:13:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.553191489361702) internal successors, (73), 63 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:48,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2024-10-11 18:13:48,173 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 11 [2024-10-11 18:13:48,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:13:48,173 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2024-10-11 18:13:48,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-10-11 18:13:48,176 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2024-10-11 18:13:48,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 18:13:48,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:13:48,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:13:48,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 18:13:48,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-10-11 18:13:48,377 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-10-11 18:13:48,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:13:48,378 INFO L85 PathProgramCache]: Analyzing trace with hash 797851177, now seen corresponding path program 1 times [2024-10-11 18:13:48,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:13:48,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238611532] [2024-10-11 18:13:48,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:48,378 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-10-11 18:13:48,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:13:48,379 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-10-11 18:13:48,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 18:13:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 18:13:48,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 18:13:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 18:13:48,484 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-11 18:13:48,485 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 18:13:48,486 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (21 of 22 remaining) [2024-10-11 18:13:48,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 22 remaining) [2024-10-11 18:13:48,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 22 remaining) [2024-10-11 18:13:48,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 22 remaining) [2024-10-11 18:13:48,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 22 remaining) [2024-10-11 18:13:48,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 22 remaining) [2024-10-11 18:13:48,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 22 remaining) [2024-10-11 18:13:48,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 22 remaining) [2024-10-11 18:13:48,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 22 remaining) [2024-10-11 18:13:48,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 22 remaining) [2024-10-11 18:13:48,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 22 remaining) [2024-10-11 18:13:48,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 22 remaining) [2024-10-11 18:13:48,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 22 remaining) [2024-10-11 18:13:48,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 22 remaining) [2024-10-11 18:13:48,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 22 remaining) [2024-10-11 18:13:48,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 22 remaining) [2024-10-11 18:13:48,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 22 remaining) [2024-10-11 18:13:48,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 22 remaining) [2024-10-11 18:13:48,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 22 remaining) [2024-10-11 18:13:48,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 22 remaining) [2024-10-11 18:13:48,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 22 remaining) [2024-10-11 18:13:48,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 22 remaining) [2024-10-11 18:13:48,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-11 18:13:48,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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-10-11 18:13:48,701 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 18:13:48,741 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 18:13:48,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:13:48 BoogieIcfgContainer [2024-10-11 18:13:48,759 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 18:13:48,759 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 18:13:48,759 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 18:13:48,759 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 18:13:48,760 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:13:45" (3/4) ... [2024-10-11 18:13:48,768 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 18:13:48,773 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 18:13:48,775 INFO L158 Benchmark]: Toolchain (without parser) took 4416.67ms. Allocated memory was 65.0MB in the beginning and 104.9MB in the end (delta: 39.8MB). Free memory was 36.0MB in the beginning and 80.3MB in the end (delta: -44.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:13:48,776 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 48.2MB. Free memory is still 25.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:13:48,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.11ms. Allocated memory is still 65.0MB. Free memory was 35.8MB in the beginning and 32.0MB in the end (delta: 3.8MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-10-11 18:13:48,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.09ms. Allocated memory is still 65.0MB. Free memory was 32.0MB in the beginning and 29.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 18:13:48,777 INFO L158 Benchmark]: Boogie Preprocessor took 66.39ms. Allocated memory is still 65.0MB. Free memory was 29.9MB in the beginning and 27.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 18:13:48,777 INFO L158 Benchmark]: RCFGBuilder took 593.31ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 27.4MB in the beginning and 42.7MB in the end (delta: -15.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 18:13:48,777 INFO L158 Benchmark]: TraceAbstraction took 3221.52ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 42.2MB in the beginning and 80.3MB in the end (delta: -38.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:13:48,778 INFO L158 Benchmark]: Witness Printer took 14.53ms. Allocated memory is still 104.9MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:13:48,779 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 48.2MB. Free memory is still 25.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.11ms. Allocated memory is still 65.0MB. Free memory was 35.8MB in the beginning and 32.0MB in the end (delta: 3.8MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.09ms. Allocated memory is still 65.0MB. Free memory was 32.0MB in the beginning and 29.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.39ms. Allocated memory is still 65.0MB. Free memory was 29.9MB in the beginning and 27.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 593.31ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 27.4MB in the beginning and 42.7MB in the end (delta: -15.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3221.52ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 42.2MB in the beginning and 80.3MB in the end (delta: -38.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 14.53ms. Allocated memory is still 104.9MB. Free memory is still 80.3MB. 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] int flag = __VERIFIER_nondet_int(); [L533] List p, a, t; [L534] a = (List) malloc(sizeof(struct node)) [L535] COND FALSE !(a == 0) VAL [a={6:0}] [L536] p = a VAL [a={6:0}, p={6:0}] [L537] COND FALSE !(__VERIFIER_nondet_int()) [L548] p->h = 3 [L549] p = a VAL [p={6:0}] [L550] COND FALSE !(\read(flag)) [L554] EXPR p->h [L554] COND FALSE !(p->h == 2) [L556] EXPR p->h [L556] COND FALSE !(p->h != 3) - 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, 54 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 115 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 115 mSDsluCounter, 336 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 175 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 301 IncrementalHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 161 mSDtfsCounter, 301 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=5, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 168 SizeOfPredicates, 9 NumberOfNonLiveVariables, 185 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2/2 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-10-11 18:13:48,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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