./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/array-fpi/brs4f.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/brs4f.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/brs4f.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/brs4f.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-0a70ae8-m [2024-08-07 13:44:44,634 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-07 13:44:44,720 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-08-07 13:44:44,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-07 13:44:44,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-07 13:44:44,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-07 13:44:44,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-07 13:44:44,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-07 13:44:44,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-07 13:44:44,761 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-07 13:44:44,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-07 13:44:44,762 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-07 13:44:44,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-07 13:44:44,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-07 13:44:44,763 INFO L153 SettingsManager]: * Use SBE=true [2024-08-07 13:44:44,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-07 13:44:44,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-07 13:44:44,764 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-07 13:44:44,765 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-07 13:44:44,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-07 13:44:44,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-07 13:44:44,767 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-07 13:44:44,767 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-07 13:44:44,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-07 13:44:44,768 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-07 13:44:44,768 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-07 13:44:44,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-07 13:44:44,769 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-07 13:44:44,769 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-07 13:44:44,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-07 13:44:44,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-07 13:44:44,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-07 13:44:44,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-07 13:44:44,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-07 13:44:44,771 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-07 13:44:44,771 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-07 13:44:44,771 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-07 13:44:44,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-07 13:44:44,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-07 13:44:44,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-07 13:44:44,773 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-07 13:44:44,773 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-07 13:44:44,773 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-07 13:44:44,774 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-07 13:44:45,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-07 13:44:45,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-07 13:44:45,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-07 13:44:45,120 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-07 13:44:45,121 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-07 13:44:45,122 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/brs4f.yml/witness.yml [2024-08-07 13:44:45,189 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-07 13:44:45,189 INFO L274 PluginConnector]: CDTParser initialized [2024-08-07 13:44:45,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/brs4f.c [2024-08-07 13:44:46,759 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-07 13:44:46,962 INFO L384 CDTParser]: Found 1 translation units. [2024-08-07 13:44:46,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs4f.c [2024-08-07 13:44:46,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60988dd2e/b3944d7bfd0044098ce7c393a44a2b67/FLAGa351d398d [2024-08-07 13:44:47,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60988dd2e/b3944d7bfd0044098ce7c393a44a2b67 [2024-08-07 13:44:47,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-07 13:44:47,341 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-07 13:44:47,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-07 13:44:47,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-07 13:44:47,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-07 13:44:47,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 01:44:45" (1/2) ... [2024-08-07 13:44:47,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b93b177 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 01:44:47, skipping insertion in model container [2024-08-07 13:44:47,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 01:44:45" (1/2) ... [2024-08-07 13:44:47,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@332b081e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 01:44:47, skipping insertion in model container [2024-08-07 13:44:47,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 01:44:47" (2/2) ... [2024-08-07 13:44:47,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b93b177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:44:47, skipping insertion in model container [2024-08-07 13:44:47,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 01:44:47" (2/2) ... [2024-08-07 13:44:47,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-07 13:44:47,541 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/brs4f.c[588,601] [2024-08-07 13:44:47,560 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 13:44:47,569 INFO L200 MainTranslator]: Completed pre-run [2024-08-07 13:44:47,587 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/brs4f.c[588,601] [2024-08-07 13:44:47,598 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 13:44:47,617 INFO L204 MainTranslator]: Completed translation [2024-08-07 13:44:47,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:44:47 WrapperNode [2024-08-07 13:44:47,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-07 13:44:47,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-07 13:44:47,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-07 13:44:47,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-07 13:44:47,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:44:47" (1/1) ... [2024-08-07 13:44:47,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:44:47" (1/1) ... [2024-08-07 13:44:47,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:44:47" (1/1) ... [2024-08-07 13:44:47,665 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 4, 8, 3]. 47 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 0, 8, 0]. The 4 writes are split as follows [0, 2, 0, 2]. [2024-08-07 13:44:47,665 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:44:47" (1/1) ... [2024-08-07 13:44:47,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:44:47" (1/1) ... [2024-08-07 13:44:47,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:44:47" (1/1) ... [2024-08-07 13:44:47,674 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:44:47" (1/1) ... [2024-08-07 13:44:47,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:44:47" (1/1) ... [2024-08-07 13:44:47,677 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-07 13:44:47,678 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-07 13:44:47,678 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-07 13:44:47,678 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-07 13:44:47,679 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:44:47" (1/1) ... [2024-08-07 13:44:47,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-07 13:44:47,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-07 13:44:47,713 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:44:47,715 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:44:47,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-07 13:44:47,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-07 13:44:47,754 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-07 13:44:47,754 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-07 13:44:47,754 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-07 13:44:47,754 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-07 13:44:47,755 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-07 13:44:47,755 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-07 13:44:47,755 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-07 13:44:47,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-07 13:44:47,755 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-07 13:44:47,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-07 13:44:47,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2024-08-07 13:44:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2024-08-07 13:44:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-07 13:44:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-08-07 13:44:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-08-07 13:44:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-07 13:44:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-08-07 13:44:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-08-07 13:44:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-08-07 13:44:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-07 13:44:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-08-07 13:44:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-08-07 13:44:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-08-07 13:44:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-07 13:44:47,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-07 13:44:47,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-07 13:44:47,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-08-07 13:44:47,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-08-07 13:44:47,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-08-07 13:44:47,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-07 13:44:47,852 INFO L273 CfgBuilder]: Building ICFG [2024-08-07 13:44:47,855 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-07 13:44:48,011 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:44:48,075 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-08-07 13:44:48,075 INFO L327 CfgBuilder]: Performing block encoding [2024-08-07 13:44:48,099 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-07 13:44:48,099 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-07 13:44:48,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 01:44:48 BoogieIcfgContainer [2024-08-07 13:44:48,100 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-07 13:44:48,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-07 13:44:48,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-07 13:44:48,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-07 13:44:48,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 01:44:45" (1/4) ... [2024-08-07 13:44:48,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3323c9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 07.08 01:44:48, skipping insertion in model container [2024-08-07 13:44:48,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.08 01:44:47" (2/4) ... [2024-08-07 13:44:48,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3323c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 01:44:48, skipping insertion in model container [2024-08-07 13:44:48,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 01:44:47" (3/4) ... [2024-08-07 13:44:48,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3323c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 01:44:48, skipping insertion in model container [2024-08-07 13:44:48,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 01:44:48" (4/4) ... [2024-08-07 13:44:48,113 INFO L119 eAbstractionObserver]: Analyzing ICFG brs4f.c [2024-08-07 13:44:48,113 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:44:48,133 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-07 13:44:48,133 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-07 13:44:48,176 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:48,177 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:48,184 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:48,184 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:48,186 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:48,186 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:48,187 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:48,187 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:48,188 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:48,188 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:48,190 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:48,190 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:48,191 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:48,192 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:48,193 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:48,193 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:48,194 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:48,196 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:48,197 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,197 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,198 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:48,198 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:48,198 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,198 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,199 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:48,199 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:48,199 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,199 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,200 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,204 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,205 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,205 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,205 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,206 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,206 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,206 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,206 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,206 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,206 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,207 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,207 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,207 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,207 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,207 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,208 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,208 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,212 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,212 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,213 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,213 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,213 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,213 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,213 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,214 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,214 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,214 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,214 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,215 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,215 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,215 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,215 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,216 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,216 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,216 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,217 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,217 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,217 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,218 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,218 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,219 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,219 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,219 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,219 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,219 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,220 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,220 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,220 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,221 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,221 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,221 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,221 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,221 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,222 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,222 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,222 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,222 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,223 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,223 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,223 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,224 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,224 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,224 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,224 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,224 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,225 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,225 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,226 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,226 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,227 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,228 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,228 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,228 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,229 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,229 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,230 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,230 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,230 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,230 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,230 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,231 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,231 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,231 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,232 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,232 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,232 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,233 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,233 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,233 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,234 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,234 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,234 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,234 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,234 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,235 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,235 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,235 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,235 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,235 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,236 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,236 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,236 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,236 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,237 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,237 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,237 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,238 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,238 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,238 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,238 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,238 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,239 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,239 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,239 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,239 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,240 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,240 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,241 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,241 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,241 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,241 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,242 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,242 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,243 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,243 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,243 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,243 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,244 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,244 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,244 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,245 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,245 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,245 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,246 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,246 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,246 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,246 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,247 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,247 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,247 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,247 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,247 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,247 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,248 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,248 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,248 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,248 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,248 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,248 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,248 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,249 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,249 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,249 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,249 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,249 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,249 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,249 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,250 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,250 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,250 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,251 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,251 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,251 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,251 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,251 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,251 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,252 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,252 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,252 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,252 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,252 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,253 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,253 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,253 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,253 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,254 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,254 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,254 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,254 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,255 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,255 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,255 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,255 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,256 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,256 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,256 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,256 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,256 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,257 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,258 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,258 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,258 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,258 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,259 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,259 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,259 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,261 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,261 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,261 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,261 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,261 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,262 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,262 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,262 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,262 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,262 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,262 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,262 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,262 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,263 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,263 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,263 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,263 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,263 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,263 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,263 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,265 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,266 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,267 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,267 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,267 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,268 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,268 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,268 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,268 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,268 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,268 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,269 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,269 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,269 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,269 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,269 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,269 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,269 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,269 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,270 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,270 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,270 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,270 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,270 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,270 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,270 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,270 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,271 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,271 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,271 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,273 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,274 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,274 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,286 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,286 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,287 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,287 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,287 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,287 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,288 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,288 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,288 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,288 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,288 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,288 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,289 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,289 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,289 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,289 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,289 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,289 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,290 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:48,290 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,290 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,290 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,291 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,291 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,291 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,291 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,292 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,292 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,292 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,292 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,292 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,292 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,292 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,294 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,294 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,294 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,294 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:48,294 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,294 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,295 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,295 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,295 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,295 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,296 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,296 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,296 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,296 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:48,297 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,297 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,297 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,298 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,300 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,300 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,300 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,300 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:48,301 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,301 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,301 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,301 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,301 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,301 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,301 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,302 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:48,302 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,302 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,302 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,302 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,303 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,303 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,303 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,303 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:48,303 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,303 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,303 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,304 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:48,304 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,304 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:48,304 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,304 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:48,304 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,320 INFO L90 WitnessUtils]: NestedWordAutomaton nwa = ( callAlphabet = {"call ULTIMATE.init();" "call __VERIFIER_assert((if #t~mem10 <= 4 * ~N~0 then 1 else 0));" "call assume_abort_if_not((if ~N~0 % 4294967296 <= 536870911 then 1 else 0));" "call #t~ret11 := main();" }, internalAlphabet = {"havoc #t~mem10;#res := 1;call ULTIMATE.dealloc(~#sum~0.base, ~#sum~0.offset);havoc ~#sum~0.base, ~#sum~0.offset;" "SUMMARY for call __VERIFIER_assert((if #t~mem10 <= 4 * ~N~0 then 1 else 0)); srcloc: L48-1" "call #t~mem10 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);" "#t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9;" "assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);" "assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;" "assume ~i~0 < ~N~0;" "assume !(~i~0 < ~N~0);" "assume true;" "assume !true;" "~i~0 := 0;" "#t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6;" "assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);" "assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);" "assume ~i~0 < ~N~0;" "assume !(~i~0 < ~N~0);" "assume true;" "assume !true;" "havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(4 * ~N~0 % 4294967296);~a~0.base, ~a~0.offset := #t~malloc5.base, #t~malloc5.offset;havoc #t~malloc5.base, #t~malloc5.offset;~i~0 := 0;" "SUMMARY for call assume_abort_if_not((if ~N~0 % 4294967296 <= 536870911 then 1 else 0)); srcloc: L25-1" "assume ~N~0 <= 0;#res := 1;" "assume !(~N~0 <= 0);" "havoc #t~nondet4;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4;" "assume true;" "assume 0 == ~cond;assume false;" "assume !(0 == ~cond);" "~cond := #in~cond;" "assume true;" "assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int#2(98, 2, 0, 1);call write~init~int#2(114, 2, 1, 1);call write~init~int#2(115, 2, 2, 1);call write~init~int#2(52, 2, 3, 1);call write~init~int#2(102, 2, 4, 1);call write~init~int#2(46, 2, 5, 1);call write~init~int#2(99, 2, 6, 1);call write~init~int#2(0, 2, 7, 1);call #Ultimate.allocInit(12, 3);~N~0 := 0;" "assume true;" "SUMMARY for call #t~ret11 := main(); srcloc: L-1" "SUMMARY for call ULTIMATE.init(); srcloc: ULTIMATE.startENTRY" "assume true;" "assume false;" "assume false;" "assume !false;" "assume 0 == ~cond;" "assume !(0 == ~cond);" "~cond := #in~cond;" "assume true;" }, returnAlphabet = {"#48#return;" "#50#return;" "#44#return;" "#46#return;" }, states = {"CountingPredicate [underlying: 19#L33true, annotation: [6, 0]]" "CountingPredicate [underlying: 26#L40-3true, annotation: [2, 0]]" "CountingPredicate [underlying: 14#Loop~1true, annotation: [5, 0]]" "CountingPredicate [underlying: 29#assume_abort_if_notFINALtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 19#L33true, annotation: [2, 0]]" "CountingPredicate [underlying: 8#Loop~0true, annotation: [2, 0]]" "CountingPredicate [underlying: 22#L42true, annotation: [2, 0]]" "CountingPredicate [underlying: 37#ERRORtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 31#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 8#Loop~0true, annotation: [6, 0]]" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 3#L40-2true, annotation: [2, 0]]" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 5#L24true, annotation: [0, 0]]" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [13, 0]]" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 11#L48-2true, annotation: [5, 0]]" "CountingPredicate [underlying: 18#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [13, 0]]" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [13, 0]]" "CountingPredicate [underlying: 16#L40true, annotation: [2, 0]]" "CountingPredicate [underlying: 13#__VERIFIER_assertENTRYtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 4#L48true, annotation: [5, 0]]" "CountingPredicate [underlying: 33#L15true, annotation: [8, 0]]" "CountingPredicate [underlying: 14#Loop~1true, annotation: [9, 0]]" "CountingPredicate [underlying: 35#assume_abort_if_notENTRYtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 17#L15-2true, annotation: [2, 0]]" "CountingPredicate [underlying: 18#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 9#L48-1true, annotation: [5, 0]]" "CountingPredicate [underlying: 4#L48true, annotation: [13, 0]]" "CountingPredicate [underlying: 33#L15true, annotation: [7, 0]]" "CountingPredicate [underlying: 24#L13true, annotation: [2, 0]]" "CountingPredicate [underlying: 20#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 7#L31true, annotation: [5, 0]]" "CountingPredicate [underlying: 23#mainENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 29#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 9#L48-1true, annotation: [2, 0]]" "CountingPredicate [underlying: 37#ERRORtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 14#Loop~1true, annotation: [2, 0]]" "CountingPredicate [underlying: 26#L40-3true, annotation: [5, 0]]" "CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [13, 0]]" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [13, 0]]" "CountingPredicate [underlying: 8#Loop~0true, annotation: [5, 0]]" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 6#L25true, annotation: [4, 0]]" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 16#L40true, annotation: [9, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 25#L31-2true, annotation: [6, 0]]" "CountingPredicate [underlying: 11#L48-2true, annotation: [2, 0]]" "CountingPredicate [underlying: 4#L48true, annotation: [4, 0]]" "CountingPredicate [underlying: 25#L31-2true, annotation: [2, 0]]" "CountingPredicate [underlying: 12#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 9#L48-1true, annotation: [10, 0]]" "CountingPredicate [underlying: 17#L15-2true, annotation: [7, 0]]" "CountingPredicate [underlying: 4#L48true, annotation: [8, 0]]" "CountingPredicate [underlying: 16#L40true, annotation: [5, 0]]" "CountingPredicate [underlying: 13#__VERIFIER_assertENTRYtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 18#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 17#L15-2true, annotation: [11, 0]]" "CountingPredicate [underlying: 33#L15true, annotation: [2, 0]]" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 11#L48-2true, annotation: [10, 0]]" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 15#L25-1true, annotation: [1, 0]]" "CountingPredicate [underlying: 7#L31true, annotation: [4, 0]]" "CountingPredicate [underlying: 37#ERRORtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 22#L42true, annotation: [8, 0]]" "CountingPredicate [underlying: 22#L42true, annotation: [4, 0]]" "CountingPredicate [underlying: 26#L40-3true, annotation: [4, 0]]" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 3#L40-2true, annotation: [4, 0]]" "CountingPredicate [underlying: 11#L48-2true, annotation: [7, 0]]" "CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 25#L31-2true, annotation: [5, 0]]" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 13#__VERIFIER_assertENTRYtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 17#L15-2true, annotation: [8, 0]]" "CountingPredicate [underlying: 4#L48true, annotation: [7, 0]]" "CountingPredicate [underlying: 16#L40true, annotation: [4, 0]]" "CountingPredicate [underlying: 28#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 17#L15-2true, annotation: [4, 0]]" "CountingPredicate [underlying: 18#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 4#L48true, annotation: [11, 0]]" "CountingPredicate [underlying: 9#L48-1true, annotation: [7, 0]]" "CountingPredicate [underlying: 13#__VERIFIER_assertENTRYtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 16#L40true, annotation: [8, 0]]" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 33#L15true, annotation: [5, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 3#L40-2true, annotation: [8, 0]]" "CountingPredicate [underlying: 37#ERRORtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 37#ERRORtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 14#Loop~1true, annotation: [4, 0]]" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 19#L33true, annotation: [5, 0]]" "CountingPredicate [underlying: 22#L42true, annotation: [5, 0]]" "CountingPredicate [underlying: 37#ERRORtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 31#assume_abort_if_notEXITtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 6#L25true, annotation: [2, 0]]" "CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 3#L40-2true, annotation: [5, 0]]" "CountingPredicate [underlying: 22#L42true, annotation: [9, 0]]" "CountingPredicate [underlying: 10#L-1true, annotation: [0, 0]]" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [13, 0]]" "CountingPredicate [underlying: 13#__VERIFIER_assertENTRYtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 11#L48-2true, annotation: [8, 0]]" "CountingPredicate [underlying: 11#L48-2true, annotation: [4, 0]]" "CountingPredicate [underlying: 4#L48true, annotation: [2, 0]]" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [13, 0]]" "CountingPredicate [underlying: 33#L15true, annotation: [13, 0]]" "CountingPredicate [underlying: 26#L40-3true, annotation: [7, 0]]" "CountingPredicate [underlying: 9#L48-1true, annotation: [8, 0]]" "CountingPredicate [underlying: 17#L15-2true, annotation: [5, 0]]" "CountingPredicate [underlying: 18#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 14#Loop~1true, annotation: [8, 0]]" "CountingPredicate [underlying: 13#__VERIFIER_assertENTRYtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 9#L48-1true, annotation: [4, 0]]" "CountingPredicate [underlying: 16#L40true, annotation: [7, 0]]" "CountingPredicate [underlying: 18#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 33#L15true, annotation: [4, 0]]" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 3#L40-2true, annotation: [9, 0]]" "CountingPredicate [underlying: 7#L31true, annotation: [6, 0]]" "CountingPredicate [underlying: 7#L31true, annotation: [2, 0]]" "CountingPredicate [underlying: 21#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" }, initialStates = {"CountingPredicate [underlying: 21#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" }, finalStates = {"CountingPredicate [underlying: 18#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [13, 0]]" }, callTransitions = { ("CountingPredicate [underlying: 9#L48-1true, annotation: [5, 0]]" "call __VERIFIER_assert((if #t~mem10 <= 4 * ~N~0 then 1 else 0));" "CountingPredicate [underlying: 13#__VERIFIER_assertENTRYtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 9#L48-1true, annotation: [2, 0]]" "call __VERIFIER_assert((if #t~mem10 <= 4 * ~N~0 then 1 else 0));" "CountingPredicate [underlying: 13#__VERIFIER_assertENTRYtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 9#L48-1true, annotation: [10, 0]]" "call __VERIFIER_assert((if #t~mem10 <= 4 * ~N~0 then 1 else 0));" "CountingPredicate [underlying: 13#__VERIFIER_assertENTRYtrue, annotation: [11, 0]]") ("CountingPredicate [underlying: 15#L25-1true, annotation: [1, 0]]" "call assume_abort_if_not((if ~N~0 % 4294967296 <= 536870911 then 1 else 0));" "CountingPredicate [underlying: 35#assume_abort_if_notENTRYtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 9#L48-1true, annotation: [7, 0]]" "call __VERIFIER_assert((if #t~mem10 <= 4 * ~N~0 then 1 else 0));" "CountingPredicate [underlying: 13#__VERIFIER_assertENTRYtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 10#L-1true, annotation: [0, 0]]" "call #t~ret11 := main();" "CountingPredicate [underlying: 23#mainENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 9#L48-1true, annotation: [8, 0]]" "call __VERIFIER_assert((if #t~mem10 <= 4 * ~N~0 then 1 else 0));" "CountingPredicate [underlying: 13#__VERIFIER_assertENTRYtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 9#L48-1true, annotation: [4, 0]]" "call __VERIFIER_assert((if #t~mem10 <= 4 * ~N~0 then 1 else 0));" "CountingPredicate [underlying: 13#__VERIFIER_assertENTRYtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 21#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "call ULTIMATE.init();" "CountingPredicate [underlying: 20#ULTIMATE.initENTRYtrue, annotation: [0, 0]]") }, internalTransitions = { ("CountingPredicate [underlying: 19#L33true, annotation: [6, 0]]" "assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);" "CountingPredicate [underlying: 8#Loop~0true, annotation: [6, 0]]") ("CountingPredicate [underlying: 19#L33true, annotation: [6, 0]]" "assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);" "CountingPredicate [underlying: 8#Loop~0true, annotation: [6, 0]]") ("CountingPredicate [underlying: 26#L40-3true, annotation: [2, 0]]" "~i~0 := 0;" "CountingPredicate [underlying: 16#L40true, annotation: [2, 0]]") ("CountingPredicate [underlying: 14#Loop~1true, annotation: [5, 0]]" "#t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9;" "CountingPredicate [underlying: 16#L40true, annotation: [5, 0]]") ("CountingPredicate [underlying: 29#assume_abort_if_notFINALtrue, annotation: [3, 0]]" "assume true;" "CountingPredicate [underlying: 31#assume_abort_if_notEXITtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [8, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 19#L33true, annotation: [2, 0]]" "assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);" "CountingPredicate [underlying: 8#Loop~0true, annotation: [2, 0]]") ("CountingPredicate [underlying: 19#L33true, annotation: [2, 0]]" "assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);" "CountingPredicate [underlying: 8#Loop~0true, annotation: [2, 0]]") ("CountingPredicate [underlying: 8#Loop~0true, annotation: [2, 0]]" "#t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6;" "CountingPredicate [underlying: 7#L31true, annotation: [2, 0]]") ("CountingPredicate [underlying: 22#L42true, annotation: [2, 0]]" "assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 14#Loop~1true, annotation: [2, 0]]") ("CountingPredicate [underlying: 22#L42true, annotation: [2, 0]]" "assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;" "CountingPredicate [underlying: 14#Loop~1true, annotation: [2, 0]]") ("CountingPredicate [underlying: 37#ERRORtrue, annotation: [2, 0]]" "assume false;" "CountingPredicate [underlying: 33#L15true, annotation: [2, 0]]") ("CountingPredicate [underlying: 37#ERRORtrue, annotation: [2, 0]]" "assume !false;" "CountingPredicate [underlying: 18#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 8#Loop~0true, annotation: [6, 0]]" "#t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6;" "CountingPredicate [underlying: 7#L31true, annotation: [6, 0]]") ("CountingPredicate [underlying: 34#mainFINALtrue, annotation: [8, 0]]" "assume true;" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 3#L40-2true, annotation: [2, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 22#L42true, annotation: [2, 0]]") ("CountingPredicate [underlying: 3#L40-2true, annotation: [2, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 11#L48-2true, annotation: [2, 0]]") ("CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [8, 0]]" "assume true;" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 5#L24true, annotation: [0, 0]]" "assume ~N~0 <= 0;#res := 1;" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 5#L24true, annotation: [0, 0]]" "assume !(~N~0 <= 0);" "CountingPredicate [underlying: 15#L25-1true, annotation: [1, 0]]") ("CountingPredicate [underlying: 34#mainFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 34#mainFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 11#L48-2true, annotation: [5, 0]]" "call #t~mem10 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 9#L48-1true, annotation: [5, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 3#L40-2true, annotation: [2, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [2, 0]]" "assume !true;" "CountingPredicate [underlying: 11#L48-2true, annotation: [2, 0]]") ("CountingPredicate [underlying: 13#__VERIFIER_assertENTRYtrue, annotation: [2, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 17#L15-2true, annotation: [2, 0]]") ("CountingPredicate [underlying: 4#L48true, annotation: [5, 0]]" "havoc #t~mem10;#res := 1;call ULTIMATE.dealloc(~#sum~0.base, ~#sum~0.offset);havoc ~#sum~0.base, ~#sum~0.offset;" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 33#L15true, annotation: [8, 0]]" "assume false;" "CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 14#Loop~1true, annotation: [9, 0]]" "#t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9;" "CountingPredicate [underlying: 16#L40true, annotation: [9, 0]]") ("CountingPredicate [underlying: 35#assume_abort_if_notENTRYtrue, annotation: [2, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 24#L13true, annotation: [2, 0]]") ("CountingPredicate [underlying: 17#L15-2true, annotation: [2, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 37#ERRORtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 17#L15-2true, annotation: [2, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 4#L48true, annotation: [13, 0]]" "havoc #t~mem10;#res := 1;call ULTIMATE.dealloc(~#sum~0.base, ~#sum~0.offset);havoc ~#sum~0.base, ~#sum~0.offset;" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [13, 0]]") ("CountingPredicate [underlying: 33#L15true, annotation: [7, 0]]" "assume false;" "CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 24#L13true, annotation: [2, 0]]" "assume 0 == ~cond;assume false;" "CountingPredicate [underlying: 29#assume_abort_if_notFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 24#L13true, annotation: [2, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 29#assume_abort_if_notFINALtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 20#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int#2(98, 2, 0, 1);call write~init~int#2(114, 2, 1, 1);call write~init~int#2(115, 2, 2, 1);call write~init~int#2(52, 2, 3, 1);call write~init~int#2(102, 2, 4, 1);call write~init~int#2(46, 2, 5, 1);call write~init~int#2(99, 2, 6, 1);call write~init~int#2(0, 2, 7, 1);call #Ultimate.allocInit(12, 3);~N~0 := 0;" "CountingPredicate [underlying: 28#ULTIMATE.initFINALtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 7#L31true, annotation: [5, 0]]" "assume true;" "CountingPredicate [underlying: 25#L31-2true, annotation: [5, 0]]") ("CountingPredicate [underlying: 7#L31true, annotation: [5, 0]]" "assume !true;" "CountingPredicate [underlying: 26#L40-3true, annotation: [5, 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: 5#L24true, annotation: [0, 0]]") ("CountingPredicate [underlying: 29#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 31#assume_abort_if_notEXITtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 37#ERRORtrue, annotation: [5, 0]]" "assume false;" "CountingPredicate [underlying: 33#L15true, annotation: [5, 0]]") ("CountingPredicate [underlying: 37#ERRORtrue, annotation: [5, 0]]" "assume !false;" "CountingPredicate [underlying: 18#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 14#Loop~1true, annotation: [2, 0]]" "#t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9;" "CountingPredicate [underlying: 16#L40true, annotation: [2, 0]]") ("CountingPredicate [underlying: 26#L40-3true, annotation: [5, 0]]" "~i~0 := 0;" "CountingPredicate [underlying: 16#L40true, annotation: [5, 0]]") ("CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [13, 0]]" "assume true;" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [13, 0]]") ("CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [13, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [13, 0]]") ("CountingPredicate [underlying: 8#Loop~0true, annotation: [5, 0]]" "#t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6;" "CountingPredicate [underlying: 7#L31true, annotation: [5, 0]]") ("CountingPredicate [underlying: 34#mainFINALtrue, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 6#L25true, annotation: [4, 0]]" "havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(4 * ~N~0 % 4294967296);~a~0.base, ~a~0.offset := #t~malloc5.base, #t~malloc5.offset;havoc #t~malloc5.base, #t~malloc5.offset;~i~0 := 0;" "CountingPredicate [underlying: 7#L31true, annotation: [4, 0]]") ("CountingPredicate [underlying: 34#mainFINALtrue, annotation: [11, 0]]" "assume true;" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [11, 0]]") ("CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [5, 0]]" "assume true;" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [5, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [9, 0]]" "assume true;" "CountingPredicate [underlying: 3#L40-2true, annotation: [9, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [9, 0]]" "assume !true;" "CountingPredicate [underlying: 11#L48-2true, annotation: [10, 0]]") ("CountingPredicate [underlying: 25#L31-2true, annotation: [6, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 19#L33true, annotation: [6, 0]]") ("CountingPredicate [underlying: 25#L31-2true, annotation: [6, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 26#L40-3true, annotation: [7, 0]]") ("CountingPredicate [underlying: 11#L48-2true, annotation: [2, 0]]" "call #t~mem10 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 9#L48-1true, annotation: [2, 0]]") ("CountingPredicate [underlying: 4#L48true, annotation: [4, 0]]" "havoc #t~mem10;#res := 1;call ULTIMATE.dealloc(~#sum~0.base, ~#sum~0.offset);havoc ~#sum~0.base, ~#sum~0.offset;" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 25#L31-2true, annotation: [2, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 19#L33true, annotation: [2, 0]]") ("CountingPredicate [underlying: 25#L31-2true, annotation: [2, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 26#L40-3true, annotation: [2, 0]]") ("CountingPredicate [underlying: 17#L15-2true, annotation: [7, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 37#ERRORtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 17#L15-2true, annotation: [7, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 4#L48true, annotation: [8, 0]]" "havoc #t~mem10;#res := 1;call ULTIMATE.dealloc(~#sum~0.base, ~#sum~0.offset);havoc ~#sum~0.base, ~#sum~0.offset;" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [5, 0]]" "assume true;" "CountingPredicate [underlying: 3#L40-2true, annotation: [5, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [5, 0]]" "assume !true;" "CountingPredicate [underlying: 11#L48-2true, annotation: [5, 0]]") ("CountingPredicate [underlying: 13#__VERIFIER_assertENTRYtrue, annotation: [5, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 17#L15-2true, annotation: [5, 0]]") ("CountingPredicate [underlying: 17#L15-2true, annotation: [11, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 37#ERRORtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 17#L15-2true, annotation: [11, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [11, 0]]") ("CountingPredicate [underlying: 33#L15true, annotation: [2, 0]]" "assume false;" "CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 11#L48-2true, annotation: [10, 0]]" "call #t~mem10 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 9#L48-1true, annotation: [10, 0]]") ("CountingPredicate [underlying: 7#L31true, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 25#L31-2true, annotation: [5, 0]]") ("CountingPredicate [underlying: 7#L31true, annotation: [4, 0]]" "assume !true;" "CountingPredicate [underlying: 26#L40-3true, annotation: [4, 0]]") ("CountingPredicate [underlying: 37#ERRORtrue, annotation: [4, 0]]" "assume false;" "CountingPredicate [underlying: 33#L15true, annotation: [4, 0]]") ("CountingPredicate [underlying: 37#ERRORtrue, annotation: [4, 0]]" "assume !false;" "CountingPredicate [underlying: 18#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 22#L42true, annotation: [8, 0]]" "assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 14#Loop~1true, annotation: [9, 0]]") ("CountingPredicate [underlying: 22#L42true, annotation: [8, 0]]" "assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;" "CountingPredicate [underlying: 14#Loop~1true, annotation: [8, 0]]") ("CountingPredicate [underlying: 22#L42true, annotation: [4, 0]]" "assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 14#Loop~1true, annotation: [4, 0]]") ("CountingPredicate [underlying: 22#L42true, annotation: [4, 0]]" "assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;" "CountingPredicate [underlying: 14#Loop~1true, annotation: [4, 0]]") ("CountingPredicate [underlying: 26#L40-3true, annotation: [4, 0]]" "~i~0 := 0;" "CountingPredicate [underlying: 16#L40true, annotation: [4, 0]]") ("CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 3#L40-2true, annotation: [4, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 22#L42true, annotation: [4, 0]]") ("CountingPredicate [underlying: 3#L40-2true, annotation: [4, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 11#L48-2true, annotation: [4, 0]]") ("CountingPredicate [underlying: 11#L48-2true, annotation: [7, 0]]" "call #t~mem10 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 9#L48-1true, annotation: [7, 0]]") ("CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 25#L31-2true, annotation: [5, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 19#L33true, annotation: [5, 0]]") ("CountingPredicate [underlying: 25#L31-2true, annotation: [5, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 26#L40-3true, annotation: [5, 0]]") ("CountingPredicate [underlying: 34#mainFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 13#__VERIFIER_assertENTRYtrue, annotation: [8, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 17#L15-2true, annotation: [8, 0]]") ("CountingPredicate [underlying: 17#L15-2true, annotation: [8, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 37#ERRORtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 17#L15-2true, annotation: [8, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 4#L48true, annotation: [7, 0]]" "havoc #t~mem10;#res := 1;call ULTIMATE.dealloc(~#sum~0.base, ~#sum~0.offset);havoc ~#sum~0.base, ~#sum~0.offset;" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 3#L40-2true, annotation: [4, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [4, 0]]" "assume !true;" "CountingPredicate [underlying: 11#L48-2true, annotation: [4, 0]]") ("CountingPredicate [underlying: 28#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 12#ULTIMATE.initEXITtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 17#L15-2true, annotation: [4, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 37#ERRORtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 17#L15-2true, annotation: [4, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 4#L48true, annotation: [11, 0]]" "havoc #t~mem10;#res := 1;call ULTIMATE.dealloc(~#sum~0.base, ~#sum~0.offset);havoc ~#sum~0.base, ~#sum~0.offset;" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [11, 0]]") ("CountingPredicate [underlying: 13#__VERIFIER_assertENTRYtrue, annotation: [4, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 17#L15-2true, annotation: [4, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [8, 0]]" "assume true;" "CountingPredicate [underlying: 3#L40-2true, annotation: [8, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [8, 0]]" "assume !true;" "CountingPredicate [underlying: 11#L48-2true, annotation: [8, 0]]") ("CountingPredicate [underlying: 33#L15true, annotation: [5, 0]]" "assume false;" "CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 3#L40-2true, annotation: [8, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 22#L42true, annotation: [8, 0]]") ("CountingPredicate [underlying: 3#L40-2true, annotation: [8, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 11#L48-2true, annotation: [8, 0]]") ("CountingPredicate [underlying: 37#ERRORtrue, annotation: [12, 0]]" "assume false;" "CountingPredicate [underlying: 33#L15true, annotation: [13, 0]]") ("CountingPredicate [underlying: 37#ERRORtrue, annotation: [12, 0]]" "assume !false;" "CountingPredicate [underlying: 18#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [13, 0]]") ("CountingPredicate [underlying: 37#ERRORtrue, annotation: [8, 0]]" "assume false;" "CountingPredicate [underlying: 33#L15true, annotation: [8, 0]]") ("CountingPredicate [underlying: 37#ERRORtrue, annotation: [8, 0]]" "assume !false;" "CountingPredicate [underlying: 18#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 14#Loop~1true, annotation: [4, 0]]" "#t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9;" "CountingPredicate [underlying: 16#L40true, annotation: [4, 0]]") ("CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [11, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [11, 0]]") ("CountingPredicate [underlying: 19#L33true, annotation: [5, 0]]" "assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);" "CountingPredicate [underlying: 8#Loop~0true, annotation: [6, 0]]") ("CountingPredicate [underlying: 19#L33true, annotation: [5, 0]]" "assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);" "CountingPredicate [underlying: 8#Loop~0true, annotation: [5, 0]]") ("CountingPredicate [underlying: 22#L42true, annotation: [5, 0]]" "assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 14#Loop~1true, annotation: [5, 0]]") ("CountingPredicate [underlying: 22#L42true, annotation: [5, 0]]" "assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;" "CountingPredicate [underlying: 14#Loop~1true, annotation: [5, 0]]") ("CountingPredicate [underlying: 37#ERRORtrue, annotation: [7, 0]]" "assume false;" "CountingPredicate [underlying: 33#L15true, annotation: [7, 0]]") ("CountingPredicate [underlying: 37#ERRORtrue, annotation: [7, 0]]" "assume !false;" "CountingPredicate [underlying: 18#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [11, 0]]" "assume true;" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [11, 0]]") ("CountingPredicate [underlying: 6#L25true, annotation: [2, 0]]" "havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(4 * ~N~0 % 4294967296);~a~0.base, ~a~0.offset := #t~malloc5.base, #t~malloc5.offset;havoc #t~malloc5.base, #t~malloc5.offset;~i~0 := 0;" "CountingPredicate [underlying: 7#L31true, annotation: [2, 0]]") ("CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 3#L40-2true, annotation: [5, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 22#L42true, annotation: [5, 0]]") ("CountingPredicate [underlying: 3#L40-2true, annotation: [5, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 11#L48-2true, annotation: [5, 0]]") ("CountingPredicate [underlying: 22#L42true, annotation: [9, 0]]" "assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 14#Loop~1true, annotation: [9, 0]]") ("CountingPredicate [underlying: 22#L42true, annotation: [9, 0]]" "assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;" "CountingPredicate [underlying: 14#Loop~1true, annotation: [9, 0]]") ("CountingPredicate [underlying: 34#mainFINALtrue, annotation: [13, 0]]" "assume true;" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [13, 0]]") ("CountingPredicate [underlying: 13#__VERIFIER_assertENTRYtrue, annotation: [11, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 17#L15-2true, annotation: [11, 0]]") ("CountingPredicate [underlying: 11#L48-2true, annotation: [8, 0]]" "call #t~mem10 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 9#L48-1true, annotation: [8, 0]]") ("CountingPredicate [underlying: 11#L48-2true, annotation: [4, 0]]" "call #t~mem10 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);" "CountingPredicate [underlying: 9#L48-1true, annotation: [4, 0]]") ("CountingPredicate [underlying: 4#L48true, annotation: [2, 0]]" "havoc #t~mem10;#res := 1;call ULTIMATE.dealloc(~#sum~0.base, ~#sum~0.offset);havoc ~#sum~0.base, ~#sum~0.offset;" "CountingPredicate [underlying: 34#mainFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 34#mainFINALtrue, annotation: [5, 0]]" "assume true;" "CountingPredicate [underlying: 32#mainEXITtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 33#L15true, annotation: [13, 0]]" "assume false;" "CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [13, 0]]") ("CountingPredicate [underlying: 26#L40-3true, annotation: [7, 0]]" "~i~0 := 0;" "CountingPredicate [underlying: 16#L40true, annotation: [7, 0]]") ("CountingPredicate [underlying: 17#L15-2true, annotation: [5, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 37#ERRORtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 17#L15-2true, annotation: [5, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 14#Loop~1true, annotation: [8, 0]]" "#t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9;" "CountingPredicate [underlying: 16#L40true, annotation: [8, 0]]") ("CountingPredicate [underlying: 13#__VERIFIER_assertENTRYtrue, annotation: [7, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 17#L15-2true, annotation: [7, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 3#L40-2true, annotation: [8, 0]]") ("CountingPredicate [underlying: 16#L40true, annotation: [7, 0]]" "assume !true;" "CountingPredicate [underlying: 11#L48-2true, annotation: [7, 0]]") ("CountingPredicate [underlying: 33#L15true, annotation: [4, 0]]" "assume false;" "CountingPredicate [underlying: 27#__VERIFIER_assertFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 3#L40-2true, annotation: [9, 0]]" "assume ~i~0 < ~N~0;" "CountingPredicate [underlying: 22#L42true, annotation: [9, 0]]") ("CountingPredicate [underlying: 3#L40-2true, annotation: [9, 0]]" "assume !(~i~0 < ~N~0);" "CountingPredicate [underlying: 11#L48-2true, annotation: [10, 0]]") ("CountingPredicate [underlying: 7#L31true, annotation: [6, 0]]" "assume true;" "CountingPredicate [underlying: 25#L31-2true, annotation: [6, 0]]") ("CountingPredicate [underlying: 7#L31true, annotation: [6, 0]]" "assume !true;" "CountingPredicate [underlying: 26#L40-3true, annotation: [7, 0]]") ("CountingPredicate [underlying: 7#L31true, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 25#L31-2true, annotation: [2, 0]]") ("CountingPredicate [underlying: 7#L31true, annotation: [2, 0]]" "assume !true;" "CountingPredicate [underlying: 26#L40-3true, annotation: [2, 0]]") }, returnTransitions = { ("CountingPredicate [underlying: 31#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 15#L25-1true, annotation: [1, 0]]" "#46#return;" "CountingPredicate [underlying: 6#L25true, annotation: [2, 0]]") ("CountingPredicate [underlying: 32#mainEXITtrue, annotation: [13, 0]]" "CountingPredicate [underlying: 10#L-1true, annotation: [0, 0]]" "#48#return;" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [13, 0]]") ("CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [13, 0]]" "CountingPredicate [underlying: 9#L48-1true, annotation: [10, 0]]" "#44#return;" "CountingPredicate [underlying: 4#L48true, annotation: [13, 0]]") ("CountingPredicate [underlying: 32#mainEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 10#L-1true, annotation: [0, 0]]" "#48#return;" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 32#mainEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 10#L-1true, annotation: [0, 0]]" "#48#return;" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 9#L48-1true, annotation: [8, 0]]" "#44#return;" "CountingPredicate [underlying: 4#L48true, annotation: [8, 0]]") ("CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 9#L48-1true, annotation: [4, 0]]" "#44#return;" "CountingPredicate [underlying: 4#L48true, annotation: [4, 0]]") ("CountingPredicate [underlying: 32#mainEXITtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 10#L-1true, annotation: [0, 0]]" "#48#return;" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 12#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 21#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "#50#return;" "CountingPredicate [underlying: 10#L-1true, annotation: [0, 0]]") ("CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 9#L48-1true, annotation: [10, 0]]" "#44#return;" "CountingPredicate [underlying: 4#L48true, annotation: [11, 0]]") ("CountingPredicate [underlying: 32#mainEXITtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 10#L-1true, annotation: [0, 0]]" "#48#return;" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 9#L48-1true, annotation: [7, 0]]" "#44#return;" "CountingPredicate [underlying: 4#L48true, annotation: [7, 0]]") ("CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 9#L48-1true, annotation: [2, 0]]" "#44#return;" "CountingPredicate [underlying: 4#L48true, annotation: [2, 0]]") ("CountingPredicate [underlying: 32#mainEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 10#L-1true, annotation: [0, 0]]" "#48#return;" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 31#assume_abort_if_notEXITtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 15#L25-1true, annotation: [1, 0]]" "#46#return;" "CountingPredicate [underlying: 6#L25true, annotation: [4, 0]]") ("CountingPredicate [underlying: 32#mainEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 10#L-1true, annotation: [0, 0]]" "#48#return;" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 32#mainEXITtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 10#L-1true, annotation: [0, 0]]" "#48#return;" "CountingPredicate [underlying: 36#ULTIMATE.startFINALtrue, annotation: [11, 0]]") ("CountingPredicate [underlying: 30#__VERIFIER_assertEXITtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 9#L48-1true, annotation: [5, 0]]" "#44#return;" "CountingPredicate [underlying: 4#L48true, annotation: [5, 0]]") } ); [2024-08-07 13:44:48,328 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 36 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 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:44:48,330 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:48,330 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:48,331 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:48,331 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:48,332 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:48,332 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:48,333 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:48,333 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:48,333 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:48,333 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:48,333 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:48,334 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:48,334 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:48,334 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:48,334 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:48,335 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:48,335 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:48,335 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:48,335 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,335 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,336 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:48,336 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:48,336 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,336 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,336 WARN L283 nessProductAutomaton]: assume ~N~0 <= 0;#res := 1;, isNegated false [2024-08-07 13:44:48,337 WARN L283 nessProductAutomaton]: assume !(~N~0 <= 0);, isNegated true [2024-08-07 13:44:48,337 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,337 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,337 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,337 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,337 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,338 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,338 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,338 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,338 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,338 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,339 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,339 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,339 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,339 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,339 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,340 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,340 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,340 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,340 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,340 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,341 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,341 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,341 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,341 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,341 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,341 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,342 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,342 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,342 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,342 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,342 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,342 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,343 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,343 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,343 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,343 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,343 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,343 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,344 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,344 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,345 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,345 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,345 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,345 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,345 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,346 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,346 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,346 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,347 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,347 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,347 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,347 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,347 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,347 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,347 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,347 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,348 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,348 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,348 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,348 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,348 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,349 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,349 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,349 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,349 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,349 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,349 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,350 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,350 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,350 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,350 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,350 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,351 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,351 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,351 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,351 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,351 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,351 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,351 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,352 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,352 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,352 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,352 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,352 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,352 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,352 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,353 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,353 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,353 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,353 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,353 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,353 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,353 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,354 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,354 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,355 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,355 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,356 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,356 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,356 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,356 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,356 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,356 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,356 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,356 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,356 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,357 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,357 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,357 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,357 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,361 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,361 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,362 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,362 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,362 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,362 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,362 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,362 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,362 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,362 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,363 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,363 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,363 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,363 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,363 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,363 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,363 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,363 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,364 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,364 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,364 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,364 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,364 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,366 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,366 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,366 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,366 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,366 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,367 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,367 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,367 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,367 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,367 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,367 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,368 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,368 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,368 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,368 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,368 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,368 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,369 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,369 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,369 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,369 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,369 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,369 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,370 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,370 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,370 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,370 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,370 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,370 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,371 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,372 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,372 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,372 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,373 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,373 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,373 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,373 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,373 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,373 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,373 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,374 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,374 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,374 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,374 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,374 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,374 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,374 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,375 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,375 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,375 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,375 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,375 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,375 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,376 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,376 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,376 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,376 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,376 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,376 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,377 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,377 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,377 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,377 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,377 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,377 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,377 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,378 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,378 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,378 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,378 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,378 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,378 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,379 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,379 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,379 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,379 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,379 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,387 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,388 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,388 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,388 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,388 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,388 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,389 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,389 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,389 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,389 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,389 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,389 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,390 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,390 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,390 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,390 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,390 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,390 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,391 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,391 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,391 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,393 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,394 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,394 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,394 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,394 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,394 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,395 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,395 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,395 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,395 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,396 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,396 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,396 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,397 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,397 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,397 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,398 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,398 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,399 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,399 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,401 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,401 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,401 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,401 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,402 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,402 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,402 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,402 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,402 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,402 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,403 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,403 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,403 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,403 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,404 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,404 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,404 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,404 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 13:44:48,404 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,405 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:48,405 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,405 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,405 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,405 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,406 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,406 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,406 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,406 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,406 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,406 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,406 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,407 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,407 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,408 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,408 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,408 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,408 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,409 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:48,409 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,409 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,409 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,409 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,410 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,410 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,410 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,410 WARN L283 nessProductAutomaton]: assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4);call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated false [2024-08-07 13:44:48,410 WARN L283 nessProductAutomaton]: assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 4 then ~i~0 % 4 - 4 else ~i~0 % 4));call write~int#3(40, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);, isNegated true [2024-08-07 13:44:48,411 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:48,411 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,411 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,411 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,411 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,412 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,412 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,412 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,414 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:48,414 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,415 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,415 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,415 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,415 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,415 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,415 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,416 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:48,416 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,416 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,417 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,417 WARN L283 nessProductAutomaton]: assume ~i~0 < ~N~0;, isNegated false [2024-08-07 13:44:48,417 WARN L283 nessProductAutomaton]: assume !(~i~0 < ~N~0);, isNegated true [2024-08-07 13:44:48,417 WARN L283 nessProductAutomaton]: assume true;, isNegated false [2024-08-07 13:44:48,417 WARN L283 nessProductAutomaton]: assume !true;, isNegated true [2024-08-07 13:44:48,418 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:48,418 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,419 WARN L283 nessProductAutomaton]: assume 0 == ~i~0;call write~int#1(40, ~#sum~0.base, ~#sum~0.offset, 8);, isNegated false [2024-08-07 13:44:48,419 WARN L283 nessProductAutomaton]: assume !(0 == ~i~0);call #t~mem7 := read~int#1(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem8 := read~int#3(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int#1(#t~mem7 + #t~mem8, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem7;havoc #t~mem8;, isNegated true [2024-08-07 13:44:48,419 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:48,419 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,420 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:48,420 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,420 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 13:44:48,420 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 13:44:48,427 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 149 states to 38 states. [2024-08-07 13:44:48,446 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-07 13:44:48,453 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;@2dc99eb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-07 13:44:48,453 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-07 13:44:48,455 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2024-08-07 13:44:48,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-08-07 13:44:48,461 INFO L187 NwaCegarLoop]: Found error trace [2024-08-07 13:44:48,461 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, 1, 1] [2024-08-07 13:44:48,462 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-07 13:44:48,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-07 13:44:48,468 INFO L85 PathProgramCache]: Analyzing trace with hash -433304721, now seen corresponding path program 1 times [2024-08-07 13:44:48,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-07 13:44:48,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581170242] [2024-08-07 13:44:48,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-07 13:44:48,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-07 13:44:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-07 13:44:48,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-07 13:44:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-07 13:44:48,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-08-07 13:44:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-07 13:44:48,720 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:44:48,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-07 13:44:48,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581170242] [2024-08-07 13:44:48,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581170242] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-07 13:44:48,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-07 13:44:48,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-07 13:44:48,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437522581] [2024-08-07 13:44:48,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-07 13:44:48,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-07 13:44:48,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-07 13:44:48,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-07 13:44:48,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-07 13:44:48,765 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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:44:48,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-07 13:44:48,839 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-08-07 13:44:48,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-07 13:44:48,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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 29 [2024-08-07 13:44:48,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-07 13:44:48,842 INFO L225 Difference]: With dead ends: 38 [2024-08-07 13:44:48,842 INFO L226 Difference]: Without dead ends: 38 [2024-08-07 13:44:48,856 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:44:48,865 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.1s IncrementalHoareTripleChecker+Time [2024-08-07 13:44:48,866 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.1s Time] [2024-08-07 13:44:48,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-08-07 13:44:48,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-08-07 13:44:48,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 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:44:48,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-08-07 13:44:48,903 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 29 [2024-08-07 13:44:48,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-07 13:44:48,903 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-08-07 13:44:48,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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:44:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-08-07 13:44:48,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-08-07 13:44:48,904 INFO L187 NwaCegarLoop]: Found error trace [2024-08-07 13:44:48,905 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-07 13:44:48,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-07 13:44:48,905 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-07 13:44:48,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-07 13:44:48,906 INFO L85 PathProgramCache]: Analyzing trace with hash 483492187, now seen corresponding path program 1 times [2024-08-07 13:44:48,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-07 13:44:48,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937650085] [2024-08-07 13:44:48,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-07 13:44:48,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-07 13:44:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 13:44:48,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-07 13:44:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 13:44:49,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-07 13:44:49,059 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-07 13:44:49,061 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-07 13:44:49,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-07 13:44:49,067 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-08-07 13:44:49,073 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-07 13:44:49,090 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:44:49,091 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:44:49,092 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:44:49,093 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:44:49,094 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:44:49,094 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:44:49,094 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:44:49,094 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-08-07 13:44:49,099 WARN L915 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-08-07 13:44:49,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.08 01:44:49 BoogieIcfgContainer [2024-08-07 13:44:49,106 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-07 13:44:49,106 INFO L158 Benchmark]: Toolchain (without parser) took 1765.72ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 39.0MB in the beginning and 51.9MB in the end (delta: -12.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 13:44:49,107 INFO L158 Benchmark]: Witness Parser took 0.21ms. Allocated memory is still 54.5MB. Free memory was 36.7MB in the beginning and 36.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 13:44:49,107 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 54.5MB. Free memory was 34.1MB in the beginning and 34.0MB in the end (delta: 73.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 13:44:49,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.89ms. Allocated memory is still 73.4MB. Free memory was 38.8MB in the beginning and 44.6MB in the end (delta: -5.9MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-08-07 13:44:49,108 INFO L158 Benchmark]: Boogie Preprocessor took 58.26ms. Allocated memory is still 73.4MB. Free memory was 44.6MB in the beginning and 42.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-07 13:44:49,108 INFO L158 Benchmark]: IcfgBuilder took 422.11ms. Allocated memory is still 73.4MB. Free memory was 42.5MB in the beginning and 51.8MB in the end (delta: -9.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-08-07 13:44:49,111 INFO L158 Benchmark]: TraceAbstraction took 1001.29ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 51.1MB in the beginning and 51.9MB in the end (delta: -834.6kB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2024-08-07 13:44:49,113 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.21ms. Allocated memory is still 54.5MB. Free memory was 36.7MB in the beginning and 36.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.10ms. Allocated memory is still 54.5MB. Free memory was 34.1MB in the beginning and 34.0MB in the end (delta: 73.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.89ms. Allocated memory is still 73.4MB. Free memory was 38.8MB in the beginning and 44.6MB in the end (delta: -5.9MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.26ms. Allocated memory is still 73.4MB. Free memory was 44.6MB in the beginning and 42.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 422.11ms. Allocated memory is still 73.4MB. Free memory was 42.5MB in the beginning and 51.8MB in the end (delta: -9.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1001.29ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 51.1MB in the beginning and 51.9MB in the end (delta: -834.6kB). Peak memory consumption was 11.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] i=0 VAL [N=1, \old(N)=0, a={-1:0}, i=0, sum={9:0}] [L33] i%4==0 [L34] a[i] = 40 VAL [N=1, \old(N)=0, a={-1:0}, i=0, sum={9:0}] [L31] i++ VAL [N=1, \old(N)=0, a={-1:0}, i=1, sum={9:0}] [L40] i=0 VAL [N=1, \old(N)=0, a={-1:0}, i=0, sum={9:0}] [L42] i==0 [L43] sum[0] = 40 VAL [N=1, \old(N)=0, a={-1:0}, i=0, sum={9:0}] [L40] i++ VAL [N=1, \old(N)=0, a={-1:0}, i=1, sum={9:0}] [L48] EXPR sum[0] VAL [N=1, \old(N)=0, a={-1:0}] [L48] CALL __VERIFIER_assert(sum[0] <= 4*N) VAL [N=1, \old(N)=0, \old(cond)=0] [L15] !(cond) VAL [N=1, \old(N)=0, \old(cond)=0] [L15] reach_error() VAL [N=1, \old(N)=0, \old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 24 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, InterpolantAutomatonStates: 3, 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, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 30 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 2/2 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:44:49,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE