./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ss4f.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/ss4f.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ec849c99676c748abc5b9766c44a36d723f69a872b4d768d06c539c74569bdf4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:30:14,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:30:14,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 18:30:15,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:30:15,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:30:15,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:30:15,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:30:15,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:30:15,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:30:15,032 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:30:15,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:30:15,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:30:15,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:30:15,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:30:15,034 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:30:15,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:30:15,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:30:15,035 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:30:15,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 18:30:15,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:30:15,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:30:15,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:30:15,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:30:15,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:30:15,039 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:30:15,039 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:30:15,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:30:15,040 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:30:15,040 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:30:15,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:30:15,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:30:15,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:30:15,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:30:15,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:30:15,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:30:15,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:30:15,041 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 18:30:15,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 18:30:15,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:30:15,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:30:15,042 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:30:15,042 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:30:15,042 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec849c99676c748abc5b9766c44a36d723f69a872b4d768d06c539c74569bdf4 [2024-11-09 18:30:15,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:30:15,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:30:15,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:30:15,320 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:30:15,320 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:30:15,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ss4f.c [2024-11-09 18:30:16,683 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:30:16,877 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:30:16,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ss4f.c [2024-11-09 18:30:16,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3c398d07/4b3fe981680c428a83fdf64cac27a7d7/FLAGd95198c59 [2024-11-09 18:30:16,896 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3c398d07/4b3fe981680c428a83fdf64cac27a7d7 [2024-11-09 18:30:16,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:30:16,899 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:30:16,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:30:16,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:30:16,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:30:16,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:30:16" (1/1) ... [2024-11-09 18:30:16,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@504264c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:16, skipping insertion in model container [2024-11-09 18:30:16,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:30:16" (1/1) ... [2024-11-09 18:30:16,927 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:30:17,099 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ss4f.c[587,600] [2024-11-09 18:30:17,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:30:17,128 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:30:17,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ss4f.c[587,600] [2024-11-09 18:30:17,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:30:17,162 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:30:17,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:17 WrapperNode [2024-11-09 18:30:17,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:30:17,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:30:17,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:30:17,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:30:17,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:17" (1/1) ... [2024-11-09 18:30:17,176 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:17" (1/1) ... [2024-11-09 18:30:17,195 INFO L138 Inliner]: procedures = 17, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2024-11-09 18:30:17,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:30:17,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:30:17,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:30:17,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:30:17,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:17" (1/1) ... [2024-11-09 18:30:17,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:17" (1/1) ... [2024-11-09 18:30:17,212 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:17" (1/1) ... [2024-11-09 18:30:17,226 INFO L175 MemorySlicer]: Split 22 memory accesses to 4 slices as follows [2, 7, 5, 8]. 36 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 6 writes are split as follows [0, 0, 2, 4]. [2024-11-09 18:30:17,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:17" (1/1) ... [2024-11-09 18:30:17,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:17" (1/1) ... [2024-11-09 18:30:17,232 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:17" (1/1) ... [2024-11-09 18:30:17,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:17" (1/1) ... [2024-11-09 18:30:17,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:17" (1/1) ... [2024-11-09 18:30:17,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:17" (1/1) ... [2024-11-09 18:30:17,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:30:17,238 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:30:17,239 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:30:17,239 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:30:17,240 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:17" (1/1) ... [2024-11-09 18:30:17,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:30:17,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:30:17,281 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 18:30:17,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 18:30:17,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:30:17,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 18:30:17,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 18:30:17,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 18:30:17,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 18:30:17,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 18:30:17,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 18:30:17,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 18:30:17,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 18:30:17,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 18:30:17,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 18:30:17,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:30:17,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:30:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 18:30:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 18:30:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 18:30:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 18:30:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 18:30:17,436 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:30:17,438 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:30:17,652 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#sum~0#1.base, main_~#sum~0#1.offset);havoc main_~#sum~0#1.base, main_~#sum~0#1.offset; [2024-11-09 18:30:17,661 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-09 18:30:17,661 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:30:17,674 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:30:17,675 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:30:17,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:30:17 BoogieIcfgContainer [2024-11-09 18:30:17,675 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:30:17,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:30:17,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:30:17,680 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:30:17,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:30:16" (1/3) ... [2024-11-09 18:30:17,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439713ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:30:17, skipping insertion in model container [2024-11-09 18:30:17,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:17" (2/3) ... [2024-11-09 18:30:17,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439713ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:30:17, skipping insertion in model container [2024-11-09 18:30:17,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:30:17" (3/3) ... [2024-11-09 18:30:17,682 INFO L112 eAbstractionObserver]: Analyzing ICFG ss4f.c [2024-11-09 18:30:17,697 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:30:17,697 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:30:17,756 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:30:17,761 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@2b36c024, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:30:17,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:30:17,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:17,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 18:30:17,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:17,770 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:17,770 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:17,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:17,774 INFO L85 PathProgramCache]: Analyzing trace with hash 601572371, now seen corresponding path program 1 times [2024-11-09 18:30:17,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:17,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222960517] [2024-11-09 18:30:17,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:17,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:17,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:30:17,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:17,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222960517] [2024-11-09 18:30:17,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222960517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:17,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:30:17,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:30:17,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913624297] [2024-11-09 18:30:17,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:17,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 18:30:17,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:17,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 18:30:17,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 18:30:17,960 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:17,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:17,974 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2024-11-09 18:30:17,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 18:30:17,977 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 16 [2024-11-09 18:30:17,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:17,985 INFO L225 Difference]: With dead ends: 47 [2024-11-09 18:30:17,986 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 18:30:17,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 18:30:17,995 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:17,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:30:18,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 18:30:18,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-09 18:30:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-11-09 18:30:18,027 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2024-11-09 18:30:18,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:18,028 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-09 18:30:18,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:18,029 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-11-09 18:30:18,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 18:30:18,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:18,031 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:18,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 18:30:18,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:18,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:18,032 INFO L85 PathProgramCache]: Analyzing trace with hash -998786358, now seen corresponding path program 1 times [2024-11-09 18:30:18,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:18,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763720976] [2024-11-09 18:30:18,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:18,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:18,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:30:18,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:18,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763720976] [2024-11-09 18:30:18,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763720976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:18,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:30:18,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:30:18,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382335599] [2024-11-09 18:30:18,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:18,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:30:18,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:18,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:30:18,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:30:18,217 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:18,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:18,288 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-11-09 18:30:18,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:30:18,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2024-11-09 18:30:18,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:18,290 INFO L225 Difference]: With dead ends: 43 [2024-11-09 18:30:18,290 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 18:30:18,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:30:18,292 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:18,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 21 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:30:18,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 18:30:18,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 18:30:18,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:18,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-11-09 18:30:18,307 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2024-11-09 18:30:18,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:18,308 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-09 18:30:18,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:18,308 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-11-09 18:30:18,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 18:30:18,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:18,309 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:18,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 18:30:18,309 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:18,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:18,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1488878026, now seen corresponding path program 1 times [2024-11-09 18:30:18,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:18,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180098381] [2024-11-09 18:30:18,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:18,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 18:30:18,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [704454065] [2024-11-09 18:30:18,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:18,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:30:18,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:30:18,407 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:30:18,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 18:30:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 18:30:18,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 18:30:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 18:30:18,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 18:30:18,552 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 18:30:18,553 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 18:30:18,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 18:30:18,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:30:18,760 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 18:30:18,783 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 18:30:18,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:30:18 BoogieIcfgContainer [2024-11-09 18:30:18,790 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 18:30:18,791 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 18:30:18,794 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 18:30:18,794 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 18:30:18,795 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:30:17" (3/4) ... [2024-11-09 18:30:18,796 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 18:30:18,842 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 18:30:18,843 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 18:30:18,843 INFO L158 Benchmark]: Toolchain (without parser) took 1943.92ms. Allocated memory is still 163.6MB. Free memory was 128.8MB in the beginning and 73.4MB in the end (delta: 55.4MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. [2024-11-09 18:30:18,844 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:30:18,844 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.13ms. Allocated memory is still 163.6MB. Free memory was 128.8MB in the beginning and 115.5MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 18:30:18,844 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.00ms. Allocated memory is still 163.6MB. Free memory was 115.5MB in the beginning and 113.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 18:30:18,845 INFO L158 Benchmark]: Boogie Preprocessor took 42.05ms. Allocated memory is still 163.6MB. Free memory was 113.4MB in the beginning and 111.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 18:30:18,845 INFO L158 Benchmark]: IcfgBuilder took 436.95ms. Allocated memory is still 163.6MB. Free memory was 111.3MB in the beginning and 125.9MB in the end (delta: -14.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 18:30:18,845 INFO L158 Benchmark]: TraceAbstraction took 1112.48ms. Allocated memory is still 163.6MB. Free memory was 125.9MB in the beginning and 75.5MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-09 18:30:18,846 INFO L158 Benchmark]: Witness Printer took 51.99ms. Allocated memory is still 163.6MB. Free memory was 75.5MB in the beginning and 73.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 18:30:18,848 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.13ms. Allocated memory is still 163.6MB. Free memory was 128.8MB in the beginning and 115.5MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.00ms. Allocated memory is still 163.6MB. Free memory was 115.5MB in the beginning and 113.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.05ms. Allocated memory is still 163.6MB. Free memory was 113.4MB in the beginning and 111.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 436.95ms. Allocated memory is still 163.6MB. Free memory was 111.3MB in the beginning and 125.9MB in the end (delta: -14.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1112.48ms. Allocated memory is still 163.6MB. Free memory was 125.9MB in the beginning and 75.5MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 51.99ms. Allocated memory is still 163.6MB. Free memory was 75.5MB in the beginning and 73.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int N; VAL [N=0] [L23] N = __VERIFIER_nondet_int() [L24] COND FALSE !(N <= 0) [L25] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) [L13] COND FALSE !(!cond) VAL [N=1] [L25] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) [L27] int i; [L28] long long sum[1]; [L29] long long *a = malloc(sizeof(long long)*N); [L31] sum[0] = 0 [L32] i=0 VAL [N=1, a={-1:0}, i=0, sum={4:0}] [L32] COND TRUE i