./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/array-fpi/s5iff.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/s5iff.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/s5iff.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/s5iff.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:45:10,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-07 13:45:10,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-08-07 13:45:10,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-07 13:45:10,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-07 13:45:10,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-07 13:45:10,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-07 13:45:10,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-07 13:45:11,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-07 13:45:11,001 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-07 13:45:11,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-07 13:45:11,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-07 13:45:11,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-07 13:45:11,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-07 13:45:11,003 INFO L153 SettingsManager]: * Use SBE=true [2024-08-07 13:45:11,004 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-07 13:45:11,005 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-07 13:45:11,005 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-07 13:45:11,005 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-07 13:45:11,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-07 13:45:11,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-07 13:45:11,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-07 13:45:11,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-07 13:45:11,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-07 13:45:11,011 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-07 13:45:11,011 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-07 13:45:11,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-07 13:45:11,012 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-07 13:45:11,012 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-07 13:45:11,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-07 13:45:11,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-07 13:45:11,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-07 13:45:11,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-07 13:45:11,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-07 13:45:11,015 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-07 13:45:11,015 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-07 13:45:11,015 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-07 13:45:11,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-07 13:45:11,015 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-07 13:45:11,016 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-07 13:45:11,016 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-07 13:45:11,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-07 13:45:11,017 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-07 13:45:11,017 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:45:11,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-07 13:45:11,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-07 13:45:11,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-07 13:45:11,408 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-07 13:45:11,412 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-07 13:45:11,413 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/s5iff.yml/witness.yml [2024-08-07 13:45:11,483 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-07 13:45:11,484 INFO L274 PluginConnector]: CDTParser initialized [2024-08-07 13:45:11,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s5iff.c [2024-08-07 13:45:13,168 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-07 13:45:13,341 INFO L384 CDTParser]: Found 1 translation units. [2024-08-07 13:45:13,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s5iff.c [2024-08-07 13:45:13,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2d6a2fd4/72948a25080b4e7d90741116e90cc732/FLAG2ce6d7daa [2024-08-07 13:45:13,747 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2d6a2fd4/72948a25080b4e7d90741116e90cc732 [2024-08-07 13:45:13,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-07 13:45:13,751 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-07 13:45:13,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-07 13:45:13,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-07 13:45:13,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-07 13:45:13,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 01:45:11" (1/2) ... [2024-08-07 13:45:13,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@318ce6cf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 01:45:13, skipping insertion in model container [2024-08-07 13:45:13,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 01:45:11" (1/2) ... [2024-08-07 13:45:13,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6c9a404c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 01:45:13, skipping insertion in model container [2024-08-07 13:45:13,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 01:45:13" (2/2) ... [2024-08-07 13:45:13,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@318ce6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:45:13, skipping insertion in model container [2024-08-07 13:45:13,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 01:45:13" (2/2) ... [2024-08-07 13:45:13,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-07 13:45:13,959 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/s5iff.c[588,601] [2024-08-07 13:45:14,001 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 13:45:14,012 INFO L200 MainTranslator]: Completed pre-run [2024-08-07 13:45:14,025 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/s5iff.c[588,601] [2024-08-07 13:45:14,038 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 13:45:14,060 INFO L204 MainTranslator]: Completed translation [2024-08-07 13:45:14,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:45:14 WrapperNode [2024-08-07 13:45:14,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-07 13:45:14,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-07 13:45:14,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-07 13:45:14,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-07 13:45:14,075 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:14" (1/1) ... [2024-08-07 13:45:14,076 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:14" (1/1) ... [2024-08-07 13:45:14,083 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:14" (1/1) ... [2024-08-07 13:45:14,102 INFO L175 MemorySlicer]: Split 20 memory accesses to 4 slices as follows [2, 8, 6, 4]. 40 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0, 0]. The 4 writes are split as follows [0, 0, 3, 1]. [2024-08-07 13:45:14,104 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:14" (1/1) ... [2024-08-07 13:45:14,104 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:14" (1/1) ... [2024-08-07 13:45:14,111 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:14" (1/1) ... [2024-08-07 13:45:14,116 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:14" (1/1) ... [2024-08-07 13:45:14,117 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:14" (1/1) ... [2024-08-07 13:45:14,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-07 13:45:14,124 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-07 13:45:14,124 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-07 13:45:14,124 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-07 13:45:14,125 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:45:14" (1/1) ... [2024-08-07 13:45:14,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-07 13:45:14,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-07 13:45:14,161 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:14,164 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:14,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-07 13:45:14,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-07 13:45:14,211 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-07 13:45:14,211 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-07 13:45:14,211 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-07 13:45:14,211 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-07 13:45:14,212 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-07 13:45:14,212 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-07 13:45:14,212 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-07 13:45:14,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-07 13:45:14,212 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-07 13:45:14,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-07 13:45:14,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2024-08-07 13:45:14,213 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2024-08-07 13:45:14,213 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-07 13:45:14,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-08-07 13:45:14,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-08-07 13:45:14,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-07 13:45:14,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-08-07 13:45:14,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-08-07 13:45:14,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-08-07 13:45:14,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-07 13:45:14,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-08-07 13:45:14,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-08-07 13:45:14,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-08-07 13:45:14,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-07 13:45:14,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-07 13:45:14,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-07 13:45:14,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-08-07 13:45:14,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-08-07 13:45:14,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-08-07 13:45:14,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-07 13:45:14,305 INFO L273 CfgBuilder]: Building ICFG [2024-08-07 13:45:14,308 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-07 13:45:14,440 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:14,495 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-08-07 13:45:14,497 INFO L327 CfgBuilder]: Performing block encoding [2024-08-07 13:45:14,508 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-07 13:45:14,509 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-07 13:45:14,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 01:45:14 BoogieIcfgContainer [2024-08-07 13:45:14,509 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-07 13:45:14,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-07 13:45:14,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-07 13:45:14,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-07 13:45:14,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 01:45:11" (1/4) ... [2024-08-07 13:45:14,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e8af928 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 07.08 01:45:14, skipping insertion in model container [2024-08-07 13:45:14,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.08 01:45:13" (2/4) ... [2024-08-07 13:45:14,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e8af928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 01:45:14, skipping insertion in model container [2024-08-07 13:45:14,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:45:14" (3/4) ... [2024-08-07 13:45:14,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e8af928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 01:45:14, skipping insertion in model container [2024-08-07 13:45:14,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 01:45:14" (4/4) ... [2024-08-07 13:45:14,521 INFO L119 eAbstractionObserver]: Analyzing ICFG s5iff.c [2024-08-07 13:45:14,522 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:14,545 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-07 13:45:14,545 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-07 13:45:14,604 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:14,605 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:14,610 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:14,611 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:14,612 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:14,614 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:14,615 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:14,616 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:14,617 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:14,618 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:14,619 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:14,619 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:14,620 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:14,621 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:14,623 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:14,623 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:14,624 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:14,624 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:14,626 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,626 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,627 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:14,629 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:14,630 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,630 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,631 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:14,631 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:14,631 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,632 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,632 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,633 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,633 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,633 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,634 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,634 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,634 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,635 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,635 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,635 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,636 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,636 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,636 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,636 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,637 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,637 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,637 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,637 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,638 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,638 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,638 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,638 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,638 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,639 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,639 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,639 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,639 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,639 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,640 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,644 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,645 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,645 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,645 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,646 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,646 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,646 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,646 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,647 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,648 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,648 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,648 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,648 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,649 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,649 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,649 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,649 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,650 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,650 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,650 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,650 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,651 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,651 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,651 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,651 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,651 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,652 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,652 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,652 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,652 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,653 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,653 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,653 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,653 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,653 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,654 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,654 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,654 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,655 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,655 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,655 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,655 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,655 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,656 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,656 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,656 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,656 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,657 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,657 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,657 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,657 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,657 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,658 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,658 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,658 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,659 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,659 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,659 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,659 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,660 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,660 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,660 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,660 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,661 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,661 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,661 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,661 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,661 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,662 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,662 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,662 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,662 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,662 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,663 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,663 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,663 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,663 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,664 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,664 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,664 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,664 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,665 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,665 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,665 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,665 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,666 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,666 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,666 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,666 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,667 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,667 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,667 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,668 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,668 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,668 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,669 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,669 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,669 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,669 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,670 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,671 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,671 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,671 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,671 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,672 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,672 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,672 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,673 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,673 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,673 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,673 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,673 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,674 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,674 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,674 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,674 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,674 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,675 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,675 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,675 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,675 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,676 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,676 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,676 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,676 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,677 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,677 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,677 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,677 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,678 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,678 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,678 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,678 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,679 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,679 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,679 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,679 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,679 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,680 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,680 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,680 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,680 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,680 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,681 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,681 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,681 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,681 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,681 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,681 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,681 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,681 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,682 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,682 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,682 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,682 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,683 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,683 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,683 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,683 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,684 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,684 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,684 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,684 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,685 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,685 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,685 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,685 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,686 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,686 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,686 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,686 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,687 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,687 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,687 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,687 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,688 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,688 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,688 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,688 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,688 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,688 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,689 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,689 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,689 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,689 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,690 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,690 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,690 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,690 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,691 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,691 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,691 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,691 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,692 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,692 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,692 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,692 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,692 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,693 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,693 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,693 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,693 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,694 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,694 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,694 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,694 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,694 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,695 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:14,695 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,695 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,695 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,695 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,695 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,696 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,696 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,696 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,696 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,696 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,696 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,696 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,697 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,697 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:14,697 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,697 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,698 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,698 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,698 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,698 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,698 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,699 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,699 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,699 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,699 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,699 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,700 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,700 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:14,700 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,700 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,701 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,701 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,701 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,701 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,701 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,702 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,702 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,702 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,702 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,702 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:14,703 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,703 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,703 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,703 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,703 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,704 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,704 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,704 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:14,704 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,704 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,704 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,705 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:14,705 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,706 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:14,706 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,706 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:14,706 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,707 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:14,707 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,721 INFO L90 WitnessUtils]: NestedWordAutomaton nwa = ( callAlphabet = {"call ULTIMATE.init();" "call __VERIFIER_assert((if #t~mem13 == 5 * ~N~0 then 1 else 0));" "call assume_abort_if_not((if ~N~0 % 4294967296 <= 536870911 then 1 else 0));" "call #t~ret14 := main();" }, internalAlphabet = {"havoc #t~mem13;#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~mem13 == 5 * ~N~0 then 1 else 0)); srcloc: L46-1" "call #t~mem13 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);" "#t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12;" "assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;" "assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;" "call #t~mem7 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);" "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(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;call write~int#2(1, ~#sum~0.base, ~#sum~0.offset, 8);~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(8, 2);call write~init~int#1(115, 2, 0, 1);call write~init~int#1(53, 2, 1, 1);call write~init~int#1(105, 2, 2, 1);call write~init~int#1(102, 2, 3, 1);call write~init~int#1(102, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3);~N~0 := 0;" "assume true;" "SUMMARY for call #t~ret14 := 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 = {"#48#return;" "#50#return;" "#44#return;" "#46#return;" }, states = {"CountingPredicate [underlying: 19#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 31#mainEXITtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 14#L32-2true, annotation: [5, 0]]" "CountingPredicate [underlying: 37#ULTIMATE.startFINALtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 8#Loop~0true, annotation: [2, 0]]" "CountingPredicate [underlying: 19#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 37#ULTIMATE.startFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 34#L37-2true, annotation: [8, 0]]" "CountingPredicate [underlying: 31#mainEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 3#L46true, annotation: [2, 0]]" "CountingPredicate [underlying: 31#mainEXITtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 3#L46true, annotation: [6, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 5#L25true, annotation: [4, 0]]" "CountingPredicate [underlying: 34#L37-2true, annotation: [4, 0]]" "CountingPredicate [underlying: 13#L39true, annotation: [2, 0]]" "CountingPredicate [underlying: 33#mainFINALtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 28#L46-1true, annotation: [2, 0]]" "CountingPredicate [underlying: 17#L37-3true, annotation: [6, 0]]" "CountingPredicate [underlying: 35#L32true, annotation: [2, 0]]" "CountingPredicate [underlying: 17#L37-3true, annotation: [2, 0]]" "CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 20#L39-1true, annotation: [4, 0]]" "CountingPredicate [underlying: 28#L46-1true, annotation: [7, 0]]" "CountingPredicate [underlying: 33#mainFINALtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 24#L13true, annotation: [2, 0]]" "CountingPredicate [underlying: 32#L15true, annotation: [4, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 25#__VERIFIER_assertFINALtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 6#L46-2true, annotation: [9, 0]]" "CountingPredicate [underlying: 7#L34true, annotation: [5, 0]]" "CountingPredicate [underlying: 3#L46true, annotation: [10, 0]]" "CountingPredicate [underlying: 15#Loop~1true, annotation: [2, 0]]" "CountingPredicate [underlying: 20#L39-1true, annotation: [8, 0]]" "CountingPredicate [underlying: 23#mainENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 37#ULTIMATE.startFINALtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 14#L32-2true, annotation: [2, 0]]" "CountingPredicate [underlying: 19#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 8#Loop~0true, annotation: [5, 0]]" "CountingPredicate [underlying: 10#L37true, annotation: [6, 0]]" "CountingPredicate [underlying: 34#L37-2true, annotation: [7, 0]]" "CountingPredicate [underlying: 10#L37true, annotation: [2, 0]]" "CountingPredicate [underlying: 6#L46-2true, annotation: [4, 0]]" "CountingPredicate [underlying: 3#L46true, annotation: [7, 0]]" "CountingPredicate [underlying: 4#L24true, annotation: [0, 0]]" "CountingPredicate [underlying: 38#ERRORtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 25#__VERIFIER_assertFINALtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 38#ERRORtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 25#__VERIFIER_assertFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 16#L25-1true, annotation: [1, 0]]" "CountingPredicate [underlying: 18#L15-2true, annotation: [10, 0]]" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 18#L15-2true, annotation: [6, 0]]" "CountingPredicate [underlying: 30#assume_abort_if_notEXITtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 18#L15-2true, annotation: [2, 0]]" "CountingPredicate [underlying: 33#mainFINALtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 28#L46-1true, annotation: [6, 0]]" "CountingPredicate [underlying: 33#mainFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 38#ERRORtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 38#ERRORtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 25#__VERIFIER_assertFINALtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 20#L39-1true, annotation: [7, 0]]" "CountingPredicate [underlying: 37#ULTIMATE.startFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 31#mainEXITtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 26#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 37#ULTIMATE.startFINALtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 19#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 10#L37true, annotation: [7, 0]]" "CountingPredicate [underlying: 36#assume_abort_if_notENTRYtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 31#mainEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 3#L46true, annotation: [4, 0]]" "CountingPredicate [underlying: 6#L46-2true, annotation: [7, 0]]" "CountingPredicate [underlying: 19#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 27#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 5#L25true, annotation: [2, 0]]" "CountingPredicate [underlying: 34#L37-2true, annotation: [2, 0]]" "CountingPredicate [underlying: 13#L39true, annotation: [8, 0]]" "CountingPredicate [underlying: 31#mainEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 35#L32true, annotation: [4, 0]]" "CountingPredicate [underlying: 17#L37-3true, annotation: [4, 0]]" "CountingPredicate [underlying: 18#L15-2true, annotation: [7, 0]]" "CountingPredicate [underlying: 13#L39true, annotation: [4, 0]]" "CountingPredicate [underlying: 33#mainFINALtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 30#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 28#L46-1true, annotation: [9, 0]]" "CountingPredicate [underlying: 20#L39-1true, annotation: [2, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 32#L15true, annotation: [2, 0]]" "CountingPredicate [underlying: 32#L15true, annotation: [6, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 15#Loop~1true, annotation: [4, 0]]" "CountingPredicate [underlying: 15#Loop~1true, annotation: [8, 0]]" "CountingPredicate [underlying: 3#L46true, annotation: [12, 0]]" "CountingPredicate [underlying: 22#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 37#ULTIMATE.startFINALtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 9#L-1true, annotation: [0, 0]]" "CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 37#ULTIMATE.startFINALtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 10#L37true, annotation: [4, 0]]" "CountingPredicate [underlying: 6#L46-2true, annotation: [2, 0]]" "CountingPredicate [underlying: 31#mainEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 6#L46-2true, annotation: [6, 0]]" "CountingPredicate [underlying: 27#assume_abort_if_notFINALtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 25#__VERIFIER_assertFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 32#L15true, annotation: [12, 0]]" "CountingPredicate [underlying: 35#L32true, annotation: [5, 0]]" "CountingPredicate [underlying: 38#ERRORtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 11#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 13#L39true, annotation: [7, 0]]" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 18#L15-2true, annotation: [4, 0]]" "CountingPredicate [underlying: 33#mainFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 33#mainFINALtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 28#L46-1true, annotation: [4, 0]]" "CountingPredicate [underlying: 32#L15true, annotation: [7, 0]]" "CountingPredicate [underlying: 25#__VERIFIER_assertFINALtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 15#Loop~1true, annotation: [7, 0]]" "CountingPredicate [underlying: 7#L34true, annotation: [2, 0]]" "CountingPredicate [underlying: 10#L37true, annotation: [8, 0]]" "CountingPredicate [underlying: 21#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" }, initialStates = {"CountingPredicate [underlying: 22#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" }, finalStates = {"CountingPredicate [underlying: 19#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [12, 0]]" }, callTransitions = { ("CountingPredicate [underlying: 28#L46-1true, annotation: [2, 0]]" "call __VERIFIER_assert((if #t~mem13 == 5 * ~N~0 then 1 else 0));" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 28#L46-1true, annotation: [7, 0]]" "call __VERIFIER_assert((if #t~mem13 == 5 * ~N~0 then 1 else 0));" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 16#L25-1true, annotation: [1, 0]]" "call assume_abort_if_not((if ~N~0 % 4294967296 <= 536870911 then 1 else 0));" "CountingPredicate [underlying: 36#assume_abort_if_notENTRYtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 28#L46-1true, annotation: [6, 0]]" "call __VERIFIER_assert((if #t~mem13 == 5 * ~N~0 then 1 else 0));" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 28#L46-1true, annotation: [9, 0]]" "call __VERIFIER_assert((if #t~mem13 == 5 * ~N~0 then 1 else 0));" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 22#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "call ULTIMATE.init();" "CountingPredicate [underlying: 21#ULTIMATE.initENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 9#L-1true, annotation: [0, 0]]" "call #t~ret14 := main();" "CountingPredicate [underlying: 23#mainENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 28#L46-1true, annotation: [4, 0]]" "call __VERIFIER_assert((if #t~mem13 == 5 * ~N~0 then 1 else 0));" "CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [4, 0]]") }, internalTransitions = { ("CountingPredicate [underlying: 14#L32-2true, annotation: [5, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 7#L34true, annotation: [5, 0]]") ("CountingPredicate [underlying: 14#L32-2true, annotation: [5, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 17#L37-3true, annotation: [6, 0]]") ("CountingPredicate [underlying: 37#ULTIMATE.startFINALtrue, annotation: [6, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 8#Loop~0true, annotation: [2, 0]]" "#t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6;" "CountingPredicate [underlying: 35#L32true, annotation: [2, 0]]") ("CountingPredicate [underlying: 37#ULTIMATE.startFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 34#L37-2true, annotation: [8, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 20#L39-1true, annotation: [8, 0]]") ("CountingPredicate [underlying: 34#L37-2true, annotation: [8, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 6#L46-2true, annotation: [9, 0]]") ("CountingPredicate [underlying: 3#L46true, annotation: [2, 0]]" "havoc #t~mem13;#res := 1;call ULTIMATE.dealloc(~#sum~0.base, ~#sum~0.offset);havoc ~#sum~0.base, ~#sum~0.offset;" "CountingPredicate [underlying: 33#mainFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 3#L46true, annotation: [6, 0]]" "havoc #t~mem13;#res := 1;call ULTIMATE.dealloc(~#sum~0.base, ~#sum~0.offset);havoc ~#sum~0.base, ~#sum~0.offset;" "CountingPredicate [underlying: 33#mainFINALtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [7, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 18#L15-2true, annotation: [7, 0]]") ("CountingPredicate [underlying: 5#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;call write~int#2(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0;" "CountingPredicate [underlying: 35#L32true, annotation: [4, 0]]") ("CountingPredicate [underlying: 34#L37-2true, annotation: [4, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 20#L39-1true, annotation: [4, 0]]") ("CountingPredicate [underlying: 34#L37-2true, annotation: [4, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 6#L46-2true, annotation: [4, 0]]") ("CountingPredicate [underlying: 13#L39true, annotation: [2, 0]]" "assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;" "CountingPredicate [underlying: 15#Loop~1true, annotation: [2, 0]]") ("CountingPredicate [underlying: 13#L39true, annotation: [2, 0]]" "assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;" "CountingPredicate [underlying: 15#Loop~1true, annotation: [2, 0]]") ("CountingPredicate [underlying: 33#mainFINALtrue, annotation: [12, 0]]" "assume true;" "CountingPredicate [underlying: 31#mainEXITtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 17#L37-3true, annotation: [6, 0]]" "~i~0 := 0;" "CountingPredicate [underlying: 10#L37true, annotation: [6, 0]]") ("CountingPredicate [underlying: 35#L32true, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 14#L32-2true, annotation: [2, 0]]") ("CountingPredicate [underlying: 35#L32true, annotation: [2, 0]]" "assume !true;" "CountingPredicate [underlying: 17#L37-3true, annotation: [2, 0]]") ("CountingPredicate [underlying: 17#L37-3true, annotation: [2, 0]]" "~i~0 := 0;" "CountingPredicate [underlying: 10#L37true, annotation: [2, 0]]") ("CountingPredicate [underlying: 20#L39-1true, annotation: [4, 0]]" "call #t~mem7 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);" "CountingPredicate [underlying: 13#L39true, annotation: [4, 0]]") ("CountingPredicate [underlying: 33#mainFINALtrue, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 31#mainEXITtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 24#L13true, annotation: [2, 0]]" "assume 0 == ~cond;assume false;" "CountingPredicate [underlying: 27#assume_abort_if_notFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 24#L13true, annotation: [2, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 27#assume_abort_if_notFINALtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 32#L15true, annotation: [4, 0]]" "assume false;" "CountingPredicate [underlying: 25#__VERIFIER_assertFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 25#__VERIFIER_assertFINALtrue, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 6#L46-2true, annotation: [9, 0]]" "call #t~mem13 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 28#L46-1true, annotation: [9, 0]]") ("CountingPredicate [underlying: 7#L34true, annotation: [5, 0]]" "call write~int#3(5, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);" "CountingPredicate [underlying: 8#Loop~0true, annotation: [5, 0]]") ("CountingPredicate [underlying: 3#L46true, annotation: [10, 0]]" "havoc #t~mem13;#res := 1;call ULTIMATE.dealloc(~#sum~0.base, ~#sum~0.offset);havoc ~#sum~0.base, ~#sum~0.offset;" "CountingPredicate [underlying: 33#mainFINALtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 15#Loop~1true, annotation: [2, 0]]" "#t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12;" "CountingPredicate [underlying: 10#L37true, annotation: [2, 0]]") ("CountingPredicate [underlying: 20#L39-1true, annotation: [8, 0]]" "call #t~mem7 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);" "CountingPredicate [underlying: 13#L39true, annotation: [8, 0]]") ("CountingPredicate [underlying: 23#mainENTRYtrue, annotation: [0, 0]]" "havoc #t~nondet4;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4;" "CountingPredicate [underlying: 4#L24true, annotation: [0, 0]]") ("CountingPredicate [underlying: 37#ULTIMATE.startFINALtrue, annotation: [10, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 14#L32-2true, annotation: [2, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 7#L34true, annotation: [2, 0]]") ("CountingPredicate [underlying: 14#L32-2true, annotation: [2, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 17#L37-3true, annotation: [2, 0]]") ("CountingPredicate [underlying: 8#Loop~0true, annotation: [5, 0]]" "#t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6;" "CountingPredicate [underlying: 35#L32true, annotation: [5, 0]]") ("CountingPredicate [underlying: 10#L37true, annotation: [6, 0]]" "assume true;" "CountingPredicate [underlying: 34#L37-2true, annotation: [7, 0]]") ("CountingPredicate [underlying: 10#L37true, annotation: [6, 0]]" "assume !true;" "CountingPredicate [underlying: 6#L46-2true, annotation: [6, 0]]") ("CountingPredicate [underlying: 34#L37-2true, annotation: [7, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 20#L39-1true, annotation: [7, 0]]") ("CountingPredicate [underlying: 34#L37-2true, annotation: [7, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 6#L46-2true, annotation: [7, 0]]") ("CountingPredicate [underlying: 10#L37true, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 34#L37-2true, annotation: [2, 0]]") ("CountingPredicate [underlying: 10#L37true, annotation: [2, 0]]" "assume !true;" "CountingPredicate [underlying: 6#L46-2true, annotation: [2, 0]]") ("CountingPredicate [underlying: 6#L46-2true, annotation: [4, 0]]" "call #t~mem13 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 28#L46-1true, annotation: [4, 0]]") ("CountingPredicate [underlying: 3#L46true, annotation: [7, 0]]" "havoc #t~mem13;#res := 1;call ULTIMATE.dealloc(~#sum~0.base, ~#sum~0.offset);havoc ~#sum~0.base, ~#sum~0.offset;" "CountingPredicate [underlying: 33#mainFINALtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 4#L24true, annotation: [0, 0]]" "assume ~N~0 <= 0;#res := 1;" "CountingPredicate [underlying: 33#mainFINALtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 4#L24true, annotation: [0, 0]]" "assume !(~N~0 <= 0);" "CountingPredicate [underlying: 16#L25-1true, annotation: [1, 0]]") ("CountingPredicate [underlying: 38#ERRORtrue, annotation: [2, 0]]" "assume false;" "CountingPredicate [underlying: 32#L15true, annotation: [2, 0]]") ("CountingPredicate [underlying: 38#ERRORtrue, annotation: [2, 0]]" "assume !false;" "CountingPredicate [underlying: 19#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 25#__VERIFIER_assertFINALtrue, annotation: [6, 0]]" "assume true;" "CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 38#ERRORtrue, annotation: [6, 0]]" "assume false;" "CountingPredicate [underlying: 32#L15true, annotation: [6, 0]]") ("CountingPredicate [underlying: 38#ERRORtrue, annotation: [6, 0]]" "assume !false;" "CountingPredicate [underlying: 19#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 25#__VERIFIER_assertFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 18#L15-2true, annotation: [10, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 38#ERRORtrue, annotation: [11, 0]]") ("CountingPredicate [underlying: 18#L15-2true, annotation: [10, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 25#__VERIFIER_assertFINALtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [4, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 18#L15-2true, annotation: [4, 0]]") ("CountingPredicate [underlying: 18#L15-2true, annotation: [6, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 38#ERRORtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 18#L15-2true, annotation: [6, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 25#__VERIFIER_assertFINALtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 18#L15-2true, annotation: [2, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 38#ERRORtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 18#L15-2true, annotation: [2, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 25#__VERIFIER_assertFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 33#mainFINALtrue, annotation: [6, 0]]" "assume true;" "CountingPredicate [underlying: 31#mainEXITtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 33#mainFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 31#mainEXITtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 38#ERRORtrue, annotation: [7, 0]]" "assume false;" "CountingPredicate [underlying: 32#L15true, annotation: [7, 0]]") ("CountingPredicate [underlying: 38#ERRORtrue, annotation: [7, 0]]" "assume !false;" "CountingPredicate [underlying: 19#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 38#ERRORtrue, annotation: [11, 0]]" "assume false;" "CountingPredicate [underlying: 32#L15true, annotation: [12, 0]]") ("CountingPredicate [underlying: 38#ERRORtrue, annotation: [11, 0]]" "assume !false;" "CountingPredicate [underlying: 19#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 25#__VERIFIER_assertFINALtrue, annotation: [10, 0]]" "assume true;" "CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 20#L39-1true, annotation: [7, 0]]" "call #t~mem7 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);" "CountingPredicate [underlying: 13#L39true, annotation: [7, 0]]") ("CountingPredicate [underlying: 37#ULTIMATE.startFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 26#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 11#ULTIMATE.initEXITtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 37#ULTIMATE.startFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 10#L37true, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 34#L37-2true, annotation: [7, 0]]") ("CountingPredicate [underlying: 10#L37true, annotation: [7, 0]]" "assume !true;" "CountingPredicate [underlying: 6#L46-2true, annotation: [7, 0]]") ("CountingPredicate [underlying: 36#assume_abort_if_notENTRYtrue, annotation: [2, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 24#L13true, annotation: [2, 0]]") ("CountingPredicate [underlying: 3#L46true, annotation: [4, 0]]" "havoc #t~mem13;#res := 1;call ULTIMATE.dealloc(~#sum~0.base, ~#sum~0.offset);havoc ~#sum~0.base, ~#sum~0.offset;" "CountingPredicate [underlying: 33#mainFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 6#L46-2true, annotation: [7, 0]]" "call #t~mem13 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 28#L46-1true, annotation: [7, 0]]") ("CountingPredicate [underlying: 27#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 30#assume_abort_if_notEXITtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 5#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;call write~int#2(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0;" "CountingPredicate [underlying: 35#L32true, annotation: [2, 0]]") ("CountingPredicate [underlying: 34#L37-2true, annotation: [2, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 20#L39-1true, annotation: [2, 0]]") ("CountingPredicate [underlying: 34#L37-2true, annotation: [2, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 6#L46-2true, annotation: [2, 0]]") ("CountingPredicate [underlying: 13#L39true, annotation: [8, 0]]" "assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;" "CountingPredicate [underlying: 15#Loop~1true, annotation: [8, 0]]") ("CountingPredicate [underlying: 13#L39true, annotation: [8, 0]]" "assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;" "CountingPredicate [underlying: 15#Loop~1true, annotation: [8, 0]]") ("CountingPredicate [underlying: 35#L32true, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 14#L32-2true, annotation: [5, 0]]") ("CountingPredicate [underlying: 35#L32true, annotation: [4, 0]]" "assume !true;" "CountingPredicate [underlying: 17#L37-3true, annotation: [4, 0]]") ("CountingPredicate [underlying: 17#L37-3true, annotation: [4, 0]]" "~i~0 := 0;" "CountingPredicate [underlying: 10#L37true, annotation: [4, 0]]") ("CountingPredicate [underlying: 18#L15-2true, annotation: [7, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 38#ERRORtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 18#L15-2true, annotation: [7, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 25#__VERIFIER_assertFINALtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 13#L39true, annotation: [4, 0]]" "assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;" "CountingPredicate [underlying: 15#Loop~1true, annotation: [4, 0]]") ("CountingPredicate [underlying: 13#L39true, annotation: [4, 0]]" "assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;" "CountingPredicate [underlying: 15#Loop~1true, annotation: [4, 0]]") ("CountingPredicate [underlying: 33#mainFINALtrue, annotation: [10, 0]]" "assume true;" "CountingPredicate [underlying: 31#mainEXITtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 20#L39-1true, annotation: [2, 0]]" "call #t~mem7 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);" "CountingPredicate [underlying: 13#L39true, annotation: [2, 0]]") ("CountingPredicate [underlying: 32#L15true, annotation: [2, 0]]" "assume false;" "CountingPredicate [underlying: 25#__VERIFIER_assertFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 32#L15true, annotation: [6, 0]]" "assume false;" "CountingPredicate [underlying: 25#__VERIFIER_assertFINALtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 15#Loop~1true, annotation: [4, 0]]" "#t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12;" "CountingPredicate [underlying: 10#L37true, annotation: [4, 0]]") ("CountingPredicate [underlying: 15#Loop~1true, annotation: [8, 0]]" "#t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12;" "CountingPredicate [underlying: 10#L37true, annotation: [8, 0]]") ("CountingPredicate [underlying: 3#L46true, annotation: [12, 0]]" "havoc #t~mem13;#res := 1;call ULTIMATE.dealloc(~#sum~0.base, ~#sum~0.offset);havoc ~#sum~0.base, ~#sum~0.offset;" "CountingPredicate [underlying: 33#mainFINALtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 37#ULTIMATE.startFINALtrue, annotation: [12, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 37#ULTIMATE.startFINALtrue, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 10#L37true, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 34#L37-2true, annotation: [4, 0]]") ("CountingPredicate [underlying: 10#L37true, annotation: [4, 0]]" "assume !true;" "CountingPredicate [underlying: 6#L46-2true, annotation: [4, 0]]") ("CountingPredicate [underlying: 6#L46-2true, annotation: [2, 0]]" "call #t~mem13 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 28#L46-1true, annotation: [2, 0]]") ("CountingPredicate [underlying: 6#L46-2true, annotation: [6, 0]]" "call #t~mem13 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 28#L46-1true, annotation: [6, 0]]") ("CountingPredicate [underlying: 27#assume_abort_if_notFINALtrue, annotation: [3, 0]]" "assume true;" "CountingPredicate [underlying: 30#assume_abort_if_notEXITtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 25#__VERIFIER_assertFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [6, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 18#L15-2true, annotation: [6, 0]]") ("CountingPredicate [underlying: 32#L15true, annotation: [12, 0]]" "assume false;" "CountingPredicate [underlying: 25#__VERIFIER_assertFINALtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 35#L32true, annotation: [5, 0]]" "assume true;" "CountingPredicate [underlying: 14#L32-2true, annotation: [5, 0]]") ("CountingPredicate [underlying: 35#L32true, annotation: [5, 0]]" "assume !true;" "CountingPredicate [underlying: 17#L37-3true, annotation: [6, 0]]") ("CountingPredicate [underlying: 38#ERRORtrue, annotation: [4, 0]]" "assume false;" "CountingPredicate [underlying: 32#L15true, annotation: [4, 0]]") ("CountingPredicate [underlying: 38#ERRORtrue, annotation: [4, 0]]" "assume !false;" "CountingPredicate [underlying: 19#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [10, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 18#L15-2true, annotation: [10, 0]]") ("CountingPredicate [underlying: 13#L39true, annotation: [7, 0]]" "assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;" "CountingPredicate [underlying: 15#Loop~1true, annotation: [8, 0]]") ("CountingPredicate [underlying: 13#L39true, annotation: [7, 0]]" "assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;" "CountingPredicate [underlying: 15#Loop~1true, annotation: [7, 0]]") ("CountingPredicate [underlying: 12#__VERIFIER_assertENTRYtrue, annotation: [2, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 18#L15-2true, annotation: [2, 0]]") ("CountingPredicate [underlying: 18#L15-2true, annotation: [4, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 38#ERRORtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 18#L15-2true, annotation: [4, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 25#__VERIFIER_assertFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 33#mainFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 31#mainEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 33#mainFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 31#mainEXITtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 32#L15true, annotation: [7, 0]]" "assume false;" "CountingPredicate [underlying: 25#__VERIFIER_assertFINALtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 25#__VERIFIER_assertFINALtrue, annotation: [12, 0]]" "assume true;" "CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 15#Loop~1true, annotation: [7, 0]]" "#t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12;" "CountingPredicate [underlying: 10#L37true, annotation: [7, 0]]") ("CountingPredicate [underlying: 7#L34true, annotation: [2, 0]]" "call write~int#3(5, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);" "CountingPredicate [underlying: 8#Loop~0true, annotation: [2, 0]]") ("CountingPredicate [underlying: 10#L37true, annotation: [8, 0]]" "assume true;" "CountingPredicate [underlying: 34#L37-2true, annotation: [8, 0]]") ("CountingPredicate [underlying: 10#L37true, annotation: [8, 0]]" "assume !true;" "CountingPredicate [underlying: 6#L46-2true, annotation: [9, 0]]") ("CountingPredicate [underlying: 21#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(8, 2);call write~init~int#1(115, 2, 0, 1);call write~init~int#1(53, 2, 1, 1);call write~init~int#1(105, 2, 2, 1);call write~init~int#1(102, 2, 3, 1);call write~init~int#1(102, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3);~N~0 := 0;" "CountingPredicate [underlying: 26#ULTIMATE.initFINALtrue, annotation: [0, 0]]") }, returnTransitions = { ("CountingPredicate [underlying: 31#mainEXITtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 9#L-1true, annotation: [0, 0]]" "#48#return;" "CountingPredicate [underlying: 37#ULTIMATE.startFINALtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 31#mainEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 9#L-1true, annotation: [0, 0]]" "#48#return;" "CountingPredicate [underlying: 37#ULTIMATE.startFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 31#mainEXITtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 9#L-1true, annotation: [0, 0]]" "#48#return;" "CountingPredicate [underlying: 37#ULTIMATE.startFINALtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 28#L46-1true, annotation: [7, 0]]" "#44#return;" "CountingPredicate [underlying: 3#L46true, annotation: [7, 0]]") ("CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 28#L46-1true, annotation: [2, 0]]" "#44#return;" "CountingPredicate [underlying: 3#L46true, annotation: [2, 0]]") ("CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 28#L46-1true, annotation: [9, 0]]" "#44#return;" "CountingPredicate [underlying: 3#L46true, annotation: [10, 0]]") ("CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 28#L46-1true, annotation: [6, 0]]" "#44#return;" "CountingPredicate [underlying: 3#L46true, annotation: [6, 0]]") ("CountingPredicate [underlying: 30#assume_abort_if_notEXITtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 16#L25-1true, annotation: [1, 0]]" "#46#return;" "CountingPredicate [underlying: 5#L25true, annotation: [4, 0]]") ("CountingPredicate [underlying: 31#mainEXITtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 9#L-1true, annotation: [0, 0]]" "#48#return;" "CountingPredicate [underlying: 37#ULTIMATE.startFINALtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 31#mainEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 9#L-1true, annotation: [0, 0]]" "#48#return;" "CountingPredicate [underlying: 37#ULTIMATE.startFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 31#mainEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 9#L-1true, annotation: [0, 0]]" "#48#return;" "CountingPredicate [underlying: 37#ULTIMATE.startFINALtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 30#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 16#L25-1true, annotation: [1, 0]]" "#46#return;" "CountingPredicate [underlying: 5#L25true, annotation: [2, 0]]") ("CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 28#L46-1true, annotation: [4, 0]]" "#44#return;" "CountingPredicate [underlying: 3#L46true, annotation: [4, 0]]") ("CountingPredicate [underlying: 31#mainEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 9#L-1true, annotation: [0, 0]]" "#48#return;" "CountingPredicate [underlying: 37#ULTIMATE.startFINALtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 11#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 22#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "#50#return;" "CountingPredicate [underlying: 9#L-1true, annotation: [0, 0]]") ("CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 28#L46-1true, annotation: [9, 0]]" "#44#return;" "CountingPredicate [underlying: 3#L46true, annotation: [12, 0]]") } ); [2024-08-07 13:45:14,730 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 37 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 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:14,731 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:14,731 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:14,731 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:14,731 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:14,732 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:14,732 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:14,732 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:14,732 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:14,732 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:14,733 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:14,733 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:14,733 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:14,734 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:14,735 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:14,735 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:14,741 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:14,742 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:14,742 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:14,743 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,743 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,744 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:14,744 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:14,744 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,744 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,746 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:45:14,746 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:45:14,746 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,747 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,747 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,747 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,748 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,748 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,748 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,748 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,748 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,748 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,749 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,749 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,749 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,749 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,749 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,750 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,750 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,754 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,755 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,755 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,755 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,756 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,756 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,756 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,756 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,758 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,758 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,759 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,759 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,759 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,760 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,760 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,760 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,760 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,760 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,761 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,761 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,761 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,761 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,761 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,762 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,762 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,762 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,762 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,762 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,762 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,763 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,763 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,764 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,765 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,765 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,765 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,765 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,766 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,766 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,766 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,767 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,767 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,767 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,768 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,768 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,768 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,768 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,768 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,769 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,769 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,769 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,770 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,770 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,770 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,771 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,771 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,771 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,771 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,772 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,772 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,772 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,773 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,773 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,773 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,773 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,774 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,774 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,774 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,775 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,775 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,775 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,775 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,776 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,776 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,776 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,777 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,777 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,777 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,778 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,778 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,778 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,782 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,782 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,783 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,783 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,783 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,783 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,783 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,784 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,784 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,784 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,784 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,785 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,785 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,785 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,785 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,786 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,786 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,786 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,786 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,786 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,787 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,787 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,787 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,787 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,787 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,787 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,787 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,788 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,788 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,792 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,792 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,792 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,792 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,793 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,793 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,793 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,794 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,794 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,794 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,794 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,798 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,798 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,798 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,799 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,799 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,799 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,799 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,799 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,799 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,800 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,800 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,800 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,800 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,800 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,800 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,801 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,801 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,801 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,801 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,802 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,802 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,802 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,803 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,804 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,804 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,804 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,804 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,805 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,805 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,806 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,806 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,806 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,806 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,806 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,807 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,807 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,807 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,807 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,807 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,808 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,808 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,808 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,808 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,808 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,809 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,809 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,809 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,809 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,810 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,810 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,810 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,810 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,810 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,811 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,811 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,811 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,812 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,812 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,812 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,812 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,812 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,812 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,813 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,813 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,814 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,814 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,814 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,814 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,814 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,814 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,815 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,815 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,815 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,815 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,815 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,815 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,816 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,816 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,816 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,816 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,816 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,817 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,817 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,817 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,817 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,817 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,818 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,818 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,818 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,818 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,818 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,818 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,819 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,819 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,819 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,819 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,819 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,819 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,820 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,820 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,820 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,820 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:14,820 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,820 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,821 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,821 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,821 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,821 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,821 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,821 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,822 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,822 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,822 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,822 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,822 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,823 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:14,823 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,823 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,823 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,823 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,824 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,824 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,824 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,824 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,824 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,824 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,824 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,825 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:45:14,825 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,825 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:14,825 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,826 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,826 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,826 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,826 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,826 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,826 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,827 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,827 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,827 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,827 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,827 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:14,827 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,828 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,828 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,828 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:45:14,828 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:45:14,829 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:45:14,829 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:45:14,829 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:14,829 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,829 WARN L283 nessProductAutomaton]: assume 5 == #t~mem7;havoc #t~mem7;call #t~mem8 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem9 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem8;havoc #t~mem9;, isNegated false [2024-08-07 13:45:14,829 WARN L283 nessProductAutomaton]: assume !(5 == #t~mem7);havoc #t~mem7;call #t~mem10 := read~int#2(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem11 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#2(#t~mem10 * #t~mem11, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem10;havoc #t~mem11;, isNegated true [2024-08-07 13:45:14,829 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:14,829 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,830 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:14,830 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,830 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:14,830 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,830 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:45:14,830 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:45:14,839 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 130 states to 36 states. [2024-08-07 13:45:14,856 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-07 13:45:14,863 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;@50e03116, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-07 13:45:14,864 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-07 13:45:14,866 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2024-08-07 13:45:14,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-08-07 13:45:14,871 INFO L187 NwaCegarLoop]: Found error trace [2024-08-07 13:45:14,872 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, 1] [2024-08-07 13:45:14,873 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-07 13:45:14,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-07 13:45:14,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1949649898, now seen corresponding path program 1 times [2024-08-07 13:45:14,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-07 13:45:14,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297225499] [2024-08-07 13:45:14,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-07 13:45:14,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-07 13:45:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-07 13:45:15,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-07 13:45:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-07 13:45:15,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-08-07 13:45:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-07 13:45:15,099 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:15,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-07 13:45:15,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297225499] [2024-08-07 13:45:15,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297225499] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-07 13:45:15,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-07 13:45:15,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-07 13:45:15,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259780859] [2024-08-07 13:45:15,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-07 13:45:15,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-07 13:45:15,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-07 13:45:15,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-07 13:45:15,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-07 13:45:15,145 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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:15,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-07 13:45:15,189 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-08-07 13:45:15,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-07 13:45:15,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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 27 [2024-08-07 13:45:15,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-07 13:45:15,193 INFO L225 Difference]: With dead ends: 36 [2024-08-07 13:45:15,193 INFO L226 Difference]: Without dead ends: 36 [2024-08-07 13:45:15,194 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:15,198 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 36 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.0s IncrementalHoareTripleChecker+Time [2024-08-07 13:45:15,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 36 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-07 13:45:15,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-08-07 13:45:15,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-08-07 13:45:15,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-08-07 13:45:15,225 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 27 [2024-08-07 13:45:15,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-07 13:45:15,226 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-08-07 13:45:15,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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:15,226 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-08-07 13:45:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-08-07 13:45:15,227 INFO L187 NwaCegarLoop]: Found error trace [2024-08-07 13:45:15,227 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, 1] [2024-08-07 13:45:15,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-07 13:45:15,228 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-07 13:45:15,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-07 13:45:15,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1060365694, now seen corresponding path program 1 times [2024-08-07 13:45:15,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-07 13:45:15,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199309919] [2024-08-07 13:45:15,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-07 13:45:15,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-07 13:45:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-07 13:45:15,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-07 13:45:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-07 13:45:15,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-08-07 13:45:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-07 13:45:15,473 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:15,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-07 13:45:15,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199309919] [2024-08-07 13:45:15,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199309919] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-07 13:45:15,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-07 13:45:15,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-07 13:45:15,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702311590] [2024-08-07 13:45:15,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-07 13:45:15,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-07 13:45:15,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-07 13:45:15,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-07 13:45:15,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-08-07 13:45:15,479 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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:15,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-07 13:45:15,606 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2024-08-07 13:45:15,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-07 13:45:15,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 28 [2024-08-07 13:45:15,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-07 13:45:15,608 INFO L225 Difference]: With dead ends: 44 [2024-08-07 13:45:15,608 INFO L226 Difference]: Without dead ends: 44 [2024-08-07 13:45:15,609 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:15,610 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-07 13:45:15,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 30 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-07 13:45:15,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-08-07 13:45:15,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2024-08-07 13:45:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-08-07 13:45:15,616 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 28 [2024-08-07 13:45:15,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-07 13:45:15,617 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-08-07 13:45:15,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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:15,617 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-08-07 13:45:15,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-08-07 13:45:15,618 INFO L187 NwaCegarLoop]: Found error trace [2024-08-07 13:45:15,618 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, 1] [2024-08-07 13:45:15,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-07 13:45:15,619 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-07 13:45:15,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-07 13:45:15,619 INFO L85 PathProgramCache]: Analyzing trace with hash 572011269, now seen corresponding path program 1 times [2024-08-07 13:45:15,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-07 13:45:15,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615489036] [2024-08-07 13:45:15,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-07 13:45:15,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-07 13:45:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 13:45:15,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-07 13:45:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 13:45:15,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-07 13:45:15,736 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-07 13:45:15,738 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-07 13:45:15,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-07 13:45:15,743 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-08-07 13:45:15,747 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-07 13:45:15,760 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:45:15,761 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:45:15,761 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:45:15,762 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:45:15,762 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:45:15,763 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:45:15,764 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:45:15,764 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:45:15,767 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-08-07 13:45:15,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.08 01:45:15 BoogieIcfgContainer [2024-08-07 13:45:15,773 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-07 13:45:15,773 INFO L158 Benchmark]: Toolchain (without parser) took 2022.44ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 43.0MB in the beginning and 28.5MB in the end (delta: 14.6MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2024-08-07 13:45:15,774 INFO L158 Benchmark]: Witness Parser took 0.10ms. Allocated memory is still 50.3MB. Free memory is still 23.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 13:45:15,774 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 50.3MB. Free memory is still 32.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 13:45:15,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.09ms. Allocated memory is still 73.4MB. Free memory was 42.9MB in the beginning and 50.6MB in the end (delta: -7.7MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-08-07 13:45:15,775 INFO L158 Benchmark]: Boogie Preprocessor took 56.22ms. Allocated memory is still 73.4MB. Free memory was 50.6MB in the beginning and 48.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-07 13:45:15,775 INFO L158 Benchmark]: IcfgBuilder took 385.56ms. Allocated memory is still 73.4MB. Free memory was 48.3MB in the beginning and 34.2MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-08-07 13:45:15,775 INFO L158 Benchmark]: TraceAbstraction took 1261.87ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 33.7MB in the beginning and 28.5MB in the end (delta: 5.2MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2024-08-07 13:45:15,777 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.10ms. Allocated memory is still 50.3MB. Free memory is still 23.3MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.11ms. Allocated memory is still 50.3MB. Free memory is still 32.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.09ms. Allocated memory is still 73.4MB. Free memory was 42.9MB in the beginning and 50.6MB in the end (delta: -7.7MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.22ms. Allocated memory is still 73.4MB. Free memory was 50.6MB in the beginning and 48.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 385.56ms. Allocated memory is still 73.4MB. Free memory was 48.3MB in the beginning and 34.2MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1261.87ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 33.7MB in the beginning and 28.5MB in the end (delta: 5.2MB). Peak memory consumption was 19.6MB. 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] sum[0] = 1 [L32] i=0 VAL [N=1, \old(N)=0, a={-1:0}, i=0, sum={9:0}] [L34] a[i] = 5 VAL [N=1, \old(N)=0, a={-1:0}, i=0, sum={9:0}] [L32] i++ VAL [N=1, \old(N)=0, a={-1:0}, i=1, sum={9:0}] [L37] i=0 VAL [N=1, \old(N)=0, a={-1:0}, i=0, sum={9:0}] [L39] EXPR a[i] VAL [N=1, \old(N)=0, a={-1:0}, i=0, sum={9:0}] [L39] a[i] == 5 [L40] EXPR sum[0] [L40] EXPR a[i] [L40] sum[0] = sum[0] + a[i] [L37] i++ VAL [N=1, \old(N)=0, a={-1:0}, i=1, sum={9:0}] [L46] EXPR sum[0] VAL [N=1, \old(N)=0, a={-1:0}] [L46] CALL __VERIFIER_assert(sum[0] == 5*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, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 73 IncrementalHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 37 mSDtfsCounter, 73 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=36occurred 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, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 73 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:15,808 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