./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ss1f.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/ss1f.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 d5341b7d8f13e16ae2d92360900d900df8802cfb6c3c57b424faed09c7a6099f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:30:00,275 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:30:00,357 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:00,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:30:00,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:30:00,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:30:00,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:30:00,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:30:00,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:30:00,396 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:30:00,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:30:00,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:30:00,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:30:00,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:30:00,398 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:30:00,399 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:30:00,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:30:00,401 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:30:00,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 18:30:00,405 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:30:00,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:30:00,405 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:30:00,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:30:00,406 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:30:00,406 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:30:00,406 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:30:00,406 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:30:00,407 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:30:00,407 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:30:00,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:30:00,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:30:00,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:30:00,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:30:00,408 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:30:00,408 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:30:00,408 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:30:00,409 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 18:30:00,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 18:30:00,409 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:30:00,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:30:00,410 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:30:00,410 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:30:00,410 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 -> d5341b7d8f13e16ae2d92360900d900df8802cfb6c3c57b424faed09c7a6099f [2024-11-09 18:30:00,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:30:00,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:30:00,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:30:00,682 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:30:00,682 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:30:00,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ss1f.c [2024-11-09 18:30:02,194 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:30:02,395 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:30:02,396 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ss1f.c [2024-11-09 18:30:02,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1710a2e1f/b3d2f199d1ad45b489bb7c4199e15ce9/FLAG4b5b02824 [2024-11-09 18:30:02,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1710a2e1f/b3d2f199d1ad45b489bb7c4199e15ce9 [2024-11-09 18:30:02,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:30:02,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:30:02,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:30:02,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:30:02,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:30:02,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:30:02" (1/1) ... [2024-11-09 18:30:02,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c3f8ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:02, skipping insertion in model container [2024-11-09 18:30:02,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:30:02" (1/1) ... [2024-11-09 18:30:02,815 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:30:03,011 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/ss1f.c[587,600] [2024-11-09 18:30:03,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:30:03,061 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:30:03,074 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/ss1f.c[587,600] [2024-11-09 18:30:03,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:30:03,100 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:30:03,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:03 WrapperNode [2024-11-09 18:30:03,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:30:03,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:30:03,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:30:03,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:30:03,108 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:03" (1/1) ... [2024-11-09 18:30:03,115 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:03" (1/1) ... [2024-11-09 18:30:03,137 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 92 [2024-11-09 18:30:03,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:30:03,138 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:30:03,138 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:30:03,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:30:03,146 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:03" (1/1) ... [2024-11-09 18:30:03,147 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:03" (1/1) ... [2024-11-09 18:30:03,149 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:03" (1/1) ... [2024-11-09 18:30:03,164 INFO L175 MemorySlicer]: Split 21 memory accesses to 4 slices as follows [2, 7, 7, 5]. 33 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 5 writes are split as follows [0, 0, 3, 2]. [2024-11-09 18:30:03,165 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:03" (1/1) ... [2024-11-09 18:30:03,165 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:03" (1/1) ... [2024-11-09 18:30:03,171 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:03" (1/1) ... [2024-11-09 18:30:03,172 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:03" (1/1) ... [2024-11-09 18:30:03,173 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:03" (1/1) ... [2024-11-09 18:30:03,174 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:03" (1/1) ... [2024-11-09 18:30:03,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:30:03,181 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:30:03,182 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:30:03,182 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:30:03,183 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:03" (1/1) ... [2024-11-09 18:30:03,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:30:03,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:30:03,221 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:03,224 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:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:30:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 18:30:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 18:30:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 18:30:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 18:30:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 18:30:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 18:30:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 18:30:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 18:30:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 18:30:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 18:30:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:30:03,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:30:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 18:30:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 18:30:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 18:30:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 18:30:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 18:30:03,376 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:30:03,385 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:30:03,571 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:03,586 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-09 18:30:03,586 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:30:03,601 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:30:03,603 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:30:03,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:30:03 BoogieIcfgContainer [2024-11-09 18:30:03,604 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:30:03,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:30:03,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:30:03,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:30:03,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:30:02" (1/3) ... [2024-11-09 18:30:03,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cccb44b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:30:03, skipping insertion in model container [2024-11-09 18:30:03,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:03" (2/3) ... [2024-11-09 18:30:03,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cccb44b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:30:03, skipping insertion in model container [2024-11-09 18:30:03,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:30:03" (3/3) ... [2024-11-09 18:30:03,614 INFO L112 eAbstractionObserver]: Analyzing ICFG ss1f.c [2024-11-09 18:30:03,634 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:30:03,634 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:30:03,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:30:03,714 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;@17bc1ec9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:30:03,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:30:03,720 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:03,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 18:30:03,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:03,728 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:03,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:03,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:03,734 INFO L85 PathProgramCache]: Analyzing trace with hash 601572371, now seen corresponding path program 1 times [2024-11-09 18:30:03,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:03,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379119642] [2024-11-09 18:30:03,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:03,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:03,924 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:03,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:03,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379119642] [2024-11-09 18:30:03,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379119642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:03,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:30:03,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:30:03,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855128726] [2024-11-09 18:30:03,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:03,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 18:30:03,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:03,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 18:30:03,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 18:30:03,953 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:03,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:03,967 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2024-11-09 18:30:03,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 18:30:03,969 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:03,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:03,975 INFO L225 Difference]: With dead ends: 47 [2024-11-09 18:30:03,975 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 18:30:03,978 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:03,982 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:03,983 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:04,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 18:30:04,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-09 18:30:04,014 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:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-11-09 18:30:04,017 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2024-11-09 18:30:04,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:04,018 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-09 18:30:04,018 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:04,018 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-11-09 18:30:04,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 18:30:04,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:04,019 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:04,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 18:30:04,022 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:04,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:04,023 INFO L85 PathProgramCache]: Analyzing trace with hash -998786358, now seen corresponding path program 1 times [2024-11-09 18:30:04,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:04,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348395758] [2024-11-09 18:30:04,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:04,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:04,210 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:04,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:04,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348395758] [2024-11-09 18:30:04,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348395758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:04,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:30:04,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:30:04,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328759073] [2024-11-09 18:30:04,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:04,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:30:04,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:04,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:30:04,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:30:04,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:04,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:04,302 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-11-09 18:30:04,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:30:04,305 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:04,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:04,306 INFO L225 Difference]: With dead ends: 43 [2024-11-09 18:30:04,307 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 18:30:04,307 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:04,308 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 29 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:04,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 22 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:30:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 18:30:04,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 18:30:04,316 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:04,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-11-09 18:30:04,317 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2024-11-09 18:30:04,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:04,317 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-09 18:30:04,318 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:04,318 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-11-09 18:30:04,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 18:30:04,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:04,319 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:04,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 18:30:04,319 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:04,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:04,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1488878026, now seen corresponding path program 1 times [2024-11-09 18:30:04,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:04,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377102288] [2024-11-09 18:30:04,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:04,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 18:30:04,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1865305662] [2024-11-09 18:30:04,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:04,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:30:04,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:30:04,447 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:04,449 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:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 18:30:04,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 18:30:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 18:30:04,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 18:30:04,588 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 18:30:04,590 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 18:30:04,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 18:30:04,792 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:04,796 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 18:30:04,835 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 18:30:04,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:30:04 BoogieIcfgContainer [2024-11-09 18:30:04,838 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 18:30:04,839 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 18:30:04,839 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 18:30:04,839 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 18:30:04,840 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:03" (3/4) ... [2024-11-09 18:30:04,841 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 18:30:04,891 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 18:30:04,895 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 18:30:04,896 INFO L158 Benchmark]: Toolchain (without parser) took 2109.75ms. Allocated memory is still 184.5MB. Free memory was 115.6MB in the beginning and 83.2MB in the end (delta: 32.3MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2024-11-09 18:30:04,896 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 113.2MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:30:04,897 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.93ms. Allocated memory is still 184.5MB. Free memory was 115.3MB in the beginning and 153.9MB in the end (delta: -38.6MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-09 18:30:04,897 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.18ms. Allocated memory is still 184.5MB. Free memory was 153.9MB in the beginning and 152.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 18:30:04,897 INFO L158 Benchmark]: Boogie Preprocessor took 43.07ms. Allocated memory is still 184.5MB. Free memory was 152.5MB in the beginning and 150.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 18:30:04,897 INFO L158 Benchmark]: IcfgBuilder took 422.93ms. Allocated memory is still 184.5MB. Free memory was 150.4MB in the beginning and 135.7MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 18:30:04,898 INFO L158 Benchmark]: TraceAbstraction took 1231.61ms. Allocated memory is still 184.5MB. Free memory was 135.0MB in the beginning and 85.4MB in the end (delta: 49.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-09 18:30:04,898 INFO L158 Benchmark]: Witness Printer took 56.36ms. Allocated memory is still 184.5MB. Free memory was 85.4MB in the beginning and 83.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 18:30:04,903 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.20ms. Allocated memory is still 113.2MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.93ms. Allocated memory is still 184.5MB. Free memory was 115.3MB in the beginning and 153.9MB in the end (delta: -38.6MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.18ms. Allocated memory is still 184.5MB. Free memory was 153.9MB in the beginning and 152.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.07ms. Allocated memory is still 184.5MB. Free memory was 152.5MB in the beginning and 150.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 422.93ms. Allocated memory is still 184.5MB. Free memory was 150.4MB in the beginning and 135.7MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1231.61ms. Allocated memory is still 184.5MB. Free memory was 135.0MB in the beginning and 85.4MB in the end (delta: 49.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 56.36ms. Allocated memory is still 184.5MB. Free memory was 85.4MB in the beginning and 83.2MB in the end (delta: 2.2MB). 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