./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/reducercommutativity/rangesum20.i --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/rangesum20.yml/witness.yml --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03fe66fa Calling Ultimate with: /root/.sdkman/candidates/java/current/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/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/reducercommutativity/rangesum20.i ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/rangesum20.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-03fe66f-m [2024-08-15 18:03:38,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-15 18:03:38,813 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-08-15 18:03:38,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-15 18:03:38,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-15 18:03:38,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-15 18:03:38,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-15 18:03:38,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-15 18:03:38,846 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-15 18:03:38,847 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-15 18:03:38,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-15 18:03:38,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-15 18:03:38,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-15 18:03:38,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-15 18:03:38,850 INFO L153 SettingsManager]: * Use SBE=true [2024-08-15 18:03:38,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-15 18:03:38,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-15 18:03:38,851 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-15 18:03:38,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-15 18:03:38,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-15 18:03:38,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-15 18:03:38,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-15 18:03:38,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-15 18:03:38,856 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-15 18:03:38,857 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-15 18:03:38,857 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-15 18:03:38,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-15 18:03:38,857 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-15 18:03:38,857 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-15 18:03:38,858 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-15 18:03:38,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-15 18:03:38,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-15 18:03:38,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-15 18:03:38,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-15 18:03:38,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-15 18:03:38,859 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-15 18:03:38,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-15 18:03:38,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-15 18:03:38,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-15 18:03:38,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-15 18:03:38,859 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-15 18:03:38,861 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-15 18:03:38,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-15 18:03:38,861 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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-15 18:03:39,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-15 18:03:39,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-15 18:03:39,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-15 18:03:39,121 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-15 18:03:39,121 INFO L274 PluginConnector]: CDTParser initialized [2024-08-15 18:03:39,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/rangesum20.i [2024-08-15 18:03:40,489 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-15 18:03:40,660 INFO L384 CDTParser]: Found 1 translation units. [2024-08-15 18:03:40,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum20.i [2024-08-15 18:03:40,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90bd6b780/26dd1e4f00a3457fbe1c58c3fd5cd098/FLAG0954a6ba4 [2024-08-15 18:03:40,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90bd6b780/26dd1e4f00a3457fbe1c58c3fd5cd098 [2024-08-15 18:03:40,693 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-15 18:03:40,693 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-15 18:03:40,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/rangesum20.yml/witness.yml [2024-08-15 18:03:40,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-15 18:03:40,842 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-15 18:03:40,843 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-15 18:03:40,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-15 18:03:40,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-15 18:03:40,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:03:40" (1/2) ... [2024-08-15 18:03:40,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f0676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:03:40, skipping insertion in model container [2024-08-15 18:03:40,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:03:40" (1/2) ... [2024-08-15 18:03:40,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@753aa1e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:03:40, skipping insertion in model container [2024-08-15 18:03:40,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:03:40" (2/2) ... [2024-08-15 18:03:40,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f0676 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:03:40, skipping insertion in model container [2024-08-15 18:03:40,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:03:40" (2/2) ... [2024-08-15 18:03:40,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-15 18:03:41,027 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum20.i[1465,1478] [2024-08-15 18:03:41,031 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:03:41,038 INFO L200 MainTranslator]: Completed pre-run [2024-08-15 18:03:41,055 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum20.i[1465,1478] [2024-08-15 18:03:41,056 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:03:41,069 INFO L204 MainTranslator]: Completed translation [2024-08-15 18:03:41,069 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:03:41 WrapperNode [2024-08-15 18:03:41,069 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-15 18:03:41,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-15 18:03:41,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-15 18:03:41,071 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-15 18:03:41,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:03:41" (1/1) ... [2024-08-15 18:03:41,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:03:41" (1/1) ... [2024-08-15 18:03:41,092 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:03:41" (1/1) ... [2024-08-15 18:03:41,104 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-08-15 18:03:41,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:03:41" (1/1) ... [2024-08-15 18:03:41,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:03:41" (1/1) ... [2024-08-15 18:03:41,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:03:41" (1/1) ... [2024-08-15 18:03:41,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:03:41" (1/1) ... [2024-08-15 18:03:41,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:03:41" (1/1) ... [2024-08-15 18:03:41,113 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-15 18:03:41,114 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-15 18:03:41,114 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-15 18:03:41,114 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-15 18:03:41,115 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:03:41" (1/1) ... [2024-08-15 18:03:41,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-15 18:03:41,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:03:41,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-15 18:03:41,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-15 18:03:41,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-15 18:03:41,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-15 18:03:41,192 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-15 18:03:41,192 INFO L138 BoogieDeclarations]: Found implementation of procedure init_nondet [2024-08-15 18:03:41,192 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2024-08-15 18:03:41,192 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-15 18:03:41,192 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-15 18:03:41,192 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-15 18:03:41,192 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2024-08-15 18:03:41,192 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2024-08-15 18:03:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-15 18:03:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-15 18:03:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2024-08-15 18:03:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure init_nondet [2024-08-15 18:03:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-15 18:03:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-08-15 18:03:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2024-08-15 18:03:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-15 18:03:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-08-15 18:03:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-15 18:03:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-08-15 18:03:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-15 18:03:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-15 18:03:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-15 18:03:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-08-15 18:03:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-15 18:03:41,268 INFO L273 CfgBuilder]: Building ICFG [2024-08-15 18:03:41,269 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-15 18:03:41,346 INFO L1266 $ProcedureCfgBuilder]: dead code at ProgramPoint L42: call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset);havoc ~#x~0.base, ~#x~0.offset; [2024-08-15 18:03:41,415 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-08-15 18:03:41,415 INFO L327 CfgBuilder]: Performing block encoding [2024-08-15 18:03:41,423 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-15 18:03:41,424 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-15 18:03:41,424 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:03:41 BoogieIcfgContainer [2024-08-15 18:03:41,424 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-15 18:03:41,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-15 18:03:41,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-15 18:03:41,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-15 18:03:41,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.08 06:03:40" (1/4) ... [2024-08-15 18:03:41,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622f7f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.08 06:03:41, skipping insertion in model container [2024-08-15 18:03:41,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:03:40" (2/4) ... [2024-08-15 18:03:41,430 WARN L100 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-15 18:03:41,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622f7f68 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 15.08 06:03:41, skipping insertion in model container [2024-08-15 18:03:41,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:03:41" (3/4) ... [2024-08-15 18:03:41,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622f7f68 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 15.08 06:03:41, skipping insertion in model container [2024-08-15 18:03:41,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:03:41" (4/4) ... [2024-08-15 18:03:41,432 INFO L128 eAbstractionObserver]: Analyzing ICFG rangesum20.i [2024-08-15 18:03:41,447 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-15 18:03:41,447 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-15 18:03:41,472 INFO L90 WitnessUtils]: Constructing product of automaton with 42 states and violation witness of the following lengths: [177] [2024-08-15 18:03:41,896 INFO L95 WitnessUtils]: Product has 3704 reachable states. [2024-08-15 18:03:41,913 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-15 18:03:41,920 INFO L357 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, mHoare=false, 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;@40d853c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-15 18:03:41,920 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-15 18:03:41,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3704 states and 7237 transitions. [2024-08-15 18:03:42,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-08-15 18:03:42,018 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:03:42,019 INFO L195 NwaCegarLoop]: trace histogram [60, 60, 60, 33, 27, 10, 10, 10, 10, 10, 9, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:03:42,020 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:03:42,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:03:42,027 INFO L85 PathProgramCache]: Analyzing trace with hash -882936922, now seen corresponding path program 1 times [2024-08-15 18:03:42,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:03:42,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945081397] [2024-08-15 18:03:42,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:03:42,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:03:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:03:42,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:03:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:03:42,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-08-15 18:03:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:03:42,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-08-15 18:03:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:03:42,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-08-15 18:03:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:03:42,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-08-15 18:03:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:03:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 7627 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7627 trivial. 0 not checked. [2024-08-15 18:03:42,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:03:42,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945081397] [2024-08-15 18:03:42,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945081397] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:03:42,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:03:42,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-15 18:03:42,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509977984] [2024-08-15 18:03:42,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:03:42,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-15 18:03:42,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:03:42,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-15 18:03:42,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-15 18:03:42,723 INFO L87 Difference]: Start difference. First operand 3704 states and 7237 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-08-15 18:03:42,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:03:42,823 INFO L93 Difference]: Finished difference Result 2131 states and 3150 transitions. [2024-08-15 18:03:42,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-15 18:03:42,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 354 [2024-08-15 18:03:42,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:03:42,845 INFO L225 Difference]: With dead ends: 2131 [2024-08-15 18:03:42,845 INFO L226 Difference]: Without dead ends: 485 [2024-08-15 18:03:42,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-15 18:03:42,849 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 19 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:03:42,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 50 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:03:42,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-08-15 18:03:42,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 365. [2024-08-15 18:03:42,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 353 states have (on average 1.1926345609065157) internal successors, (421), 353 states have internal predecessors, (421), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-15 18:03:42,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 432 transitions. [2024-08-15 18:03:42,920 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 432 transitions. Word has length 354 [2024-08-15 18:03:42,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:03:42,920 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 432 transitions. [2024-08-15 18:03:42,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-08-15 18:03:42,921 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 432 transitions. [2024-08-15 18:03:42,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-08-15 18:03:42,927 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:03:42,927 INFO L195 NwaCegarLoop]: trace histogram [63, 60, 60, 33, 27, 11, 10, 10, 10, 10, 9, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:03:42,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-15 18:03:42,928 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:03:42,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:03:42,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1340811226, now seen corresponding path program 1 times [2024-08-15 18:03:42,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:03:42,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472990072] [2024-08-15 18:03:42,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:03:42,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:03:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:03:43,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:03:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:03:43,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-08-15 18:03:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:03:43,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-08-15 18:03:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:03:43,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-08-15 18:03:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:03:43,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-08-15 18:03:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:03:43,716 INFO L134 CoverageAnalysis]: Checked inductivity of 7820 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 7620 trivial. 0 not checked. [2024-08-15 18:03:43,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:03:43,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472990072] [2024-08-15 18:03:43,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472990072] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:03:43,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183997283] [2024-08-15 18:03:43,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:03:43,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:03:43,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:03:43,719 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-08-15 18:03:43,721 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-08-15 18:03:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:03:43,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 12 conjunts are in the unsatisfiable core [2024-08-15 18:03:43,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:03:44,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7820 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 7620 trivial. 0 not checked. [2024-08-15 18:03:44,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:03:44,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7820 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 7620 trivial. 0 not checked. [2024-08-15 18:03:44,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183997283] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:03:44,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:03:44,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 23 [2024-08-15 18:03:44,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116128185] [2024-08-15 18:03:44,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:03:44,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-08-15 18:03:44,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:03:44,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-08-15 18:03:44,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2024-08-15 18:03:44,342 INFO L87 Difference]: Start difference. First operand 365 states and 432 transitions. Second operand has 23 states, 23 states have (on average 5.043478260869565) internal successors, (116), 22 states have internal predecessors, (116), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-08-15 18:03:44,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:03:44,502 INFO L93 Difference]: Finished difference Result 405 states and 472 transitions. [2024-08-15 18:03:44,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-15 18:03:44,503 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.043478260869565) internal successors, (116), 22 states have internal predecessors, (116), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 358 [2024-08-15 18:03:44,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:03:44,504 INFO L225 Difference]: With dead ends: 405 [2024-08-15 18:03:44,505 INFO L226 Difference]: Without dead ends: 405 [2024-08-15 18:03:44,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 715 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2024-08-15 18:03:44,506 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:03:44,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 122 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:03:44,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-08-15 18:03:44,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2024-08-15 18:03:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 393 states have (on average 1.173027989821883) internal successors, (461), 393 states have internal predecessors, (461), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-15 18:03:44,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 472 transitions. [2024-08-15 18:03:44,529 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 472 transitions. Word has length 358 [2024-08-15 18:03:44,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:03:44,530 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 472 transitions. [2024-08-15 18:03:44,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.043478260869565) internal successors, (116), 22 states have internal predecessors, (116), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-08-15 18:03:44,535 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 472 transitions. [2024-08-15 18:03:44,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2024-08-15 18:03:44,539 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:03:44,539 INFO L195 NwaCegarLoop]: trace histogram [63, 60, 60, 33, 27, 21, 20, 20, 20, 10, 9, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:03:44,556 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-08-15 18:03:44,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:03:44,741 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:03:44,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:03:44,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1017961724, now seen corresponding path program 2 times [2024-08-15 18:03:44,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:03:44,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740230066] [2024-08-15 18:03:44,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:03:44,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:03:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:03:45,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:03:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:03:45,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-08-15 18:03:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:03:45,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-08-15 18:03:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:03:45,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-08-15 18:03:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:03:45,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-08-15 18:03:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:03:45,287 INFO L134 CoverageAnalysis]: Checked inductivity of 8420 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 8258 trivial. 0 not checked. [2024-08-15 18:03:45,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:03:45,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740230066] [2024-08-15 18:03:45,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740230066] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:03:45,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884448959] [2024-08-15 18:03:45,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-15 18:03:45,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:03:45,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:03:45,291 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-15 18:03:45,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-08-15 18:03:45,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-15 18:03:45,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-15 18:03:45,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 11 conjunts are in the unsatisfiable core [2024-08-15 18:03:45,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:03:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8420 backedges. 3372 proven. 162 refuted. 0 times theorem prover too weak. 4886 trivial. 0 not checked. [2024-08-15 18:03:45,577 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:03:45,813 INFO L134 CoverageAnalysis]: Checked inductivity of 8420 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 8258 trivial. 0 not checked. [2024-08-15 18:03:45,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884448959] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:03:45,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:03:45,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 23 [2024-08-15 18:03:45,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255117212] [2024-08-15 18:03:45,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:03:45,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-08-15 18:03:45,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:03:45,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-08-15 18:03:45,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2024-08-15 18:03:45,818 INFO L87 Difference]: Start difference. First operand 405 states and 472 transitions. Second operand has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 22 states have internal predecessors, (117), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-08-15 18:03:45,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:03:45,932 INFO L93 Difference]: Finished difference Result 445 states and 512 transitions. [2024-08-15 18:03:45,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-15 18:03:45,933 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 22 states have internal predecessors, (117), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 398 [2024-08-15 18:03:45,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:03:45,935 INFO L225 Difference]: With dead ends: 445 [2024-08-15 18:03:45,935 INFO L226 Difference]: Without dead ends: 445 [2024-08-15 18:03:45,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 795 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2024-08-15 18:03:45,936 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 17 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:03:45,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 76 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:03:45,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-08-15 18:03:45,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2024-08-15 18:03:45,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 433 states have (on average 1.1570438799076213) internal successors, (501), 433 states have internal predecessors, (501), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-15 18:03:45,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 512 transitions. [2024-08-15 18:03:45,945 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 512 transitions. Word has length 398 [2024-08-15 18:03:45,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:03:45,946 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 512 transitions. [2024-08-15 18:03:45,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 22 states have internal predecessors, (117), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-08-15 18:03:45,946 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 512 transitions. [2024-08-15 18:03:45,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2024-08-15 18:03:45,951 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:03:45,951 INFO L195 NwaCegarLoop]: trace histogram [63, 60, 60, 33, 27, 21, 20, 20, 20, 20, 19, 19, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:03:45,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-08-15 18:03:46,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-08-15 18:03:46,153 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:03:46,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:03:46,157 INFO L85 PathProgramCache]: Analyzing trace with hash -953867110, now seen corresponding path program 3 times [2024-08-15 18:03:46,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:03:46,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564689157] [2024-08-15 18:03:46,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:03:46,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:03:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-08-15 18:03:46,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1346753345] [2024-08-15 18:03:46,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-15 18:03:46,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:03:46,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:03:46,948 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-15 18:03:46,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-08-15 18:03:59,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2024-08-15 18:03:59,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-08-15 18:03:59,969 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-15 18:04:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:04:02,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-15 18:04:02,928 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-15 18:04:02,930 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-15 18:04:02,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-08-15 18:04:03,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:04:03,135 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2024-08-15 18:04:03,139 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2024-08-15 18:04:03,255 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.08 06:04:03 BoogieIcfgContainer [2024-08-15 18:04:03,255 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-15 18:04:03,255 INFO L158 Benchmark]: Toolchain (without parser) took 22413.64ms. Allocated memory was 151.0MB in the beginning and 287.3MB in the end (delta: 136.3MB). Free memory was 69.3MB in the beginning and 171.1MB in the end (delta: -101.8MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. [2024-08-15 18:04:03,256 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 103.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:04:03,256 INFO L158 Benchmark]: Witness Parser took 0.11ms. Allocated memory is still 151.0MB. Free memory was 79.0MB in the beginning and 78.7MB in the end (delta: 211.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:04:03,256 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.53ms. Allocated memory is still 151.0MB. Free memory was 69.1MB in the beginning and 57.3MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-08-15 18:04:03,256 INFO L158 Benchmark]: Boogie Preprocessor took 42.92ms. Allocated memory is still 151.0MB. Free memory was 57.3MB in the beginning and 55.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-15 18:04:03,257 INFO L158 Benchmark]: IcfgBuilder took 310.74ms. Allocated memory is still 151.0MB. Free memory was 55.0MB in the beginning and 108.5MB in the end (delta: -53.5MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-08-15 18:04:03,257 INFO L158 Benchmark]: TraceAbstraction took 21828.96ms. Allocated memory was 151.0MB in the beginning and 287.3MB in the end (delta: 136.3MB). Free memory was 108.0MB in the beginning and 171.1MB in the end (delta: -63.1MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. [2024-08-15 18:04:03,258 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.19ms. Allocated memory is still 151.0MB. Free memory is still 103.6MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.11ms. Allocated memory is still 151.0MB. Free memory was 79.0MB in the beginning and 78.7MB in the end (delta: 211.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.53ms. Allocated memory is still 151.0MB. Free memory was 69.1MB in the beginning and 57.3MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.92ms. Allocated memory is still 151.0MB. Free memory was 57.3MB in the beginning and 55.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 310.74ms. Allocated memory is still 151.0MB. Free memory was 55.0MB in the beginning and 108.5MB in the end (delta: -53.5MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * TraceAbstraction took 21828.96ms. Allocated memory was 151.0MB in the beginning and 287.3MB in the end (delta: 136.3MB). Free memory was 108.0MB in the beginning and 171.1MB in the end (delta: -63.1MB). Peak memory consumption was 71.8MB. 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: 61]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int x[20]; VAL [x={3:0}] [L43] CALL init_nondet(x) VAL [\old(x)={3:0}] [L16] int i; [L17] i = 0 VAL [\old(x)={3:0}, i=0, x={3:0}] [L17] COND TRUE i < 20 VAL [\old(x)={3:0}, i=0, x={3:0}] [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [\old(x)={3:0}, i=1, x={3:0}] [L17] COND TRUE i < 20 VAL [\old(x)={3:0}, i=1, x={3:0}] [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [\old(x)={3:0}, i=2, x={3:0}] [L17] COND TRUE i < 20 VAL [\old(x)={3:0}, i=2, x={3:0}] [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [\old(x)={3:0}, i=3, x={3:0}] [L17] COND TRUE i < 20 VAL [\old(x)={3:0}, i=3, x={3:0}] [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [\old(x)={3:0}, i=4, x={3:0}] [L17] COND TRUE i < 20 VAL [\old(x)={3:0}, i=4, x={3:0}] [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [\old(x)={3:0}, i=5, x={3:0}] [L17] COND TRUE i < 20 VAL [\old(x)={3:0}, i=5, x={3:0}] [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [\old(x)={3:0}, i=6, x={3:0}] [L17] COND TRUE i < 20 VAL [\old(x)={3:0}, i=6, x={3:0}] [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [\old(x)={3:0}, i=7, x={3:0}] [L17] COND TRUE i < 20 VAL [\old(x)={3:0}, i=7, x={3:0}] [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [\old(x)={3:0}, i=8, x={3:0}] [L17] COND TRUE i < 20 VAL [\old(x)={3:0}, i=8, x={3:0}] [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [\old(x)={3:0}, i=9, x={3:0}] [L17] COND TRUE i < 20 VAL [\old(x)={3:0}, i=9, x={3:0}] [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [\old(x)={3:0}, i=10, x={3:0}] [L17] COND TRUE i < 20 VAL [\old(x)={3:0}, i=10, x={3:0}] [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [\old(x)={3:0}, i=11, x={3:0}] [L17] COND TRUE i < 20 VAL [\old(x)={3:0}, i=11, x={3:0}] [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [\old(x)={3:0}, i=12, x={3:0}] [L17] COND TRUE i < 20 VAL [\old(x)={3:0}, i=12, x={3:0}] [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [\old(x)={3:0}, i=13, x={3:0}] [L17] COND TRUE i < 20 VAL [\old(x)={3:0}, i=13, x={3:0}] [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [\old(x)={3:0}, i=14, x={3:0}] [L17] COND TRUE i < 20 VAL [\old(x)={3:0}, i=14, x={3:0}] [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [\old(x)={3:0}, i=15, x={3:0}] [L17] COND TRUE i < 20 VAL [\old(x)={3:0}, i=15, x={3:0}] [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [\old(x)={3:0}, i=16, x={3:0}] [L17] COND TRUE i < 20 VAL [\old(x)={3:0}, i=16, x={3:0}] [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [\old(x)={3:0}, i=17, x={3:0}] [L17] COND TRUE i < 20 VAL [\old(x)={3:0}, i=17, x={3:0}] [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [\old(x)={3:0}, i=18, x={3:0}] [L17] COND TRUE i < 20 VAL [\old(x)={3:0}, i=18, x={3:0}] [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [\old(x)={3:0}, i=19, x={3:0}] [L17] COND TRUE i < 20 VAL [\old(x)={3:0}, i=19, x={3:0}] [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [\old(x)={3:0}, i=20, x={3:0}] [L17] COND FALSE !(i < 20) VAL [\old(x)={3:0}, x={3:0}] [L43] RET init_nondet(x) VAL [x={3:0}] [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={3:0}] [L49] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=11, ret=1717986894, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=12, ret=1717986894, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=1, i=12, ret=1717986894, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=12, ret=-429496745, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=13, ret=-429496745, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=2, i=13, ret=-429496745, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=13, ret=-2576980385, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=14, ret=-2576980385, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=3, i=14, ret=-2576980385, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=14, ret=-4724464028, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=15, ret=-4724464028, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=4, i=15, ret=-4724464028, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=5, i=15, ret=-6871947670, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=5, i=16, ret=-6871947670, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=5, i=16, ret=-6871947670, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=6, i=16, ret=-5153960764, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=6, i=17, ret=-5153960764, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=6, i=17, ret=-5153960764, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=7, i=17, ret=-3435973854, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=7, i=18, ret=-3435973854, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=7, i=18, ret=-3435973854, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=8, i=18, ret=-1717986947, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=8, i=19, ret=-1717986947, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=8, i=19, ret=-1717986947, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=9, i=19, ret=-35, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=9, i=20, ret=-35, x={3:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={3:0}, cnt=9, ret=-35, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-3, x={3:0}] [L49] RET, EXPR rangesum(x) VAL [x={3:0}] [L49] ret = rangesum(x) [L51] EXPR x[0] [L51] temp=x[0] [L51] EXPR x[1] [L51] x[0] = x[1] [L51] x[1] = temp VAL [ret=-3, x={3:0}] [L52] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=11, ret=1717986894, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=12, ret=1717986894, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=1, i=12, ret=1717986894, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=12, ret=-429496745, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=13, ret=-429496745, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=2, i=13, ret=-429496745, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=13, ret=-2576980385, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=14, ret=-2576980385, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=3, i=14, ret=-2576980385, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=14, ret=-4724464028, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=15, ret=-4724464028, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=4, i=15, ret=-4724464028, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=5, i=15, ret=-6871947670, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=5, i=16, ret=-6871947670, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=5, i=16, ret=-6871947670, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=6, i=16, ret=-5153960764, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=6, i=17, ret=-5153960764, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=6, i=17, ret=-5153960764, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=7, i=17, ret=-3435973854, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=7, i=18, ret=-3435973854, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=7, i=18, ret=-3435973854, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=8, i=18, ret=-1717986947, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=8, i=19, ret=-1717986947, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=8, i=19, ret=-1717986947, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=9, i=19, ret=-35, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=9, i=20, ret=-35, x={3:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={3:0}, cnt=9, ret=-35, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-3, x={3:0}] [L52] RET, EXPR rangesum(x) VAL [ret=-3, x={3:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L54] COND TRUE i<20 -1 VAL [i=0, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L54] COND TRUE i<20 -1 VAL [i=1, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L54] COND TRUE i<20 -1 VAL [i=2, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L54] COND TRUE i<20 -1 VAL [i=3, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L54] COND TRUE i<20 -1 VAL [i=4, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=5, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L54] COND TRUE i<20 -1 VAL [i=5, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=6, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L54] COND TRUE i<20 -1 VAL [i=6, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=7, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L54] COND TRUE i<20 -1 VAL [i=7, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=8, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L54] COND TRUE i<20 -1 VAL [i=8, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=9, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L54] COND TRUE i<20 -1 VAL [i=9, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=10, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L54] COND TRUE i<20 -1 VAL [i=10, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=11, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L54] COND TRUE i<20 -1 VAL [i=11, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=12, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L54] COND TRUE i<20 -1 VAL [i=12, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=13, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L54] COND TRUE i<20 -1 VAL [i=13, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=14, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L54] COND TRUE i<20 -1 VAL [i=14, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=15, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L54] COND TRUE i<20 -1 VAL [i=15, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=16, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L54] COND TRUE i<20 -1 VAL [i=16, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=17, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L54] COND TRUE i<20 -1 VAL [i=17, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=18, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L54] COND TRUE i<20 -1 VAL [i=18, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=19, ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L54] COND FALSE !(i<20 -1) VAL [ret2=-3, ret=-3, temp=1717986911, x={3:0}] [L57] x[20 -1] = temp VAL [ret2=-3, ret=-3, x={3:0}] [L58] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=11, ret=-2147483639, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=12, ret=-2147483639, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=1, i=12, ret=-2147483639, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=12, ret=-4294967279, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=13, ret=-4294967279, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=2, i=13, ret=-4294967279, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=13, ret=-6442450922, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=14, ret=-6442450922, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=3, i=14, ret=-6442450922, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=14, ret=-8589934564, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=15, ret=-8589934564, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=4, i=15, ret=-8589934564, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=5, i=15, ret=-6871947658, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=5, i=16, ret=-6871947658, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=5, i=16, ret=-6871947658, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=6, i=16, ret=-5153960748, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=6, i=17, ret=-5153960748, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=6, i=17, ret=-5153960748, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=7, i=17, ret=-3435973841, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=7, i=18, ret=-3435973841, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=7, i=18, ret=-3435973841, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=8, i=18, ret=-1717986929, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=8, i=19, ret=-1717986929, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=8, i=19, ret=-1717986929, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=9, i=19, ret=-18, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=9, i=20, ret=-18, x={3:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={3:0}, cnt=9, ret=-18, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-2, x={3:0}] [L58] RET, EXPR rangesum(x) VAL [ret2=-3, ret=-3, x={3:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [x={3:0}] [L61] reach_error() VAL [x={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.7s, OverallIterations: 4, TraceHistogramMax: 63, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 248 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 258 IncrementalHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 87 mSDtfsCounter, 258 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1572 GetRequests, 1525 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3704occurred in iteration=0, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 120 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 14.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2742 NumberOfCodeBlocks, 2742 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 2615 ConstructedInterpolants, 0 QuantifiedInterpolants, 3101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1584 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 55261/56347 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-08-15 18:04:03,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE