./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82cc4e7-6757-4468-b09a-bb5e2538174c/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82cc4e7-6757-4468-b09a-bb5e2538174c/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82cc4e7-6757-4468-b09a-bb5e2538174c/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82cc4e7-6757-4468-b09a-bb5e2538174c/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82cc4e7-6757-4468-b09a-bb5e2538174c/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82cc4e7-6757-4468-b09a-bb5e2538174c/bin/utaipan-verify-sOmjnqqW8E --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d23b84347ad8f89b884566eade2030749c1dbcf7e12f4141b44403af4e899f5c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:53:49,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:53:49,841 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82cc4e7-6757-4468-b09a-bb5e2538174c/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2024-11-14 03:53:49,850 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:53:49,851 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:53:49,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:53:49,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:53:49,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:53:49,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:53:49,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:53:49,902 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:53:49,903 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:53:49,903 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:53:49,904 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:53:49,904 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:53:49,904 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:53:49,904 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:53:49,904 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:53:49,904 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:53:49,904 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:53:49,905 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:53:49,905 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:53:49,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:53:49,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:53:49,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:53:49,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:53:49,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:53:49,906 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:53:49,906 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:53:49,906 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:53:49,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:53:49,906 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:53:49,906 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:53:49,906 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:53:49,906 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:53:49,906 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:53:49,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:53:49,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:53:49,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:53:49,907 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:53:49,907 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:53:49,907 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:53:49,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:53:49,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:53:49,907 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:53:49,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:53:49,908 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82cc4e7-6757-4468-b09a-bb5e2538174c/bin/utaipan-verify-sOmjnqqW8E 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d23b84347ad8f89b884566eade2030749c1dbcf7e12f4141b44403af4e899f5c [2024-11-14 03:53:50,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:53:50,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:53:50,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:53:50,337 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:53:50,337 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:53:50,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82cc4e7-6757-4468-b09a-bb5e2538174c/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca.i Unable to find full path for "g++" [2024-11-14 03:53:52,695 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:53:53,187 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:53:53,194 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82cc4e7-6757-4468-b09a-bb5e2538174c/sv-benchmarks/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca.i [2024-11-14 03:53:53,217 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82cc4e7-6757-4468-b09a-bb5e2538174c/bin/utaipan-verify-sOmjnqqW8E/data/5919705be/b657a030182346879b6f01896760c7f9/FLAG2511b759a [2024-11-14 03:53:53,246 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82cc4e7-6757-4468-b09a-bb5e2538174c/bin/utaipan-verify-sOmjnqqW8E/data/5919705be/b657a030182346879b6f01896760c7f9 [2024-11-14 03:53:53,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:53:53,251 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:53:53,253 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:53:53,253 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:53:53,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:53:53,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:53:53" (1/1) ... [2024-11-14 03:53:53,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8f9499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:53, skipping insertion in model container [2024-11-14 03:53:53,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:53:53" (1/1) ... [2024-11-14 03:53:53,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:53:53,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:53:53,785 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:53:53,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:53:53,858 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:53:53,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:53 WrapperNode [2024-11-14 03:53:53,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:53:53,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:53:53,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:53:53,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:53:53,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:53" (1/1) ... [2024-11-14 03:53:53,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:53" (1/1) ... [2024-11-14 03:53:53,904 INFO L138 Inliner]: procedures = 111, calls = 38, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 111 [2024-11-14 03:53:53,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:53:53,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:53:53,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:53:53,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:53:53,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:53" (1/1) ... [2024-11-14 03:53:53,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:53" (1/1) ... [2024-11-14 03:53:53,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:53" (1/1) ... [2024-11-14 03:53:53,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:53" (1/1) ... [2024-11-14 03:53:53,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:53" (1/1) ... [2024-11-14 03:53:53,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:53" (1/1) ... [2024-11-14 03:53:53,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:53" (1/1) ... [2024-11-14 03:53:53,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:53" (1/1) ... [2024-11-14 03:53:53,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:53:53,934 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:53:53,934 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:53:53,935 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:53:53,936 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:53" (1/1) ... [2024-11-14 03:53:53,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:53:53,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82cc4e7-6757-4468-b09a-bb5e2538174c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:53:53,980 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82cc4e7-6757-4468-b09a-bb5e2538174c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:53:53,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82cc4e7-6757-4468-b09a-bb5e2538174c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:53:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 03:53:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:53:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 03:53:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:53:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:53:54,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:53:54,151 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:53:54,153 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:53:54,661 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2024-11-14 03:53:54,662 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:53:54,726 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:53:54,726 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 03:53:54,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:53:54 BoogieIcfgContainer [2024-11-14 03:53:54,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:53:54,729 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:53:54,729 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:53:54,736 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:53:54,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:53:53" (1/3) ... [2024-11-14 03:53:54,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68358688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:53:54, skipping insertion in model container [2024-11-14 03:53:54,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:53" (2/3) ... [2024-11-14 03:53:54,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68358688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:53:54, skipping insertion in model container [2024-11-14 03:53:54,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:53:54" (3/3) ... [2024-11-14 03:53:54,739 INFO L112 eAbstractionObserver]: Analyzing ICFG Avery-2006FLOPS-Tabel1_true-alloca.i [2024-11-14 03:53:54,756 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:53:54,757 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG Avery-2006FLOPS-Tabel1_true-alloca.i that has 1 procedures, 66 locations, 1 initial locations, 2 loop locations, and 39 error locations. [2024-11-14 03:53:54,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:53:54,819 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=FINITE_AUTOMATA, 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;@5fbb6f47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:53:54,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2024-11-14 03:53:54,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 26 states have (on average 2.730769230769231) internal successors, (71), 65 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-11-14 03:53:54,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 03:53:54,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:54,830 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 03:53:54,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 03:53:54,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:54,836 INFO L85 PathProgramCache]: Analyzing trace with hash 4685, now seen corresponding path program 1 times [2024-11-14 03:53:54,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:54,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529505378] [2024-11-14 03:53:54,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:54,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:55,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:55,370 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:55,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529505378] [2024-11-14 03:53:55,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529505378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:55,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:55,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:53:55,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453516664] [2024-11-14 03:53:55,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:55,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:53:55,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:55,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:53:55,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:55,407 INFO L87 Difference]: Start difference. First operand has 66 states, 26 states have (on average 2.730769230769231) internal successors, (71), 65 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:55,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:55,668 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2024-11-14 03:53:55,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:53:55,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-11-14 03:53:55,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:55,686 INFO L225 Difference]: With dead ends: 102 [2024-11-14 03:53:55,686 INFO L226 Difference]: Without dead ends: 101 [2024-11-14 03:53:55,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:55,694 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 56 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:55,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 42 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:53:55,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-14 03:53:55,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 62. [2024-11-14 03:53:55,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 26 states have (on average 2.5) internal successors, (65), 61 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:55,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2024-11-14 03:53:55,747 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 2 [2024-11-14 03:53:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:55,747 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2024-11-14 03:53:55,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:55,748 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2024-11-14 03:53:55,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 03:53:55,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:55,750 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 03:53:55,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:53:55,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 03:53:55,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:55,751 INFO L85 PathProgramCache]: Analyzing trace with hash 4686, now seen corresponding path program 1 times [2024-11-14 03:53:55,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:55,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741468089] [2024-11-14 03:53:55,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:55,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:56,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:56,010 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:56,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741468089] [2024-11-14 03:53:56,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741468089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:56,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:56,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:53:56,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143621585] [2024-11-14 03:53:56,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:56,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:53:56,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:56,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:53:56,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:56,013 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:56,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:56,170 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2024-11-14 03:53:56,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:53:56,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-11-14 03:53:56,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:56,172 INFO L225 Difference]: With dead ends: 99 [2024-11-14 03:53:56,172 INFO L226 Difference]: Without dead ends: 99 [2024-11-14 03:53:56,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:56,173 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 58 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:56,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 45 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:53:56,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-14 03:53:56,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 59. [2024-11-14 03:53:56,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 58 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2024-11-14 03:53:56,184 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 2 [2024-11-14 03:53:56,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:56,184 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2024-11-14 03:53:56,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:56,185 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2024-11-14 03:53:56,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 03:53:56,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:56,185 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 03:53:56,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:53:56,188 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 03:53:56,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:56,189 INFO L85 PathProgramCache]: Analyzing trace with hash 145211, now seen corresponding path program 1 times [2024-11-14 03:53:56,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:56,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546943795] [2024-11-14 03:53:56,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:56,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:56,409 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:56,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546943795] [2024-11-14 03:53:56,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546943795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:56,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:56,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:53:56,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962320047] [2024-11-14 03:53:56,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:56,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:53:56,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:56,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:53:56,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:56,412 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:56,522 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2024-11-14 03:53:56,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:53:56,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-14 03:53:56,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:56,523 INFO L225 Difference]: With dead ends: 56 [2024-11-14 03:53:56,524 INFO L226 Difference]: Without dead ends: 56 [2024-11-14 03:53:56,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:56,525 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:56,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 22 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:53:56,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-14 03:53:56,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-14 03:53:56,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 26 states have (on average 2.269230769230769) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2024-11-14 03:53:56,536 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 3 [2024-11-14 03:53:56,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:56,536 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2024-11-14 03:53:56,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:56,537 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2024-11-14 03:53:56,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 03:53:56,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:56,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 03:53:56,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 03:53:56,538 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 03:53:56,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:56,543 INFO L85 PathProgramCache]: Analyzing trace with hash 145212, now seen corresponding path program 1 times [2024-11-14 03:53:56,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:56,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072435417] [2024-11-14 03:53:56,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:56,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:56,674 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:56,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072435417] [2024-11-14 03:53:56,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072435417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:56,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:56,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:53:56,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729061006] [2024-11-14 03:53:56,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:56,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:53:56,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:56,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:53:56,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:56,677 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:56,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:56,760 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2024-11-14 03:53:56,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:53:56,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-14 03:53:56,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:56,761 INFO L225 Difference]: With dead ends: 53 [2024-11-14 03:53:56,762 INFO L226 Difference]: Without dead ends: 53 [2024-11-14 03:53:56,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:56,763 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 52 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:56,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 24 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:53:56,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-14 03:53:56,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-14 03:53:56,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 52 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:56,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2024-11-14 03:53:56,769 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 3 [2024-11-14 03:53:56,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:56,769 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2024-11-14 03:53:56,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:56,770 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2024-11-14 03:53:56,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 03:53:56,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:56,770 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 03:53:56,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:53:56,771 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 03:53:56,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:56,772 INFO L85 PathProgramCache]: Analyzing trace with hash 4501520, now seen corresponding path program 1 times [2024-11-14 03:53:56,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:56,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533132816] [2024-11-14 03:53:56,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:56,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:56,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:56,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:56,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533132816] [2024-11-14 03:53:56,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533132816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:56,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:56,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:53:56,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889213069] [2024-11-14 03:53:56,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:56,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:53:56,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:56,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:53:56,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:56,920 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:57,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:57,027 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2024-11-14 03:53:57,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:53:57,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-14 03:53:57,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:57,028 INFO L225 Difference]: With dead ends: 47 [2024-11-14 03:53:57,031 INFO L226 Difference]: Without dead ends: 47 [2024-11-14 03:53:57,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:57,033 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:57,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 16 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:53:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-14 03:53:57,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-14 03:53:57,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:57,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2024-11-14 03:53:57,040 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 4 [2024-11-14 03:53:57,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:57,040 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-11-14 03:53:57,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:57,040 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2024-11-14 03:53:57,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 03:53:57,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:57,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 03:53:57,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 03:53:57,041 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 03:53:57,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:57,042 INFO L85 PathProgramCache]: Analyzing trace with hash 4501521, now seen corresponding path program 1 times [2024-11-14 03:53:57,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:57,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261317683] [2024-11-14 03:53:57,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:57,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:57,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:57,181 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:57,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261317683] [2024-11-14 03:53:57,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261317683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:57,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:57,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:53:57,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652556222] [2024-11-14 03:53:57,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:57,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:53:57,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:57,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:53:57,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:57,183 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:57,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:57,268 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2024-11-14 03:53:57,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:53:57,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-14 03:53:57,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:57,272 INFO L225 Difference]: With dead ends: 42 [2024-11-14 03:53:57,272 INFO L226 Difference]: Without dead ends: 42 [2024-11-14 03:53:57,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:57,273 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 38 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:57,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 18 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:53:57,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-14 03:53:57,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-11-14 03:53:57,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:57,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-11-14 03:53:57,285 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 4 [2024-11-14 03:53:57,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:57,285 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-11-14 03:53:57,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:57,285 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-11-14 03:53:57,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 03:53:57,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:57,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 03:53:57,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 03:53:57,286 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 03:53:57,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:57,287 INFO L85 PathProgramCache]: Analyzing trace with hash 30992851, now seen corresponding path program 1 times [2024-11-14 03:53:57,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:57,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373437416] [2024-11-14 03:53:57,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:57,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:57,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:57,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:57,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373437416] [2024-11-14 03:53:57,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373437416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:57,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:57,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:53:57,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000245735] [2024-11-14 03:53:57,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:57,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:53:57,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:57,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:53:57,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:57,374 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:57,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:57,455 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-11-14 03:53:57,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:53:57,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-14 03:53:57,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:57,456 INFO L225 Difference]: With dead ends: 34 [2024-11-14 03:53:57,456 INFO L226 Difference]: Without dead ends: 34 [2024-11-14 03:53:57,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:57,457 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:57,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 9 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:53:57,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-14 03:53:57,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-14 03:53:57,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:57,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-14 03:53:57,464 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 6 [2024-11-14 03:53:57,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:57,464 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-14 03:53:57,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:57,465 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-14 03:53:57,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 03:53:57,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:57,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 03:53:57,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 03:53:57,468 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 03:53:57,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:57,469 INFO L85 PathProgramCache]: Analyzing trace with hash 30992852, now seen corresponding path program 1 times [2024-11-14 03:53:57,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:57,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547949171] [2024-11-14 03:53:57,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:57,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:57,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:57,583 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:57,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547949171] [2024-11-14 03:53:57,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547949171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:57,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:57,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:53:57,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105678435] [2024-11-14 03:53:57,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:57,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:53:57,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:57,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:53:57,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:57,585 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:57,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:57,649 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2024-11-14 03:53:57,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:53:57,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-14 03:53:57,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:57,650 INFO L225 Difference]: With dead ends: 27 [2024-11-14 03:53:57,651 INFO L226 Difference]: Without dead ends: 27 [2024-11-14 03:53:57,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:57,652 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:57,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 11 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:53:57,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-14 03:53:57,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-14 03:53:57,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:57,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-11-14 03:53:57,657 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2024-11-14 03:53:57,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:57,657 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-14 03:53:57,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:57,658 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-11-14 03:53:57,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 03:53:57,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:57,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:57,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 03:53:57,659 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 03:53:57,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:57,659 INFO L85 PathProgramCache]: Analyzing trace with hash 590086846, now seen corresponding path program 1 times [2024-11-14 03:53:57,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:57,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941154317] [2024-11-14 03:53:57,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:57,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:58,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:58,391 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:58,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941154317] [2024-11-14 03:53:58,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941154317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:58,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:58,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:53:58,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516995511] [2024-11-14 03:53:58,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:58,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:53:58,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:58,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:53:58,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:53:58,393 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-11-14 03:53:58,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:58,490 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2024-11-14 03:53:58,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:53:58,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-11-14 03:53:58,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:58,491 INFO L225 Difference]: With dead ends: 26 [2024-11-14 03:53:58,492 INFO L226 Difference]: Without dead ends: 0 [2024-11-14 03:53:58,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:53:58,493 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:58,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 15 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:53:58,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-14 03:53:58,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-14 03:53:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:58,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-14 03:53:58,495 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2024-11-14 03:53:58,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:58,495 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-14 03:53:58,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-11-14 03:53:58,499 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-14 03:53:58,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-14 03:53:58,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 39 remaining) [2024-11-14 03:53:58,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 39 remaining) [2024-11-14 03:53:58,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 39 remaining) [2024-11-14 03:53:58,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 39 remaining) [2024-11-14 03:53:58,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 39 remaining) [2024-11-14 03:53:58,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 39 remaining) [2024-11-14 03:53:58,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 39 remaining) [2024-11-14 03:53:58,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 39 remaining) [2024-11-14 03:53:58,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 39 remaining) [2024-11-14 03:53:58,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 39 remaining) [2024-11-14 03:53:58,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 39 remaining) [2024-11-14 03:53:58,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 39 remaining) [2024-11-14 03:53:58,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 39 remaining) [2024-11-14 03:53:58,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 39 remaining) [2024-11-14 03:53:58,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 39 remaining) [2024-11-14 03:53:58,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 39 remaining) [2024-11-14 03:53:58,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 39 remaining) [2024-11-14 03:53:58,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 39 remaining) [2024-11-14 03:53:58,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 39 remaining) [2024-11-14 03:53:58,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 39 remaining) [2024-11-14 03:53:58,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 39 remaining) [2024-11-14 03:53:58,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 39 remaining) [2024-11-14 03:53:58,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 39 remaining) [2024-11-14 03:53:58,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 39 remaining) [2024-11-14 03:53:58,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 39 remaining) [2024-11-14 03:53:58,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 39 remaining) [2024-11-14 03:53:58,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 39 remaining) [2024-11-14 03:53:58,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 39 remaining) [2024-11-14 03:53:58,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 39 remaining) [2024-11-14 03:53:58,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 39 remaining) [2024-11-14 03:53:58,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 39 remaining) [2024-11-14 03:53:58,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 39 remaining) [2024-11-14 03:53:58,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 39 remaining) [2024-11-14 03:53:58,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 39 remaining) [2024-11-14 03:53:58,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 39 remaining) [2024-11-14 03:53:58,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 39 remaining) [2024-11-14 03:53:58,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 39 remaining) [2024-11-14 03:53:58,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 39 remaining) [2024-11-14 03:53:58,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK (0 of 39 remaining) [2024-11-14 03:53:58,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 03:53:58,518 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:58,521 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 03:53:58,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 03:53:58 BoogieIcfgContainer [2024-11-14 03:53:58,527 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 03:53:58,528 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 03:53:58,528 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 03:53:58,528 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 03:53:58,529 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:53:54" (3/4) ... [2024-11-14 03:53:58,532 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-14 03:53:58,547 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2024-11-14 03:53:58,547 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-14 03:53:58,548 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-14 03:53:58,548 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-14 03:53:58,658 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82cc4e7-6757-4468-b09a-bb5e2538174c/bin/utaipan-verify-sOmjnqqW8E/witness.graphml [2024-11-14 03:53:58,659 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82cc4e7-6757-4468-b09a-bb5e2538174c/bin/utaipan-verify-sOmjnqqW8E/witness.yml [2024-11-14 03:53:58,659 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 03:53:58,660 INFO L158 Benchmark]: Toolchain (without parser) took 5409.23ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 92.0MB in the beginning and 155.0MB in the end (delta: -63.0MB). Peak memory consumption was 173.7MB. Max. memory is 16.1GB. [2024-11-14 03:53:58,660 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 167.8MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:53:58,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 606.89ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 75.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 03:53:58,662 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.23ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 74.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:53:58,662 INFO L158 Benchmark]: Boogie Preprocessor took 28.09ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 73.3MB in the end (delta: 714.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:53:58,663 INFO L158 Benchmark]: RCFGBuilder took 792.26ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 50.3MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 03:53:58,663 INFO L158 Benchmark]: TraceAbstraction took 3798.36ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 49.9MB in the beginning and 159.9MB in the end (delta: -110.0MB). Peak memory consumption was 123.4MB. Max. memory is 16.1GB. [2024-11-14 03:53:58,663 INFO L158 Benchmark]: Witness Printer took 130.88ms. Allocated memory is still 352.3MB. Free memory was 159.9MB in the beginning and 155.0MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:53:58,667 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.36ms. Allocated memory is still 167.8MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 606.89ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 75.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.23ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 74.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.09ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 73.3MB in the end (delta: 714.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 792.26ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 50.3MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3798.36ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 49.9MB in the beginning and 159.9MB in the end (delta: -110.0MB). Peak memory consumption was 123.4MB. Max. memory is 16.1GB. * Witness Printer took 130.88ms. Allocated memory is still 352.3MB. Free memory was 159.9MB in the beginning and 155.0MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. 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 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 39 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 353 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 353 mSDsluCounter, 202 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 389 IncrementalHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 156 mSDtfsCounter, 389 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 80 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 490 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 39 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-14 03:53:58,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a82cc4e7-6757-4468-b09a-bb5e2538174c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE