./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/array-fpi/ms5f.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/ms5f.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 0a70ae82 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/array-fpi/ms5f.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/ms5f.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-0a70ae8-m [2024-08-07 13:44:59,126 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-07 13:44:59,205 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-08-07 13:44:59,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-07 13:44:59,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-07 13:44:59,245 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-07 13:44:59,246 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-07 13:44:59,246 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-07 13:44:59,247 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-07 13:44:59,248 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-07 13:44:59,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-07 13:44:59,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-07 13:44:59,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-07 13:44:59,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-07 13:44:59,251 INFO L153 SettingsManager]: * Use SBE=true [2024-08-07 13:44:59,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-07 13:44:59,251 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-07 13:44:59,252 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-07 13:44:59,252 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-07 13:44:59,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-07 13:44:59,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-07 13:44:59,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-07 13:44:59,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-07 13:44:59,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-07 13:44:59,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-07 13:44:59,255 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-07 13:44:59,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-07 13:44:59,256 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-07 13:44:59,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-07 13:44:59,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-07 13:44:59,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-07 13:44:59,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-07 13:44:59,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-07 13:44:59,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-07 13:44:59,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-07 13:44:59,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-07 13:44:59,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-07 13:44:59,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-07 13:44:59,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-07 13:44:59,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-07 13:44:59,261 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-07 13:44:59,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-07 13:44:59,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-07 13:44:59,261 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-07 13:44:59,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-07 13:44:59,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-07 13:44:59,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-07 13:44:59,602 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-07 13:44:59,603 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-07 13:44:59,604 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/ms5f.yml/witness.yml [2024-08-07 13:44:59,678 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-07 13:44:59,679 INFO L274 PluginConnector]: CDTParser initialized [2024-08-07 13:44:59,679 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ms5f.c [2024-08-07 13:45:01,153 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-07 13:45:01,355 INFO L384 CDTParser]: Found 1 translation units. [2024-08-07 13:45:01,355 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ms5f.c [2024-08-07 13:45:01,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87774a2bf/36ca39e45d914258b02fdd68d40188ed/FLAGcaaf6f291 [2024-08-07 13:45:01,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87774a2bf/36ca39e45d914258b02fdd68d40188ed [2024-08-07 13:45:01,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-07 13:45:01,387 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-07 13:45:01,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-07 13:45:01,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-07 13:45:01,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-07 13:45:01,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 01:44:59" (1/2) ... [2024-08-07 13:45:01,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6df5dc28 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 01:45:01, skipping insertion in model container [2024-08-07 13:45:01,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 01:44:59" (1/2) ... [2024-08-07 13:45:01,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4f84f435 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 01:45:01, skipping insertion in model container [2024-08-07 13:45:01,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 01:45:01" (2/2) ... [2024-08-07 13:45:01,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6df5dc28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:45:01, skipping insertion in model container [2024-08-07 13:45:01,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 01:45:01" (2/2) ... [2024-08-07 13:45:01,424 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-07 13:45:01,604 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ms5f.c[587,600] [2024-08-07 13:45:01,636 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 13:45:01,645 INFO L200 MainTranslator]: Completed pre-run [2024-08-07 13:45:01,657 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ms5f.c[587,600] [2024-08-07 13:45:01,667 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 13:45:01,685 INFO L204 MainTranslator]: Completed translation [2024-08-07 13:45:01,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:45:01 WrapperNode [2024-08-07 13:45:01,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-07 13:45:01,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-07 13:45:01,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-07 13:45:01,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-07 13:45:01,700 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:45:01" (1/1) ... [2024-08-07 13:45:01,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:45:01" (1/1) ... [2024-08-07 13:45:01,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:45:01" (1/1) ... [2024-08-07 13:45:01,735 INFO L175 MemorySlicer]: Split 15 memory accesses to 4 slices as follows [2, 7, 4, 2]. 47 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 3 writes are split as follows [0, 0, 2, 1]. [2024-08-07 13:45:01,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:45:01" (1/1) ... [2024-08-07 13:45:01,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:45:01" (1/1) ... [2024-08-07 13:45:01,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:45:01" (1/1) ... [2024-08-07 13:45:01,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:45:01" (1/1) ... [2024-08-07 13:45:01,752 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:45:01" (1/1) ... [2024-08-07 13:45:01,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-07 13:45:01,758 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-07 13:45:01,758 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-07 13:45:01,758 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-07 13:45:01,759 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:45:01" (1/1) ... [2024-08-07 13:45:01,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-07 13:45:01,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-07 13:45:01,796 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-07 13:45:01,799 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-07 13:45:01,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-07 13:45:01,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-07 13:45:01,848 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-07 13:45:01,848 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-07 13:45:01,848 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-07 13:45:01,848 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-07 13:45:01,848 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-07 13:45:01,849 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-07 13:45:01,849 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-07 13:45:01,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-07 13:45:01,849 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-07 13:45:01,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-07 13:45:01,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2024-08-07 13:45:01,849 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2024-08-07 13:45:01,849 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-07 13:45:01,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-08-07 13:45:01,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-08-07 13:45:01,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-07 13:45:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-08-07 13:45:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-08-07 13:45:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-08-07 13:45:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-07 13:45:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-08-07 13:45:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-08-07 13:45:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-08-07 13:45:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-07 13:45:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-07 13:45:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-07 13:45:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-08-07 13:45:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-08-07 13:45:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-08-07 13:45:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-07 13:45:01,943 INFO L273 CfgBuilder]: Building ICFG [2024-08-07 13:45:01,946 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-07 13:45:02,087 INFO L1251 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(~#sum~0.base, ~#sum~0.offset);havoc ~#sum~0.base, ~#sum~0.offset; [2024-08-07 13:45:02,169 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-08-07 13:45:02,170 INFO L327 CfgBuilder]: Performing block encoding [2024-08-07 13:45:02,180 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-07 13:45:02,181 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-07 13:45:02,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 01:45:02 BoogieIcfgContainer [2024-08-07 13:45:02,183 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-07 13:45:02,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-07 13:45:02,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-07 13:45:02,189 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-07 13:45:02,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 01:44:59" (1/4) ... [2024-08-07 13:45:02,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac770c8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 07.08 01:45:02, skipping insertion in model container [2024-08-07 13:45:02,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.08 01:45:01" (2/4) ... [2024-08-07 13:45:02,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac770c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 01:45:02, skipping insertion in model container [2024-08-07 13:45:02,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:45:01" (3/4) ... [2024-08-07 13:45:02,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac770c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 01:45:02, skipping insertion in model container [2024-08-07 13:45:02,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 01:45:02" (4/4) ... [2024-08-07 13:45:02,192 INFO L119 eAbstractionObserver]: Analyzing ICFG ms5f.c [2024-08-07 13:45:02,193 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-07 13:45:02,213 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-07 13:45:02,214 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-07 13:45:02,253 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:02,253 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:02,258 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:02,259 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:02,261 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:02,262 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:02,262 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:02,263 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:02,264 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:02,265 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:02,265 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:02,265 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:02,266 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:02,267 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:02,268 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:02,269 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:02,270 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:02,270 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:02,271 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,272 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,272 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:02,275 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:02,275 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,276 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,276 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:02,276 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:02,276 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,277 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,277 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,277 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,278 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,280 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,280 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,281 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,282 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,282 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,282 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,283 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,284 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,284 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,286 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,286 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,286 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,287 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,287 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,287 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,288 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,288 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,288 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,288 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,289 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,289 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,289 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,289 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,290 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,290 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,290 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,291 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,291 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,291 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,291 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,292 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,292 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,293 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,293 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,293 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,294 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,294 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,294 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,295 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,296 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,296 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,296 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,296 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,297 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,297 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,297 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,297 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,297 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,298 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,298 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,298 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,299 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,299 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,300 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,300 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,300 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,300 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,300 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,301 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,301 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,301 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,301 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,302 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,302 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,303 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,304 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,305 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,305 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,305 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,305 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,306 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,306 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,306 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,307 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,307 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,307 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,307 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,307 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,308 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,308 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,308 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,308 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,308 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,308 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,308 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,309 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,309 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,309 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,309 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,310 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,310 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,311 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,311 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,312 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,312 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,312 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,312 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,313 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,313 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,313 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,313 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,313 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,314 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,314 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,314 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,314 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,315 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,315 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,315 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,315 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,315 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,316 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,316 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,316 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,317 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,317 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,317 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,317 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,317 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,318 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,318 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,319 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,319 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,320 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,320 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,320 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,320 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,320 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,321 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,321 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,321 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,322 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,322 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,322 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,323 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,323 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,323 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,324 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,325 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,325 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,325 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,326 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,326 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,326 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,326 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,326 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,326 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,327 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,327 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,328 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,328 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,328 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,328 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,329 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,329 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,329 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,329 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,329 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,330 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,330 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,330 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,330 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,330 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,330 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,330 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,331 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,331 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,331 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,331 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,332 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,332 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,332 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,332 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,333 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,333 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,334 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,334 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,334 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,334 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,335 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,338 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,338 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,338 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,339 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,339 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,339 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,339 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,340 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,340 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,340 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,340 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,340 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,341 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,341 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,341 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,341 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,354 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,355 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,355 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,355 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,355 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,355 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,355 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,356 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,356 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,356 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:02,356 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,356 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,356 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,357 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,357 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,357 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,357 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,357 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,357 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,357 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,357 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,358 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,358 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,358 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,358 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,362 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,363 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,363 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:02,363 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,363 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,363 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,363 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,364 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,364 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,364 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,364 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,364 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,364 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,364 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,364 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,365 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,365 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:02,365 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,365 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,365 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,366 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,366 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,366 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,366 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,367 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,367 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,367 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,367 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,368 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,368 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,371 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:02,374 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,375 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,375 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,375 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,375 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,375 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,375 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,375 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,376 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,376 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,376 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,376 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:02,376 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,376 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,377 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,380 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,380 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,380 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,380 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,381 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:02,381 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,381 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,381 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,382 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:02,382 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,382 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:02,382 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,382 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:02,382 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,394 INFO L90 WitnessUtils]: NestedWordAutomaton nwa = ( callAlphabet = {"call ULTIMATE.init();" "call __VERIFIER_assert((if #t~mem10 > 4 * ~N~0 then 1 else 0));" "call assume_abort_if_not((if ~N~0 % 4294967296 <= 536870911 then 1 else 0));" "call #t~ret11 := main();" }, internalAlphabet = {"havoc #t~mem10;#res := 1;call ULTIMATE.dealloc(~#sum~0.base, ~#sum~0.offset);havoc ~#sum~0.base, ~#sum~0.offset;" "SUMMARY for call __VERIFIER_assert((if #t~mem10 > 4 * ~N~0 then 1 else 0)); srcloc: L44-1" "call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);" "#t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9;" "assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);" "assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;" "assume ~i~0 < ~N~0;" "assume !(~i~0 < ~N~0);" "assume true;" "assume !true;" "~i~0 := 0;" "#t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6;" "call write~int#3((if ~i~0 < 0 && 0 != ~i~0 % 5 then ~i~0 % 5 - 5 else ~i~0 % 5), ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);" "assume ~i~0 < ~N~0;" "assume !(~i~0 < ~N~0);" "assume true;" "assume !true;" "havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(4 * ~N~0 % 4294967296);~a~0.base, ~a~0.offset := #t~malloc5.base, #t~malloc5.offset;havoc #t~malloc5.base, #t~malloc5.offset;~i~0 := 0;" "SUMMARY for call assume_abort_if_not((if ~N~0 % 4294967296 <= 536870911 then 1 else 0)); srcloc: L25-1" "assume ~N~0 <= 0;#res := 1;" "assume !(~N~0 <= 0);" "havoc #t~nondet4;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4;" "assume true;" "assume 0 == ~cond;assume false;" "assume !(0 == ~cond);" "~cond := #in~cond;" "assume true;" "assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int#1(109, 2, 0, 1);call write~init~int#1(115, 2, 1, 1);call write~init~int#1(53, 2, 2, 1);call write~init~int#1(102, 2, 3, 1);call write~init~int#1(46, 2, 4, 1);call write~init~int#1(99, 2, 5, 1);call write~init~int#1(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~N~0 := 0;" "assume true;" "SUMMARY for call #t~ret11 := main(); srcloc: L-1" "SUMMARY for call ULTIMATE.init(); srcloc: ULTIMATE.startENTRY" "assume true;" "assume false;" "assume false;" "assume !false;" "assume 0 == ~cond;" "assume !(0 == ~cond);" "~cond := #in~cond;" "assume true;" }, returnAlphabet = {"#49#return;" "#43#return;" "#45#return;" "#47#return;" }, states = {"CountingPredicate [underlying: 19#L44-1true, annotation: [6, 0]]" "CountingPredicate [underlying: 26#__VERIFIER_assertFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 29#assume_abort_if_notFINALtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 37#ERRORtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 8#L36-2true, annotation: [2, 0]]" "CountingPredicate [underlying: 19#L44-1true, annotation: [2, 0]]" "CountingPredicate [underlying: 14#L25-1true, annotation: [1, 0]]" "CountingPredicate [underlying: 26#__VERIFIER_assertFINALtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 37#ERRORtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 31#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 6#Loop~0true, annotation: [5, 0]]" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 27#L44-2true, annotation: [4, 0]]" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 16#L15-2true, annotation: [10, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 12#L38true, annotation: [7, 0]]" "CountingPredicate [underlying: 5#L31true, annotation: [4, 0]]" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 13#L36-3true, annotation: [2, 0]]" "CountingPredicate [underlying: 16#L15-2true, annotation: [2, 0]]" "CountingPredicate [underlying: 33#L15true, annotation: [12, 0]]" "CountingPredicate [underlying: 26#__VERIFIER_assertFINALtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 17#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 13#L36-3true, annotation: [6, 0]]" "CountingPredicate [underlying: 16#L15-2true, annotation: [6, 0]]" "CountingPredicate [underlying: 35#assume_abort_if_notENTRYtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 18#L33true, annotation: [5, 0]]" "CountingPredicate [underlying: 17#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 33#L15true, annotation: [7, 0]]" "CountingPredicate [underlying: 24#L31-2true, annotation: [2, 0]]" "CountingPredicate [underlying: 20#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 15#L36true, annotation: [6, 0]]" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 25#L44true, annotation: [7, 0]]" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 15#L36true, annotation: [2, 0]]" "CountingPredicate [underlying: 29#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 19#L44-1true, annotation: [7, 0]]" "CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 27#L44-2true, annotation: [9, 0]]" "CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 12#L38true, annotation: [8, 0]]" "CountingPredicate [underlying: 25#L44true, annotation: [6, 0]]" "CountingPredicate [underlying: 4#L25true, annotation: [4, 0]]" "CountingPredicate [underlying: 11#Loop~1true, annotation: [2, 0]]" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 25#L44true, annotation: [2, 0]]" "CountingPredicate [underlying: 24#L31-2true, annotation: [5, 0]]" "CountingPredicate [underlying: 17#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 12#L38true, annotation: [4, 0]]" "CountingPredicate [underlying: 18#L33true, annotation: [2, 0]]" "CountingPredicate [underlying: 33#L15true, annotation: [6, 0]]" "CountingPredicate [underlying: 33#L15true, annotation: [2, 0]]" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 25#L44true, annotation: [10, 0]]" "CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "CountingPredicate [underlying: 37#ERRORtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 8#L36-2true, annotation: [4, 0]]" "CountingPredicate [underlying: 19#L44-1true, annotation: [4, 0]]" "CountingPredicate [underlying: 26#__VERIFIER_assertFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 3#L24true, annotation: [0, 0]]" "CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 8#L36-2true, annotation: [8, 0]]" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 27#L44-2true, annotation: [6, 0]]" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 11#Loop~1true, annotation: [7, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 27#L44-2true, annotation: [2, 0]]" "CountingPredicate [underlying: 5#L31true, annotation: [2, 0]]" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 16#L15-2true, annotation: [4, 0]]" "CountingPredicate [underlying: 28#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 17#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 13#L36-3true, annotation: [4, 0]]" "CountingPredicate [underlying: 26#__VERIFIER_assertFINALtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 17#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 15#L36true, annotation: [4, 0]]" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 15#L36true, annotation: [8, 0]]" "CountingPredicate [underlying: 22#mainENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 23#L13true, annotation: [2, 0]]" "CountingPredicate [underlying: 9#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 37#ERRORtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 31#assume_abort_if_notEXITtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 8#L36-2true, annotation: [7, 0]]" "CountingPredicate [underlying: 6#Loop~0true, annotation: [2, 0]]" "CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 27#L44-2true, annotation: [7, 0]]" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 19#L44-1true, annotation: [9, 0]]" "CountingPredicate [underlying: 25#L44true, annotation: [4, 0]]" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 11#Loop~1true, annotation: [8, 0]]" "CountingPredicate [underlying: 4#L25true, annotation: [2, 0]]" "CountingPredicate [underlying: 5#L31true, annotation: [5, 0]]" "CountingPredicate [underlying: 11#Loop~1true, annotation: [4, 0]]" "CountingPredicate [underlying: 26#__VERIFIER_assertFINALtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 12#L38true, annotation: [2, 0]]" "CountingPredicate [underlying: 16#L15-2true, annotation: [7, 0]]" "CountingPredicate [underlying: 33#L15true, annotation: [4, 0]]" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 25#L44true, annotation: [12, 0]]" "CountingPredicate [underlying: 15#L36true, annotation: [7, 0]]" "CountingPredicate [underlying: 21#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 37#ERRORtrue, annotation: [11, 0]]" }, initialStates = {"CountingPredicate [underlying: 21#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" }, finalStates = {"CountingPredicate [underlying: 17#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [12, 0]]" }, callTransitions = { ("CountingPredicate [underlying: 19#L44-1true, annotation: [6, 0]]" "call __VERIFIER_assert((if #t~mem10 > 4 * ~N~0 then 1 else 0));" "CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 19#L44-1true, annotation: [2, 0]]" "call __VERIFIER_assert((if #t~mem10 > 4 * ~N~0 then 1 else 0));" "CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 14#L25-1true, annotation: [1, 0]]" "call assume_abort_if_not((if ~N~0 % 4294967296 <= 536870911 then 1 else 0));" "CountingPredicate [underlying: 35#assume_abort_if_notENTRYtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 19#L44-1true, annotation: [7, 0]]" "call __VERIFIER_assert((if #t~mem10 > 4 * ~N~0 then 1 else 0));" "CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "call #t~ret11 := main();" "CountingPredicate [underlying: 22#mainENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 19#L44-1true, annotation: [4, 0]]" "call __VERIFIER_assert((if #t~mem10 > 4 * ~N~0 then 1 else 0));" "CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 19#L44-1true, annotation: [9, 0]]" "call __VERIFIER_assert((if #t~mem10 > 4 * ~N~0 then 1 else 0));" "CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 21#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "call ULTIMATE.init();" "CountingPredicate [underlying: 20#ULTIMATE.initENTRYtrue, annotation: [0, 0]]") }, internalTransitions = { ("CountingPredicate [underlying: 26#__VERIFIER_assertFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 29#assume_abort_if_notFINALtrue, annotation: [3, 0]]" "assume true;" "CountingPredicate [underlying: 31#assume_abort_if_notEXITtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 37#ERRORtrue, annotation: [6, 0]]" "assume false;" "CountingPredicate [underlying: 33#L15true, annotation: [6, 0]]") ("CountingPredicate [underlying: 37#ERRORtrue, annotation: [6, 0]]" "assume !false;" "CountingPredicate [underlying: 17#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 8#L36-2true, annotation: [2, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 12#L38true, annotation: [2, 0]]") ("CountingPredicate [underlying: 8#L36-2true, annotation: [2, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 27#L44-2true, annotation: [2, 0]]") ("CountingPredicate [underlying: 26#__VERIFIER_assertFINALtrue, annotation: [6, 0]]" "assume true;" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 37#ERRORtrue, annotation: [2, 0]]" "assume false;" "CountingPredicate [underlying: 33#L15true, annotation: [2, 0]]") ("CountingPredicate [underlying: 37#ERRORtrue, annotation: [2, 0]]" "assume !false;" "CountingPredicate [underlying: 17#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [12, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 6#Loop~0true, annotation: [5, 0]]" "#t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6;" "CountingPredicate [underlying: 5#L31true, annotation: [5, 0]]") ("CountingPredicate [underlying: 34#mainFINALtrue, annotation: [12, 0]]" "assume true;" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 27#L44-2true, annotation: [4, 0]]" "call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 19#L44-1true, annotation: [4, 0]]") ("CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 34#mainFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 16#L15-2true, annotation: [10, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 37#ERRORtrue, annotation: [11, 0]]") ("CountingPredicate [underlying: 16#L15-2true, annotation: [10, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 26#__VERIFIER_assertFINALtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 12#L38true, annotation: [7, 0]]" "assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 11#Loop~1true, annotation: [8, 0]]") ("CountingPredicate [underlying: 12#L38true, annotation: [7, 0]]" "assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;" "CountingPredicate [underlying: 11#Loop~1true, annotation: [7, 0]]") ("CountingPredicate [underlying: 5#L31true, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 24#L31-2true, annotation: [5, 0]]") ("CountingPredicate [underlying: 5#L31true, annotation: [4, 0]]" "assume !true;" "CountingPredicate [underlying: 13#L36-3true, annotation: [4, 0]]") ("CountingPredicate [underlying: 34#mainFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 13#L36-3true, annotation: [2, 0]]" "~i~0 := 0;" "CountingPredicate [underlying: 15#L36true, annotation: [2, 0]]") ("CountingPredicate [underlying: 16#L15-2true, annotation: [2, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 37#ERRORtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 16#L15-2true, annotation: [2, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 26#__VERIFIER_assertFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 33#L15true, annotation: [12, 0]]" "assume false;" "CountingPredicate [underlying: 26#__VERIFIER_assertFINALtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 26#__VERIFIER_assertFINALtrue, annotation: [10, 0]]" "assume true;" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 13#L36-3true, annotation: [6, 0]]" "~i~0 := 0;" "CountingPredicate [underlying: 15#L36true, annotation: [6, 0]]") ("CountingPredicate [underlying: 16#L15-2true, annotation: [6, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 37#ERRORtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 16#L15-2true, annotation: [6, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 26#__VERIFIER_assertFINALtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 35#assume_abort_if_notENTRYtrue, annotation: [2, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 23#L13true, annotation: [2, 0]]") ("CountingPredicate [underlying: 18#L33true, annotation: [5, 0]]" "call write~int#3((if ~i~0 < 0 && 0 != ~i~0 % 5 then ~i~0 % 5 - 5 else ~i~0 % 5), ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);" "CountingPredicate [underlying: 6#Loop~0true, annotation: [5, 0]]") ("CountingPredicate [underlying: 33#L15true, annotation: [7, 0]]" "assume false;" "CountingPredicate [underlying: 26#__VERIFIER_assertFINALtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 24#L31-2true, annotation: [2, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 18#L33true, annotation: [2, 0]]") ("CountingPredicate [underlying: 24#L31-2true, annotation: [2, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 13#L36-3true, annotation: [2, 0]]") ("CountingPredicate [underlying: 20#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int#1(109, 2, 0, 1);call write~init~int#1(115, 2, 1, 1);call write~init~int#1(53, 2, 2, 1);call write~init~int#1(102, 2, 3, 1);call write~init~int#1(46, 2, 4, 1);call write~init~int#1(99, 2, 5, 1);call write~init~int#1(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~N~0 := 0;" "CountingPredicate [underlying: 28#ULTIMATE.initFINALtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 15#L36true, annotation: [6, 0]]" "assume true;" "CountingPredicate [underlying: 8#L36-2true, annotation: [7, 0]]") ("CountingPredicate [underlying: 15#L36true, annotation: [6, 0]]" "assume !true;" "CountingPredicate [underlying: 27#L44-2true, annotation: [6, 0]]") ("CountingPredicate [underlying: 25#L44true, annotation: [7, 0]]" "havoc #t~mem10;#res := 1;call ULTIMATE.dealloc(~#sum~0.base, ~#sum~0.offset);havoc ~#sum~0.base, ~#sum~0.offset;" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 15#L36true, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 8#L36-2true, annotation: [2, 0]]") ("CountingPredicate [underlying: 15#L36true, annotation: [2, 0]]" "assume !true;" "CountingPredicate [underlying: 27#L44-2true, annotation: [2, 0]]") ("CountingPredicate [underlying: 29#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 31#assume_abort_if_notEXITtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [6, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 16#L15-2true, annotation: [6, 0]]") ("CountingPredicate [underlying: 34#mainFINALtrue, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 27#L44-2true, annotation: [9, 0]]" "call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 19#L44-1true, annotation: [9, 0]]") ("CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [2, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 16#L15-2true, annotation: [2, 0]]") ("CountingPredicate [underlying: 12#L38true, annotation: [8, 0]]" "assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 11#Loop~1true, annotation: [8, 0]]") ("CountingPredicate [underlying: 12#L38true, annotation: [8, 0]]" "assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;" "CountingPredicate [underlying: 11#Loop~1true, annotation: [8, 0]]") ("CountingPredicate [underlying: 25#L44true, annotation: [6, 0]]" "havoc #t~mem10;#res := 1;call ULTIMATE.dealloc(~#sum~0.base, ~#sum~0.offset);havoc ~#sum~0.base, ~#sum~0.offset;" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 4#L25true, annotation: [4, 0]]" "havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(4 * ~N~0 % 4294967296);~a~0.base, ~a~0.offset := #t~malloc5.base, #t~malloc5.offset;havoc #t~malloc5.base, #t~malloc5.offset;~i~0 := 0;" "CountingPredicate [underlying: 5#L31true, annotation: [4, 0]]") ("CountingPredicate [underlying: 11#Loop~1true, annotation: [2, 0]]" "#t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9;" "CountingPredicate [underlying: 15#L36true, annotation: [2, 0]]") ("CountingPredicate [underlying: 25#L44true, annotation: [2, 0]]" "havoc #t~mem10;#res := 1;call ULTIMATE.dealloc(~#sum~0.base, ~#sum~0.offset);havoc ~#sum~0.base, ~#sum~0.offset;" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 24#L31-2true, annotation: [5, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 18#L33true, annotation: [5, 0]]") ("CountingPredicate [underlying: 24#L31-2true, annotation: [5, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 13#L36-3true, annotation: [6, 0]]") ("CountingPredicate [underlying: 12#L38true, annotation: [4, 0]]" "assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 11#Loop~1true, annotation: [4, 0]]") ("CountingPredicate [underlying: 12#L38true, annotation: [4, 0]]" "assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;" "CountingPredicate [underlying: 11#Loop~1true, annotation: [4, 0]]") ("CountingPredicate [underlying: 18#L33true, annotation: [2, 0]]" "call write~int#3((if ~i~0 < 0 && 0 != ~i~0 % 5 then ~i~0 % 5 - 5 else ~i~0 % 5), ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);" "CountingPredicate [underlying: 6#Loop~0true, annotation: [2, 0]]") ("CountingPredicate [underlying: 33#L15true, annotation: [6, 0]]" "assume false;" "CountingPredicate [underlying: 26#__VERIFIER_assertFINALtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 33#L15true, annotation: [2, 0]]" "assume false;" "CountingPredicate [underlying: 26#__VERIFIER_assertFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 25#L44true, annotation: [10, 0]]" "havoc #t~mem10;#res := 1;call ULTIMATE.dealloc(~#sum~0.base, ~#sum~0.offset);havoc ~#sum~0.base, ~#sum~0.offset;" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [10, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 16#L15-2true, annotation: [10, 0]]") ("CountingPredicate [underlying: 37#ERRORtrue, annotation: [4, 0]]" "assume false;" "CountingPredicate [underlying: 33#L15true, annotation: [4, 0]]") ("CountingPredicate [underlying: 37#ERRORtrue, annotation: [4, 0]]" "assume !false;" "CountingPredicate [underlying: 17#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [10, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 8#L36-2true, annotation: [4, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 12#L38true, annotation: [4, 0]]") ("CountingPredicate [underlying: 8#L36-2true, annotation: [4, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 27#L44-2true, annotation: [4, 0]]") ("CountingPredicate [underlying: 26#__VERIFIER_assertFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 3#L24true, annotation: [0, 0]]" "assume ~N~0 <= 0;#res := 1;" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 3#L24true, annotation: [0, 0]]" "assume !(~N~0 <= 0);" "CountingPredicate [underlying: 14#L25-1true, annotation: [1, 0]]") ("CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [7, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 16#L15-2true, annotation: [7, 0]]") ("CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 8#L36-2true, annotation: [8, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 12#L38true, annotation: [8, 0]]") ("CountingPredicate [underlying: 8#L36-2true, annotation: [8, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 27#L44-2true, annotation: [9, 0]]") ("CountingPredicate [underlying: 34#mainFINALtrue, annotation: [10, 0]]" "assume true;" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 27#L44-2true, annotation: [6, 0]]" "call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 19#L44-1true, annotation: [6, 0]]") ("CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [6, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 11#Loop~1true, annotation: [7, 0]]" "#t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9;" "CountingPredicate [underlying: 15#L36true, annotation: [7, 0]]") ("CountingPredicate [underlying: 27#L44-2true, annotation: [2, 0]]" "call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 19#L44-1true, annotation: [2, 0]]") ("CountingPredicate [underlying: 5#L31true, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 24#L31-2true, annotation: [2, 0]]") ("CountingPredicate [underlying: 5#L31true, annotation: [2, 0]]" "assume !true;" "CountingPredicate [underlying: 13#L36-3true, annotation: [2, 0]]") ("CountingPredicate [underlying: 34#mainFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 34#mainFINALtrue, annotation: [6, 0]]" "assume true;" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 16#L15-2true, annotation: [4, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 37#ERRORtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 16#L15-2true, annotation: [4, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 26#__VERIFIER_assertFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 28#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 9#ULTIMATE.initEXITtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 13#L36-3true, annotation: [4, 0]]" "~i~0 := 0;" "CountingPredicate [underlying: 15#L36true, annotation: [4, 0]]") ("CountingPredicate [underlying: 26#__VERIFIER_assertFINALtrue, annotation: [12, 0]]" "assume true;" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 15#L36true, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 8#L36-2true, annotation: [4, 0]]") ("CountingPredicate [underlying: 15#L36true, annotation: [4, 0]]" "assume !true;" "CountingPredicate [underlying: 27#L44-2true, annotation: [4, 0]]") ("CountingPredicate [underlying: 15#L36true, annotation: [8, 0]]" "assume true;" "CountingPredicate [underlying: 8#L36-2true, annotation: [8, 0]]") ("CountingPredicate [underlying: 15#L36true, annotation: [8, 0]]" "assume !true;" "CountingPredicate [underlying: 27#L44-2true, annotation: [9, 0]]") ("CountingPredicate [underlying: 22#mainENTRYtrue, annotation: [0, 0]]" "havoc #t~nondet4;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4;" "CountingPredicate [underlying: 3#L24true, annotation: [0, 0]]") ("CountingPredicate [underlying: 23#L13true, annotation: [2, 0]]" "assume 0 == ~cond;assume false;" "CountingPredicate [underlying: 29#assume_abort_if_notFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 23#L13true, annotation: [2, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 29#assume_abort_if_notFINALtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 37#ERRORtrue, annotation: [7, 0]]" "assume false;" "CountingPredicate [underlying: 33#L15true, annotation: [7, 0]]") ("CountingPredicate [underlying: 37#ERRORtrue, annotation: [7, 0]]" "assume !false;" "CountingPredicate [underlying: 17#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 8#L36-2true, annotation: [7, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 12#L38true, annotation: [7, 0]]") ("CountingPredicate [underlying: 8#L36-2true, annotation: [7, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 27#L44-2true, annotation: [7, 0]]") ("CountingPredicate [underlying: 6#Loop~0true, annotation: [2, 0]]" "#t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6;" "CountingPredicate [underlying: 5#L31true, annotation: [2, 0]]") ("CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [4, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 16#L15-2true, annotation: [4, 0]]") ("CountingPredicate [underlying: 27#L44-2true, annotation: [7, 0]]" "call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 19#L44-1true, annotation: [7, 0]]") ("CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 25#L44true, annotation: [4, 0]]" "havoc #t~mem10;#res := 1;call ULTIMATE.dealloc(~#sum~0.base, ~#sum~0.offset);havoc ~#sum~0.base, ~#sum~0.offset;" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 11#Loop~1true, annotation: [8, 0]]" "#t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9;" "CountingPredicate [underlying: 15#L36true, annotation: [8, 0]]") ("CountingPredicate [underlying: 4#L25true, annotation: [2, 0]]" "havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(4 * ~N~0 % 4294967296);~a~0.base, ~a~0.offset := #t~malloc5.base, #t~malloc5.offset;havoc #t~malloc5.base, #t~malloc5.offset;~i~0 := 0;" "CountingPredicate [underlying: 5#L31true, annotation: [2, 0]]") ("CountingPredicate [underlying: 5#L31true, annotation: [5, 0]]" "assume true;" "CountingPredicate [underlying: 24#L31-2true, annotation: [5, 0]]") ("CountingPredicate [underlying: 5#L31true, annotation: [5, 0]]" "assume !true;" "CountingPredicate [underlying: 13#L36-3true, annotation: [6, 0]]") ("CountingPredicate [underlying: 11#Loop~1true, annotation: [4, 0]]" "#t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9;" "CountingPredicate [underlying: 15#L36true, annotation: [4, 0]]") ("CountingPredicate [underlying: 26#__VERIFIER_assertFINALtrue, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 12#L38true, annotation: [2, 0]]" "assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 11#Loop~1true, annotation: [2, 0]]") ("CountingPredicate [underlying: 12#L38true, annotation: [2, 0]]" "assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;" "CountingPredicate [underlying: 11#Loop~1true, annotation: [2, 0]]") ("CountingPredicate [underlying: 16#L15-2true, annotation: [7, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 37#ERRORtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 16#L15-2true, annotation: [7, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 26#__VERIFIER_assertFINALtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 33#L15true, annotation: [4, 0]]" "assume false;" "CountingPredicate [underlying: 26#__VERIFIER_assertFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 25#L44true, annotation: [12, 0]]" "havoc #t~mem10;#res := 1;call ULTIMATE.dealloc(~#sum~0.base, ~#sum~0.offset);havoc ~#sum~0.base, ~#sum~0.offset;" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 15#L36true, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 8#L36-2true, annotation: [7, 0]]") ("CountingPredicate [underlying: 15#L36true, annotation: [7, 0]]" "assume !true;" "CountingPredicate [underlying: 27#L44-2true, annotation: [7, 0]]") ("CountingPredicate [underlying: 37#ERRORtrue, annotation: [11, 0]]" "assume false;" "CountingPredicate [underlying: 33#L15true, annotation: [12, 0]]") ("CountingPredicate [underlying: 37#ERRORtrue, annotation: [11, 0]]" "assume !false;" "CountingPredicate [underlying: 17#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [12, 0]]") }, returnTransitions = { ("CountingPredicate [underlying: 31#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 14#L25-1true, annotation: [1, 0]]" "#45#return;" "CountingPredicate [underlying: 4#L25true, annotation: [2, 0]]") ("CountingPredicate [underlying: 32#mainEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "#47#return;" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 32#mainEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "#47#return;" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 19#L44-1true, annotation: [4, 0]]" "#43#return;" "CountingPredicate [underlying: 25#L44true, annotation: [4, 0]]") ("CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 19#L44-1true, annotation: [9, 0]]" "#43#return;" "CountingPredicate [underlying: 25#L44true, annotation: [12, 0]]") ("CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 19#L44-1true, annotation: [7, 0]]" "#43#return;" "CountingPredicate [underlying: 25#L44true, annotation: [7, 0]]") ("CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 19#L44-1true, annotation: [2, 0]]" "#43#return;" "CountingPredicate [underlying: 25#L44true, annotation: [2, 0]]") ("CountingPredicate [underlying: 32#mainEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "#47#return;" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 32#mainEXITtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "#47#return;" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 19#L44-1true, annotation: [9, 0]]" "#43#return;" "CountingPredicate [underlying: 25#L44true, annotation: [10, 0]]") ("CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 19#L44-1true, annotation: [6, 0]]" "#43#return;" "CountingPredicate [underlying: 25#L44true, annotation: [6, 0]]") ("CountingPredicate [underlying: 32#mainEXITtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "#47#return;" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 9#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 21#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "#49#return;" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]") ("CountingPredicate [underlying: 31#assume_abort_if_notEXITtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 14#L25-1true, annotation: [1, 0]]" "#45#return;" "CountingPredicate [underlying: 4#L25true, annotation: [4, 0]]") ("CountingPredicate [underlying: 32#mainEXITtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "#47#return;" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 32#mainEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "#47#return;" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [7, 0]]") } ); [2024-08-07 13:45:02,403 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 36 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-07 13:45:02,403 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:02,404 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:02,404 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:02,404 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:02,407 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:02,408 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:02,408 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:02,408 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:02,409 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:02,409 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:02,409 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:02,409 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:02,410 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:02,410 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:02,410 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:02,410 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:02,411 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:02,411 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:02,411 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,411 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,411 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:02,411 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:02,412 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,412 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,412 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:02,412 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:02,412 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,412 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,413 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,413 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,414 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,414 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,414 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,414 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,414 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,415 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,415 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,415 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,416 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,417 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,417 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,417 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,417 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,418 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,418 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,418 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,418 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,419 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,419 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,419 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,419 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,419 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,419 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,420 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,420 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,420 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,420 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,420 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,421 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,421 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,421 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,421 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,422 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,422 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,422 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,422 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,422 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,422 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,423 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,423 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,423 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,423 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,423 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,423 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,424 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,424 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,424 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,424 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,424 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,425 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,425 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,425 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,425 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,425 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,426 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,426 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,426 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,426 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,427 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,427 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,427 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,427 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,427 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,428 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,428 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,428 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,428 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,428 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,429 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,429 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,429 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,429 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,429 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,430 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,430 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,430 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,430 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,430 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,431 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,431 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,431 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,431 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,431 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,431 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,432 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,432 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,432 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,432 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,432 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,433 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,433 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,433 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,433 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,433 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,433 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,433 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,434 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,434 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,434 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,434 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,434 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,434 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,434 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,434 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,435 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,435 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,435 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,436 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,436 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,436 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,436 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,436 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,437 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,437 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,437 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,437 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,437 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,438 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,438 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,438 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,438 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,438 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,439 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,439 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,439 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,439 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,439 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,440 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,440 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,440 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,440 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,440 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,441 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,441 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,441 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,441 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,441 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,442 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,442 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,442 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,442 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,442 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,443 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,443 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,443 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,443 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,443 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,444 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,444 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,444 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,444 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,445 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,445 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,445 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,445 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,445 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,446 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,446 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,446 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,446 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,446 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,447 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,447 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,447 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,447 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,447 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,447 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,448 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,448 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,448 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,448 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,448 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,449 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,449 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,449 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,449 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,449 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,455 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,456 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,456 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,456 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,456 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,457 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,457 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,457 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,457 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,457 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,458 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,458 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,458 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,458 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,458 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,459 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,459 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,459 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,459 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,459 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,460 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,460 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,460 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,460 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,460 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,461 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,461 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,461 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,461 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,461 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:02,462 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,462 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,462 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,462 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,462 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,463 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,463 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,463 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,463 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,463 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,464 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,464 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,464 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,464 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,464 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,465 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,465 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,466 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:02,466 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,466 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,467 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,467 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,467 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,467 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,467 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,468 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,468 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,468 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,468 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,469 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,469 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,469 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:02,469 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,470 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,470 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,470 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,470 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,471 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,471 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,471 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,471 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,471 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,472 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,472 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:02,472 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,472 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:02,473 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,473 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,473 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,473 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,473 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,474 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,474 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,474 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,474 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,474 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,474 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,475 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:02,475 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,475 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,475 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,475 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:02,475 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:02,476 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:02,476 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:02,476 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:02,476 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,476 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#2(0, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:45:02,477 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:45:02,477 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:02,481 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,482 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:02,482 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,482 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:02,483 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:02,492 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 126 states to 34 states. [2024-08-07 13:45:02,512 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-07 13:45:02,519 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;@53919edf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-07 13:45:02,520 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-07 13:45:02,521 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2024-08-07 13:45:02,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-08-07 13:45:02,526 INFO L187 NwaCegarLoop]: Found error trace [2024-08-07 13:45:02,527 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2024-08-07 13:45:02,528 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-07 13:45:02,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-07 13:45:02,533 INFO L85 PathProgramCache]: Analyzing trace with hash 24499644, now seen corresponding path program 1 times [2024-08-07 13:45:02,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-07 13:45:02,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116575633] [2024-08-07 13:45:02,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-07 13:45:02,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-07 13:45:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-07 13:45:02,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-07 13:45:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-07 13:45:02,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-08-07 13:45:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-07 13:45:02,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-07 13:45:02,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-07 13:45:02,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116575633] [2024-08-07 13:45:02,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116575633] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-07 13:45:02,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-07 13:45:02,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-07 13:45:02,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875472653] [2024-08-07 13:45:02,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-07 13:45:02,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-07 13:45:02,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-07 13:45:02,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-07 13:45:02,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-07 13:45:02,854 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-07 13:45:02,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-07 13:45:02,916 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-08-07 13:45:02,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-07 13:45:02,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-08-07 13:45:02,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-07 13:45:02,920 INFO L225 Difference]: With dead ends: 34 [2024-08-07 13:45:02,920 INFO L226 Difference]: Without dead ends: 34 [2024-08-07 13:45:02,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-07 13:45:02,925 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-07 13:45:02,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-07 13:45:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-08-07 13:45:02,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-08-07 13:45:02,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-07 13:45:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-08-07 13:45:02,961 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 26 [2024-08-07 13:45:02,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-07 13:45:02,962 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-08-07 13:45:02,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-07 13:45:02,962 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-08-07 13:45:02,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-08-07 13:45:02,963 INFO L187 NwaCegarLoop]: Found error trace [2024-08-07 13:45:02,964 INFO L195 NwaCegarLoop]: trace histogram [2, 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-07 13:45:02,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-07 13:45:02,964 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-07 13:45:02,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-07 13:45:02,965 INFO L85 PathProgramCache]: Analyzing trace with hash -18977667, now seen corresponding path program 1 times [2024-08-07 13:45:02,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-07 13:45:02,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147540159] [2024-08-07 13:45:02,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-07 13:45:02,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-07 13:45:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-07 13:45:03,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-07 13:45:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-07 13:45:03,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-08-07 13:45:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-07 13:45:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-07 13:45:03,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-07 13:45:03,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147540159] [2024-08-07 13:45:03,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147540159] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-07 13:45:03,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-07 13:45:03,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-07 13:45:03,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669694712] [2024-08-07 13:45:03,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-07 13:45:03,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-07 13:45:03,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-07 13:45:03,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-07 13:45:03,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-08-07 13:45:03,175 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-07 13:45:03,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-07 13:45:03,276 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-08-07 13:45:03,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-07 13:45:03,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-08-07 13:45:03,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-07 13:45:03,278 INFO L225 Difference]: With dead ends: 36 [2024-08-07 13:45:03,278 INFO L226 Difference]: Without dead ends: 36 [2024-08-07 13:45:03,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-08-07 13:45:03,279 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-07 13:45:03,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 32 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-07 13:45:03,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-08-07 13:45:03,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2024-08-07 13:45:03,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-07 13:45:03,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2024-08-07 13:45:03,284 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 27 [2024-08-07 13:45:03,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-07 13:45:03,284 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-08-07 13:45:03,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-07 13:45:03,284 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2024-08-07 13:45:03,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-08-07 13:45:03,285 INFO L187 NwaCegarLoop]: Found error trace [2024-08-07 13:45:03,285 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1] [2024-08-07 13:45:03,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-07 13:45:03,286 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-07 13:45:03,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-07 13:45:03,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1182443558, now seen corresponding path program 1 times [2024-08-07 13:45:03,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-07 13:45:03,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885784965] [2024-08-07 13:45:03,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-07 13:45:03,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-07 13:45:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 13:45:03,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-07 13:45:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 13:45:03,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-07 13:45:03,378 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-07 13:45:03,379 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-07 13:45:03,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-07 13:45:03,387 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-08-07 13:45:03,391 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-07 13:45:03,402 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:45:03,403 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:45:03,403 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:45:03,403 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:45:03,404 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:45:03,404 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:45:03,407 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:45:03,408 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:45:03,409 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-08-07 13:45:03,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.08 01:45:03 BoogieIcfgContainer [2024-08-07 13:45:03,418 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-07 13:45:03,420 INFO L158 Benchmark]: Toolchain (without parser) took 2031.69ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 36.7MB in the beginning and 46.6MB in the end (delta: -9.9MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2024-08-07 13:45:03,421 INFO L158 Benchmark]: Witness Parser took 0.21ms. Allocated memory is still 48.2MB. Free memory is still 24.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 13:45:03,421 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 48.2MB. Free memory is still 22.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 13:45:03,421 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.46ms. Allocated memory is still 73.4MB. Free memory was 36.4MB in the beginning and 44.7MB in the end (delta: -8.3MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-08-07 13:45:03,421 INFO L158 Benchmark]: Boogie Preprocessor took 69.07ms. Allocated memory is still 73.4MB. Free memory was 44.7MB in the beginning and 42.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-07 13:45:03,422 INFO L158 Benchmark]: IcfgBuilder took 425.10ms. Allocated memory is still 73.4MB. Free memory was 42.5MB in the beginning and 49.7MB in the end (delta: -7.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-08-07 13:45:03,424 INFO L158 Benchmark]: TraceAbstraction took 1232.67ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 49.1MB in the beginning and 46.6MB in the end (delta: 2.5MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2024-08-07 13:45:03,426 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.21ms. Allocated memory is still 48.2MB. Free memory is still 24.8MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 48.2MB. Free memory is still 22.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.46ms. Allocated memory is still 73.4MB. Free memory was 36.4MB in the beginning and 44.7MB in the end (delta: -8.3MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.07ms. Allocated memory is still 73.4MB. Free memory was 44.7MB in the beginning and 42.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 425.10ms. Allocated memory is still 73.4MB. Free memory was 42.5MB in the beginning and 49.7MB in the end (delta: -7.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1232.67ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 49.1MB in the beginning and 46.6MB in the end (delta: 2.5MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * 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, \old(N)=116] [L23] N = __VERIFIER_nondet_int() [L24] N <= 0 VAL [N=1, \old(N)=0] [L25] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [N=1, \old(N)=0, \old(cond)=1] [L13] !cond VAL [N=1, \old(N)=0, \old(cond)=1] [L25] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [N=1, \old(N)=0] [L27] int i; [L28] long long sum[1]; [L29] int *a = malloc(sizeof(int)*N); [L31] i=0 VAL [N=1, \old(N)=0, a={-1:0}, i=0, sum={9:0}] [L33] a[i] = i%5 VAL [N=1, \old(N)=0, a={-1:0}, i=0, sum={9:0}] [L31] i++ VAL [N=1, \old(N)=0, a={-1:0}, i=1, sum={9:0}] [L36] i=0 VAL [N=1, \old(N)=0, a={-1:0}, i=0, sum={9:0}] [L38] i==0 [L39] sum[0] = 0 VAL [N=1, \old(N)=0, a={-1:0}, i=0, sum={9:0}] [L36] i++ VAL [N=1, \old(N)=0, a={-1:0}, i=1, sum={9:0}] [L44] EXPR sum[0] VAL [N=1, \old(N)=0, a={-1:0}] [L44] CALL __VERIFIER_assert(sum[0] > 4*N) VAL [N=1, \old(N)=0, \old(cond)=0] [L15] !(cond) VAL [N=1, \old(N)=0, \old(cond)=0] [L15] reach_error() VAL [N=1, \old(N)=0, \old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67 IncrementalHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 37 mSDtfsCounter, 67 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 71 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 3/3 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-07 13:45:03,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with 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