/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 16:58:11,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 16:58:11,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 16:58:11,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 16:58:11,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 16:58:11,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 16:58:11,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 16:58:11,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 16:58:11,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 16:58:11,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 16:58:11,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 16:58:11,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 16:58:11,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 16:58:11,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 16:58:11,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 16:58:11,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 16:58:11,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 16:58:11,737 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 16:58:11,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 16:58:11,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 16:58:11,744 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 16:58:11,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 16:58:11,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 16:58:11,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 16:58:11,747 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 16:58:11,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 16:58:11,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 16:58:11,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 16:58:11,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 16:58:11,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 16:58:11,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 16:58:11,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 16:58:11,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 16:58:11,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 16:58:11,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 16:58:11,756 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 16:58:11,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 16:58:11,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 16:58:11,757 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 16:58:11,757 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 16:58:11,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 16:58:11,759 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 16:58:11,760 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 16:58:11,769 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 16:58:11,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 16:58:11,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 16:58:11,770 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 16:58:11,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 16:58:11,770 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 16:58:11,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 16:58:11,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 16:58:11,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 16:58:11,771 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 16:58:11,771 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 16:58:11,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 16:58:11,771 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 16:58:11,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 16:58:11,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 16:58:11,772 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 16:58:11,772 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 16:58:11,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 16:58:11,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:58:11,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 16:58:11,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 16:58:11,773 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 16:58:11,773 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 16:58:11,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 16:58:11,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 16:58:11,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 16:58:11,984 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 16:58:11,986 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 16:58:11,987 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i [2022-04-07 16:58:12,032 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5b7559b6/66101b0d50344c119bbecba90a64d312/FLAG122df1530 [2022-04-07 16:58:12,378 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 16:58:12,378 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i [2022-04-07 16:58:12,383 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5b7559b6/66101b0d50344c119bbecba90a64d312/FLAG122df1530 [2022-04-07 16:58:12,396 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5b7559b6/66101b0d50344c119bbecba90a64d312 [2022-04-07 16:58:12,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 16:58:12,399 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 16:58:12,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 16:58:12,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 16:58:12,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 16:58:12,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:58:12" (1/1) ... [2022-04-07 16:58:12,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cd4ddcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:58:12, skipping insertion in model container [2022-04-07 16:58:12,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:58:12" (1/1) ... [2022-04-07 16:58:12,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 16:58:12,421 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 16:58:12,557 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i[834,847] [2022-04-07 16:58:12,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:58:12,589 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 16:58:12,600 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i[834,847] [2022-04-07 16:58:12,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:58:12,617 INFO L208 MainTranslator]: Completed translation [2022-04-07 16:58:12,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:58:12 WrapperNode [2022-04-07 16:58:12,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 16:58:12,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 16:58:12,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 16:58:12,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 16:58:12,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:58:12" (1/1) ... [2022-04-07 16:58:12,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:58:12" (1/1) ... [2022-04-07 16:58:12,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:58:12" (1/1) ... [2022-04-07 16:58:12,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:58:12" (1/1) ... [2022-04-07 16:58:12,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:58:12" (1/1) ... [2022-04-07 16:58:12,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:58:12" (1/1) ... [2022-04-07 16:58:12,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:58:12" (1/1) ... [2022-04-07 16:58:12,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 16:58:12,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 16:58:12,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 16:58:12,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 16:58:12,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:58:12" (1/1) ... [2022-04-07 16:58:12,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:58:12,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:58:12,680 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 16:58:12,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 16:58:12,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 16:58:12,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 16:58:12,720 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 16:58:12,720 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 16:58:12,721 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 16:58:12,721 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 16:58:12,721 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 16:58:12,721 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 16:58:12,721 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 16:58:12,721 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 16:58:12,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 16:58:12,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 16:58:12,722 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 16:58:12,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-07 16:58:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 16:58:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 16:58:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 16:58:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 16:58:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 16:58:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 16:58:12,771 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 16:58:12,772 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 16:58:12,894 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 16:58:12,898 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 16:58:12,899 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 16:58:12,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:58:12 BoogieIcfgContainer [2022-04-07 16:58:12,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 16:58:12,900 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 16:58:12,900 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 16:58:12,916 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 16:58:12,918 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:58:12" (1/1) ... [2022-04-07 16:58:12,920 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 16:58:12,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 04:58:12 BasicIcfg [2022-04-07 16:58:12,949 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 16:58:12,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 16:58:12,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 16:58:12,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 16:58:12,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 04:58:12" (1/4) ... [2022-04-07 16:58:12,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c440cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:58:12, skipping insertion in model container [2022-04-07 16:58:12,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:58:12" (2/4) ... [2022-04-07 16:58:12,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c440cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:58:12, skipping insertion in model container [2022-04-07 16:58:12,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:58:12" (3/4) ... [2022-04-07 16:58:12,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c440cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 04:58:12, skipping insertion in model container [2022-04-07 16:58:12,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 04:58:12" (4/4) ... [2022-04-07 16:58:12,970 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_1-1.iJordan [2022-04-07 16:58:12,973 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 16:58:12,973 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 16:58:13,023 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 16:58:13,028 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-07 16:58:13,028 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 16:58:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 16:58:13,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 16:58:13,052 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:58:13,052 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:58:13,053 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:58:13,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:58:13,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1599893512, now seen corresponding path program 1 times [2022-04-07 16:58:13,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:58:13,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670822978] [2022-04-07 16:58:13,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:58:13,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:58:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:13,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:58:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:13,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {30#true} is VALID [2022-04-07 16:58:13,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-07 16:58:13,217 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-07 16:58:13,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {30#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:58:13,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {30#true} is VALID [2022-04-07 16:58:13,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-07 16:58:13,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-07 16:58:13,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-07 16:58:13,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {30#true} is VALID [2022-04-07 16:58:13,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#true} [76] L32-3-->L32-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-07 16:58:13,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#false} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {31#false} is VALID [2022-04-07 16:58:13,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-07 16:58:13,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} [85] L37-->L38: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* (let ((.cse0 (mod v_main_~index~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|) (= (mod v_main_~index~0_1 2) 0)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {31#false} is VALID [2022-04-07 16:58:13,221 INFO L272 TraceCheckUtils]: 10: Hoare triple {31#false} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {31#false} is VALID [2022-04-07 16:58:13,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {31#false} is VALID [2022-04-07 16:58:13,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-07 16:58:13,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {31#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-07 16:58:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:58:13,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:58:13,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670822978] [2022-04-07 16:58:13,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670822978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:58:13,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:58:13,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 16:58:13,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299811524] [2022-04-07 16:58:13,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:58:13,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 16:58:13,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:58:13,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:58:13,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:58:13,261 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 16:58:13,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:58:13,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 16:58:13,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 16:58:13,280 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:58:13,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:58:13,348 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-07 16:58:13,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 16:58:13,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 16:58:13,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:58:13,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:58:13,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-04-07 16:58:13,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:58:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-04-07 16:58:13,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 33 transitions. [2022-04-07 16:58:13,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:58:13,408 INFO L225 Difference]: With dead ends: 27 [2022-04-07 16:58:13,408 INFO L226 Difference]: Without dead ends: 22 [2022-04-07 16:58:13,410 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 16:58:13,414 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 16:58:13,414 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 31 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 16:58:13,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-07 16:58:13,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-07 16:58:13,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:58:13,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 16:58:13,434 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 16:58:13,435 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 16:58:13,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:58:13,438 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-07 16:58:13,438 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-07 16:58:13,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:58:13,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:58:13,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-07 16:58:13,439 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-07 16:58:13,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:58:13,441 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-07 16:58:13,441 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-07 16:58:13,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:58:13,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:58:13,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:58:13,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:58:13,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 16:58:13,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-07 16:58:13,444 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2022-04-07 16:58:13,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:58:13,445 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-07 16:58:13,445 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:58:13,445 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-07 16:58:13,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 16:58:13,445 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:58:13,445 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:58:13,446 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 16:58:13,446 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:58:13,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:58:13,447 INFO L85 PathProgramCache]: Analyzing trace with hash -952263449, now seen corresponding path program 1 times [2022-04-07 16:58:13,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:58:13,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018447577] [2022-04-07 16:58:13,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:58:13,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:58:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:13,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:58:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:13,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {137#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {131#true} is VALID [2022-04-07 16:58:13,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131#true} is VALID [2022-04-07 16:58:13,547 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {131#true} {131#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131#true} is VALID [2022-04-07 16:58:13,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {131#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {137#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:58:13,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {137#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {131#true} is VALID [2022-04-07 16:58:13,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131#true} is VALID [2022-04-07 16:58:13,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131#true} {131#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131#true} is VALID [2022-04-07 16:58:13,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {131#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131#true} is VALID [2022-04-07 16:58:13,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {131#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {136#(= main_~index~0 0)} is VALID [2022-04-07 16:58:13,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {136#(= main_~index~0 0)} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {132#false} is VALID [2022-04-07 16:58:13,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {132#false} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {132#false} is VALID [2022-04-07 16:58:13,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {132#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {132#false} is VALID [2022-04-07 16:58:13,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {132#false} [85] L37-->L38: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* (let ((.cse0 (mod v_main_~index~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|) (= (mod v_main_~index~0_1 2) 0)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {132#false} is VALID [2022-04-07 16:58:13,550 INFO L272 TraceCheckUtils]: 10: Hoare triple {132#false} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {132#false} is VALID [2022-04-07 16:58:13,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {132#false} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {132#false} is VALID [2022-04-07 16:58:13,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {132#false} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {132#false} is VALID [2022-04-07 16:58:13,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {132#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#false} is VALID [2022-04-07 16:58:13,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:58:13,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:58:13,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018447577] [2022-04-07 16:58:13,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018447577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:58:13,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:58:13,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:58:13,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735976576] [2022-04-07 16:58:13,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:58:13,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 16:58:13,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:58:13,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:58:13,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:58:13,578 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:58:13,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:58:13,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:58:13,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:58:13,583 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:58:13,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:58:13,702 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-07 16:58:13,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:58:13,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 16:58:13,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:58:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:58:13,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-04-07 16:58:13,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:58:13,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-04-07 16:58:13,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 35 transitions. [2022-04-07 16:58:13,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:58:13,741 INFO L225 Difference]: With dead ends: 29 [2022-04-07 16:58:13,741 INFO L226 Difference]: Without dead ends: 29 [2022-04-07 16:58:13,744 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:58:13,746 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 16:58:13,746 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 25 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 16:58:13,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-07 16:58:13,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-04-07 16:58:13,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:58:13,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 16:58:13,752 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 16:58:13,753 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 16:58:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:58:13,755 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-07 16:58:13,755 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-07 16:58:13,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:58:13,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:58:13,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-07 16:58:13,757 INFO L87 Difference]: Start difference. First operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-07 16:58:13,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:58:13,759 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-07 16:58:13,759 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-07 16:58:13,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:58:13,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:58:13,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:58:13,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:58:13,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 16:58:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-07 16:58:13,761 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2022-04-07 16:58:13,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:58:13,761 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-07 16:58:13,761 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:58:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-07 16:58:13,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-07 16:58:13,762 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:58:13,762 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:58:13,762 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 16:58:13,762 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:58:13,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:58:13,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1051990743, now seen corresponding path program 1 times [2022-04-07 16:58:13,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:58:13,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158008053] [2022-04-07 16:58:13,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:58:13,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:58:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:13,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:58:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:13,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {261#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {254#true} is VALID [2022-04-07 16:58:13,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-07 16:58:13,829 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {254#true} {254#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-07 16:58:13,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {254#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {261#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:58:13,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {261#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {254#true} is VALID [2022-04-07 16:58:13,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-07 16:58:13,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {254#true} {254#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-07 16:58:13,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {254#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-07 16:58:13,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {254#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {259#(= main_~index~0 0)} is VALID [2022-04-07 16:58:13,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {259#(= main_~index~0 0)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {259#(= main_~index~0 0)} is VALID [2022-04-07 16:58:13,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {259#(= main_~index~0 0)} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {260#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:58:13,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {260#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {255#false} is VALID [2022-04-07 16:58:13,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {255#false} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {255#false} is VALID [2022-04-07 16:58:13,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {255#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {255#false} is VALID [2022-04-07 16:58:13,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {255#false} [85] L37-->L38: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* (let ((.cse0 (mod v_main_~index~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|) (= (mod v_main_~index~0_1 2) 0)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {255#false} is VALID [2022-04-07 16:58:13,833 INFO L272 TraceCheckUtils]: 12: Hoare triple {255#false} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {255#false} is VALID [2022-04-07 16:58:13,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {255#false} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {255#false} is VALID [2022-04-07 16:58:13,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {255#false} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {255#false} is VALID [2022-04-07 16:58:13,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {255#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {255#false} is VALID [2022-04-07 16:58:13,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:58:13,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:58:13,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158008053] [2022-04-07 16:58:13,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158008053] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:58:13,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977037611] [2022-04-07 16:58:13,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:58:13,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:58:13,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:58:13,840 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 16:58:13,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 16:58:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:13,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-07 16:58:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:13,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:58:13,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-07 16:58:14,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-04-07 16:58:14,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {254#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-07 16:58:14,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {254#true} is VALID [2022-04-07 16:58:14,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-07 16:58:14,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {254#true} {254#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-07 16:58:14,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {254#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-07 16:58:14,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {254#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {259#(= main_~index~0 0)} is VALID [2022-04-07 16:58:14,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {259#(= main_~index~0 0)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {283#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-07 16:58:14,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {283#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {283#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-07 16:58:14,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {283#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {283#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-07 16:58:14,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {283#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {293#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 16:58:14,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {293#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {293#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 16:58:14,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {293#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [85] L37-->L38: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* (let ((.cse0 (mod v_main_~index~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|) (= (mod v_main_~index~0_1 2) 0)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {300#(= |main_#t~mem3| 0)} is VALID [2022-04-07 16:58:14,145 INFO L272 TraceCheckUtils]: 12: Hoare triple {300#(= |main_#t~mem3| 0)} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {304#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:58:14,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {304#(<= 1 |__VERIFIER_assert_#in~cond|)} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {308#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:58:14,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {308#(<= 1 __VERIFIER_assert_~cond)} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {255#false} is VALID [2022-04-07 16:58:14,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {255#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {255#false} is VALID [2022-04-07 16:58:14,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:58:14,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:58:14,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-04-07 16:58:14,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-04-07 16:58:14,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {255#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {255#false} is VALID [2022-04-07 16:58:14,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {308#(<= 1 __VERIFIER_assert_~cond)} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {255#false} is VALID [2022-04-07 16:58:14,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {304#(<= 1 |__VERIFIER_assert_#in~cond|)} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {308#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:58:14,780 INFO L272 TraceCheckUtils]: 12: Hoare triple {324#(= (mod |main_#t~mem3| 4294967296) 0)} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {304#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:58:14,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {328#(or (not (<= (mod main_~index~0 2) 0)) (and (or (<= (mod main_~index~0 4294967296) 2147483647) (<= (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) 4294967296) (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296))) (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 4294967296) 2147483647)))))} [85] L37-->L38: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* (let ((.cse0 (mod v_main_~index~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|) (= (mod v_main_~index~0_1 2) 0)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {324#(= (mod |main_#t~mem3| 4294967296) 0)} is VALID [2022-04-07 16:58:14,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {332#(or (<= (div (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1)) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 2) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {328#(or (not (<= (mod main_~index~0 2) 0)) (and (or (<= (mod main_~index~0 4294967296) 2147483647) (<= (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) 4294967296) (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296))) (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 4294967296) 2147483647)))))} is VALID [2022-04-07 16:58:14,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {336#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {332#(or (<= (div (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1)) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 2) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-07 16:58:14,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {336#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {336#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} is VALID [2022-04-07 16:58:14,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {336#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {336#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} is VALID [2022-04-07 16:58:14,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {346#(or (= (* (mod main_~index~0 4294967296) 4) 0) (not (< (mod main_~index~0 4294967296) 1000)))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {336#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} is VALID [2022-04-07 16:58:14,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {254#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {346#(or (= (* (mod main_~index~0 4294967296) 4) 0) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-07 16:58:14,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {254#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-07 16:58:14,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {254#true} {254#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-07 16:58:14,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-07 16:58:14,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {254#true} is VALID [2022-04-07 16:58:14,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {254#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-07 16:58:14,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:58:14,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977037611] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:58:14,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:58:14,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 9] total 15 [2022-04-07 16:58:14,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730846500] [2022-04-07 16:58:14,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:58:14,822 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-07 16:58:14,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:58:14,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:58:14,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:58:14,875 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-07 16:58:14,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:58:14,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-07 16:58:14,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-07 16:58:14,876 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:58:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:58:15,652 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-07 16:58:15,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-07 16:58:15,652 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-07 16:58:15,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:58:15,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:58:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2022-04-07 16:58:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:58:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2022-04-07 16:58:15,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 48 transitions. [2022-04-07 16:58:15,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:58:15,703 INFO L225 Difference]: With dead ends: 41 [2022-04-07 16:58:15,704 INFO L226 Difference]: Without dead ends: 41 [2022-04-07 16:58:15,704 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2022-04-07 16:58:15,705 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 76 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:58:15,705 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 64 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 16:58:15,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-07 16:58:15,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-04-07 16:58:15,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:58:15,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 16:58:15,708 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 16:58:15,708 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 16:58:15,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:58:15,710 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-07 16:58:15,710 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-07 16:58:15,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:58:15,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:58:15,710 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-04-07 16:58:15,710 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-04-07 16:58:15,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:58:15,713 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-07 16:58:15,713 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-07 16:58:15,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:58:15,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:58:15,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:58:15,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:58:15,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 16:58:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-04-07 16:58:15,715 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2022-04-07 16:58:15,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:58:15,715 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-04-07 16:58:15,715 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:58:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-07 16:58:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 16:58:15,716 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:58:15,716 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:58:15,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 16:58:15,927 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:58:15,927 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:58:15,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:58:15,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1683413027, now seen corresponding path program 1 times [2022-04-07 16:58:15,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:58:15,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915530954] [2022-04-07 16:58:15,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:58:15,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:58:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:16,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:58:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:16,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {544#true} is VALID [2022-04-07 16:58:16,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {544#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {544#true} is VALID [2022-04-07 16:58:16,036 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {544#true} {544#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {544#true} is VALID [2022-04-07 16:58:16,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-07 16:58:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:16,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {544#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {544#true} is VALID [2022-04-07 16:58:16,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {544#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {544#true} is VALID [2022-04-07 16:58:16,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {544#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {544#true} is VALID [2022-04-07 16:58:16,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {544#true} {545#false} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {545#false} is VALID [2022-04-07 16:58:16,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {544#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:58:16,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {544#true} is VALID [2022-04-07 16:58:16,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {544#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {544#true} is VALID [2022-04-07 16:58:16,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {544#true} {544#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {544#true} is VALID [2022-04-07 16:58:16,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {544#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {544#true} is VALID [2022-04-07 16:58:16,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {544#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {549#(= main_~index~0 0)} is VALID [2022-04-07 16:58:16,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {549#(= main_~index~0 0)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {549#(= main_~index~0 0)} is VALID [2022-04-07 16:58:16,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {549#(= main_~index~0 0)} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {550#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-07 16:58:16,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {550#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {550#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-07 16:58:16,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {550#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {551#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:58:16,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {551#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {545#false} is VALID [2022-04-07 16:58:16,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {545#false} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {545#false} is VALID [2022-04-07 16:58:16,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {545#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {545#false} is VALID [2022-04-07 16:58:16,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {545#false} [85] L37-->L38: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* (let ((.cse0 (mod v_main_~index~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|) (= (mod v_main_~index~0_1 2) 0)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {545#false} is VALID [2022-04-07 16:58:16,059 INFO L272 TraceCheckUtils]: 14: Hoare triple {545#false} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {544#true} is VALID [2022-04-07 16:58:16,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {544#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {544#true} is VALID [2022-04-07 16:58:16,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {544#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {544#true} is VALID [2022-04-07 16:58:16,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {544#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {544#true} is VALID [2022-04-07 16:58:16,060 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {544#true} {545#false} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {545#false} is VALID [2022-04-07 16:58:16,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {545#false} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {545#false} is VALID [2022-04-07 16:58:16,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {545#false} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {545#false} is VALID [2022-04-07 16:58:16,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {545#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {545#false} is VALID [2022-04-07 16:58:16,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#false} [86] L37-->L40: Formula: (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (let ((.cse0 (mod v_main_~index~0_2 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) |v_main_~#array~0.offset_2|))) (not (= (mod v_main_~index~0_2 2) 0))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {545#false} is VALID [2022-04-07 16:58:16,060 INFO L272 TraceCheckUtils]: 23: Hoare triple {545#false} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {545#false} is VALID [2022-04-07 16:58:16,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {545#false} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {545#false} is VALID [2022-04-07 16:58:16,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {545#false} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {545#false} is VALID [2022-04-07 16:58:16,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {545#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {545#false} is VALID [2022-04-07 16:58:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-07 16:58:16,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:58:16,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915530954] [2022-04-07 16:58:16,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915530954] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:58:16,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609141327] [2022-04-07 16:58:16,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:58:16,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:58:16,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:58:16,064 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 16:58:16,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 16:58:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:16,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-07 16:58:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:16,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:58:16,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-04-07 16:58:22,422 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-04-07 16:58:22,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 10 [2022-04-07 16:58:23,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {544#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {544#true} is VALID [2022-04-07 16:58:23,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {544#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {544#true} is VALID [2022-04-07 16:58:23,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {544#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {544#true} is VALID [2022-04-07 16:58:23,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {544#true} {544#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {544#true} is VALID [2022-04-07 16:58:23,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {544#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {544#true} is VALID [2022-04-07 16:58:23,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {544#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {549#(= main_~index~0 0)} is VALID [2022-04-07 16:58:23,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {549#(= main_~index~0 0)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {549#(= main_~index~0 0)} is VALID [2022-04-07 16:58:23,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {549#(= main_~index~0 0)} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {550#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-07 16:58:23,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {550#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {584#(exists ((aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (= aux_mod_aux_mod_main_~index~0_30_32 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4) |main_~#array~0.offset|))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32))))} is VALID [2022-04-07 16:58:23,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {584#(exists ((aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (= aux_mod_aux_mod_main_~index~0_30_32 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4) |main_~#array~0.offset|))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32))))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {584#(exists ((aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (= aux_mod_aux_mod_main_~index~0_30_32 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4) |main_~#array~0.offset|))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32))))} is VALID [2022-04-07 16:58:23,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {584#(exists ((aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (= aux_mod_aux_mod_main_~index~0_30_32 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4) |main_~#array~0.offset|))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32))))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {584#(exists ((aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (= aux_mod_aux_mod_main_~index~0_30_32 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4) |main_~#array~0.offset|))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32))))} is VALID [2022-04-07 16:58:23,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {584#(exists ((aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (= aux_mod_aux_mod_main_~index~0_30_32 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4) |main_~#array~0.offset|))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32))))} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {594#(and (exists ((aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (= aux_mod_aux_mod_main_~index~0_30_32 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4) |main_~#array~0.offset|))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32)))) (= main_~index~0 0))} is VALID [2022-04-07 16:58:23,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {594#(and (exists ((aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (= aux_mod_aux_mod_main_~index~0_30_32 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4) |main_~#array~0.offset|))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32)))) (= main_~index~0 0))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {594#(and (exists ((aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (= aux_mod_aux_mod_main_~index~0_30_32 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4) |main_~#array~0.offset|))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32)))) (= main_~index~0 0))} is VALID [2022-04-07 16:58:23,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {594#(and (exists ((aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (= aux_mod_aux_mod_main_~index~0_30_32 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4) |main_~#array~0.offset|))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32)))) (= main_~index~0 0))} [85] L37-->L38: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* (let ((.cse0 (mod v_main_~index~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|) (= (mod v_main_~index~0_1 2) 0)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {594#(and (exists ((aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (= aux_mod_aux_mod_main_~index~0_30_32 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4) |main_~#array~0.offset|))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32)))) (= main_~index~0 0))} is VALID [2022-04-07 16:58:23,053 INFO L272 TraceCheckUtils]: 14: Hoare triple {594#(and (exists ((aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (= aux_mod_aux_mod_main_~index~0_30_32 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4) |main_~#array~0.offset|))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32)))) (= main_~index~0 0))} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {604#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int) (aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4))) aux_mod_aux_mod_main_~index~0_30_32) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32))))} is VALID [2022-04-07 16:58:23,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {604#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int) (aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4))) aux_mod_aux_mod_main_~index~0_30_32) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32))))} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {604#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int) (aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4))) aux_mod_aux_mod_main_~index~0_30_32) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32))))} is VALID [2022-04-07 16:58:23,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {604#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int) (aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4))) aux_mod_aux_mod_main_~index~0_30_32) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32))))} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {604#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int) (aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4))) aux_mod_aux_mod_main_~index~0_30_32) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32))))} is VALID [2022-04-07 16:58:23,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {604#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int) (aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4))) aux_mod_aux_mod_main_~index~0_30_32) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32))))} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {604#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int) (aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4))) aux_mod_aux_mod_main_~index~0_30_32) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32))))} is VALID [2022-04-07 16:58:23,113 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {604#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int) (aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4))) aux_mod_aux_mod_main_~index~0_30_32) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32))))} {594#(and (exists ((aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (= aux_mod_aux_mod_main_~index~0_30_32 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4) |main_~#array~0.offset|))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32)))) (= main_~index~0 0))} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {594#(and (exists ((aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (= aux_mod_aux_mod_main_~index~0_30_32 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4) |main_~#array~0.offset|))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32)))) (= main_~index~0 0))} is VALID [2022-04-07 16:58:23,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {594#(and (exists ((aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (= aux_mod_aux_mod_main_~index~0_30_32 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4) |main_~#array~0.offset|))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32)))) (= main_~index~0 0))} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {594#(and (exists ((aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (= aux_mod_aux_mod_main_~index~0_30_32 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4) |main_~#array~0.offset|))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32)))) (= main_~index~0 0))} is VALID [2022-04-07 16:58:23,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {594#(and (exists ((aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (= aux_mod_aux_mod_main_~index~0_30_32 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4) |main_~#array~0.offset|))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32)))) (= main_~index~0 0))} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {623#(and (exists ((aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (= aux_mod_aux_mod_main_~index~0_30_32 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4) |main_~#array~0.offset|))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32)))) (= main_~index~0 1))} is VALID [2022-04-07 16:58:23,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {623#(and (exists ((aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (= aux_mod_aux_mod_main_~index~0_30_32 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4) |main_~#array~0.offset|))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32)))) (= main_~index~0 1))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {623#(and (exists ((aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (= aux_mod_aux_mod_main_~index~0_30_32 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4) |main_~#array~0.offset|))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32)))) (= main_~index~0 1))} is VALID [2022-04-07 16:58:23,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {623#(and (exists ((aux_mod_aux_mod_main_~index~0_30_32 Int) (aux_div_main_~index~0_30 Int) (aux_div_aux_mod_main_~index~0_30_32 Int)) (and (<= 1 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296))) (= aux_mod_aux_mod_main_~index~0_30_32 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 4294967296) 4) |main_~#array~0.offset|))) (<= 0 aux_mod_aux_mod_main_~index~0_30_32) (<= (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32 (* aux_div_main_~index~0_30 4294967296)) 1) (< (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32) 1000) (< aux_mod_aux_mod_main_~index~0_30_32 2) (<= 0 (+ (* aux_div_aux_mod_main_~index~0_30_32 2) aux_mod_aux_mod_main_~index~0_30_32)))) (= main_~index~0 1))} [86] L37-->L40: Formula: (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (let ((.cse0 (mod v_main_~index~0_2 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) |v_main_~#array~0.offset_2|))) (not (= (mod v_main_~index~0_2 2) 0))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {630#(and (< |main_#t~mem4| 2) (<= 0 |main_#t~mem4|) (<= (div (+ (- 1) |main_#t~mem4|) (- 2)) (div (+ (* (- 1) |main_#t~mem4|) 1) 2)))} is VALID [2022-04-07 16:58:23,135 INFO L272 TraceCheckUtils]: 23: Hoare triple {630#(and (< |main_#t~mem4| 2) (<= 0 |main_#t~mem4|) (<= (div (+ (- 1) |main_#t~mem4|) (- 2)) (div (+ (* (- 1) |main_#t~mem4|) 1) 2)))} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {634#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:58:23,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {634#(<= 1 |__VERIFIER_assert_#in~cond|)} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {638#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:58:23,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {638#(<= 1 __VERIFIER_assert_~cond)} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {545#false} is VALID [2022-04-07 16:58:23,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {545#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {545#false} is VALID [2022-04-07 16:58:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:58:23,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:58:23,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2022-04-07 16:58:23,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2022-04-07 16:58:23,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {545#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {545#false} is VALID [2022-04-07 16:58:23,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {638#(<= 1 __VERIFIER_assert_~cond)} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {545#false} is VALID [2022-04-07 16:58:23,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {634#(<= 1 |__VERIFIER_assert_#in~cond|)} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {638#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:58:23,606 INFO L272 TraceCheckUtils]: 23: Hoare triple {654#(not (= (mod |main_#t~mem4| 4294967296) 0))} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {634#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:58:23,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {658#(or (= (mod main_~index~0 2) 0) (and (or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)) (<= (mod main_~index~0 4294967296) 2147483647)) (or (not (= (mod (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967295) 4294967296) 0)) (not (<= (mod main_~index~0 4294967296) 2147483647)))))} [86] L37-->L40: Formula: (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (let ((.cse0 (mod v_main_~index~0_2 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) |v_main_~#array~0.offset_2|))) (not (= (mod v_main_~index~0_2 2) 0))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {654#(not (= (mod |main_#t~mem4| 4294967296) 0))} is VALID [2022-04-07 16:58:23,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {662#(or (= (mod main_~index~0 2) 0) (not (= (mod (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967295) 4294967296) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {658#(or (= (mod main_~index~0 2) 0) (and (or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)) (<= (mod main_~index~0 4294967296) 2147483647)) (or (not (= (mod (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967295) 4294967296) 0)) (not (<= (mod main_~index~0 4294967296) 2147483647)))))} is VALID [2022-04-07 16:58:23,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {666#(or (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {662#(or (= (mod main_~index~0 2) 0) (not (= (mod (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967295) 4294967296) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-07 16:58:23,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {666#(or (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {666#(or (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} is VALID [2022-04-07 16:58:23,613 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {544#true} {666#(or (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {666#(or (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} is VALID [2022-04-07 16:58:23,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {544#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {544#true} is VALID [2022-04-07 16:58:23,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {544#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {544#true} is VALID [2022-04-07 16:58:23,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {544#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {544#true} is VALID [2022-04-07 16:58:23,613 INFO L272 TraceCheckUtils]: 14: Hoare triple {666#(or (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {544#true} is VALID [2022-04-07 16:58:23,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {666#(or (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} [85] L37-->L38: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* (let ((.cse0 (mod v_main_~index~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|) (= (mod v_main_~index~0_1 2) 0)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {666#(or (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} is VALID [2022-04-07 16:58:23,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {666#(or (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {666#(or (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} is VALID [2022-04-07 16:58:23,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {694#(not (= (mod (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967295) 4294967296) 0))} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {666#(or (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} is VALID [2022-04-07 16:58:23,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {694#(not (= (mod (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967295) 4294967296) 0))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {694#(not (= (mod (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967295) 4294967296) 0))} is VALID [2022-04-07 16:58:23,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {694#(not (= (mod (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967295) 4294967296) 0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {694#(not (= (mod (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967295) 4294967296) 0))} is VALID [2022-04-07 16:58:23,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {704#(or (forall ((|main_~#array~0.offset| Int)) (= (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) (+ |main_~#array~0.offset| 4))) (not (< (mod main_~index~0 4294967296) 1000)))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {694#(not (= (mod (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967295) 4294967296) 0))} is VALID [2022-04-07 16:58:23,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {708#(or (forall ((|main_~#array~0.offset| Int)) (= (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (+ |main_~#array~0.offset| 4))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {704#(or (forall ((|main_~#array~0.offset| Int)) (= (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) (+ |main_~#array~0.offset| 4))) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-07 16:58:23,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {708#(or (forall ((|main_~#array~0.offset| Int)) (= (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (+ |main_~#array~0.offset| 4))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {708#(or (forall ((|main_~#array~0.offset| Int)) (= (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (+ |main_~#array~0.offset| 4))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} is VALID [2022-04-07 16:58:23,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {544#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {708#(or (forall ((|main_~#array~0.offset| Int)) (= (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (+ |main_~#array~0.offset| 4))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} is VALID [2022-04-07 16:58:23,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {544#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {544#true} is VALID [2022-04-07 16:58:23,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {544#true} {544#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {544#true} is VALID [2022-04-07 16:58:23,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {544#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {544#true} is VALID [2022-04-07 16:58:23,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {544#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {544#true} is VALID [2022-04-07 16:58:23,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {544#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {544#true} is VALID [2022-04-07 16:58:23,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:58:23,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609141327] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:58:23,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:58:23,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11] total 20 [2022-04-07 16:58:23,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997015993] [2022-04-07 16:58:23,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:58:23,621 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 27 [2022-04-07 16:58:23,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:58:23,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 16:58:23,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:58:23,728 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-07 16:58:23,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:58:23,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-07 16:58:23,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2022-04-07 16:58:23,729 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 20 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 16:58:24,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:58:24,630 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-07 16:58:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-07 16:58:24,630 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 27 [2022-04-07 16:58:24,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:58:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 16:58:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2022-04-07 16:58:24,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 16:58:24,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2022-04-07 16:58:24,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 44 transitions. [2022-04-07 16:58:24,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:58:24,696 INFO L225 Difference]: With dead ends: 48 [2022-04-07 16:58:24,696 INFO L226 Difference]: Without dead ends: 48 [2022-04-07 16:58:24,696 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=827, Unknown=0, NotChecked=0, Total=992 [2022-04-07 16:58:24,697 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:58:24,697 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 77 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 197 Invalid, 0 Unknown, 116 Unchecked, 0.3s Time] [2022-04-07 16:58:24,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-07 16:58:24,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2022-04-07 16:58:24,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:58:24,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 47 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 16:58:24,700 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 47 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 16:58:24,700 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 47 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 16:58:24,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:58:24,701 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-07 16:58:24,702 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-04-07 16:58:24,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:58:24,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:58:24,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 48 states. [2022-04-07 16:58:24,702 INFO L87 Difference]: Start difference. First operand has 47 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 48 states. [2022-04-07 16:58:24,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:58:24,704 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-07 16:58:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-04-07 16:58:24,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:58:24,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:58:24,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:58:24,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:58:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 16:58:24,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-04-07 16:58:24,706 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 27 [2022-04-07 16:58:24,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:58:24,706 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-04-07 16:58:24,706 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 16:58:24,706 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-04-07 16:58:24,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 16:58:24,706 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:58:24,706 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:58:24,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 16:58:24,922 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-07 16:58:24,923 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:58:24,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:58:24,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1290504993, now seen corresponding path program 2 times [2022-04-07 16:58:24,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:58:24,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641039015] [2022-04-07 16:58:24,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:58:24,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:58:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:25,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:58:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:25,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {960#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {947#true} is VALID [2022-04-07 16:58:25,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {947#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 16:58:25,039 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {947#true} {947#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 16:58:25,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-07 16:58:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:25,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {947#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {947#true} is VALID [2022-04-07 16:58:25,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {947#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 16:58:25,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {947#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 16:58:25,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {947#true} {948#false} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {948#false} is VALID [2022-04-07 16:58:25,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {947#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {960#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:58:25,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {960#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {947#true} is VALID [2022-04-07 16:58:25,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {947#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 16:58:25,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {947#true} {947#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 16:58:25,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {947#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 16:58:25,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {947#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {952#(= main_~index~0 0)} is VALID [2022-04-07 16:58:25,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {952#(= main_~index~0 0)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {952#(= main_~index~0 0)} is VALID [2022-04-07 16:58:25,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {952#(= main_~index~0 0)} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {953#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-07 16:58:25,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {953#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {953#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-07 16:58:25,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {953#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {954#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-07 16:58:25,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {954#(and (<= main_~index~0 2) (<= 2 main_~index~0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {954#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-07 16:58:25,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {954#(and (<= main_~index~0 2) (<= 2 main_~index~0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {955#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:58:25,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {955#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {948#false} is VALID [2022-04-07 16:58:25,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {948#false} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {948#false} is VALID [2022-04-07 16:58:25,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {948#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {948#false} is VALID [2022-04-07 16:58:25,053 INFO L290 TraceCheckUtils]: 15: Hoare triple {948#false} [85] L37-->L38: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* (let ((.cse0 (mod v_main_~index~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|) (= (mod v_main_~index~0_1 2) 0)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {948#false} is VALID [2022-04-07 16:58:25,053 INFO L272 TraceCheckUtils]: 16: Hoare triple {948#false} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {947#true} is VALID [2022-04-07 16:58:25,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {947#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {947#true} is VALID [2022-04-07 16:58:25,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {947#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 16:58:25,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {947#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 16:58:25,053 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {947#true} {948#false} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {948#false} is VALID [2022-04-07 16:58:25,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {948#false} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {948#false} is VALID [2022-04-07 16:58:25,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {948#false} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {948#false} is VALID [2022-04-07 16:58:25,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {948#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {948#false} is VALID [2022-04-07 16:58:25,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {948#false} [86] L37-->L40: Formula: (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (let ((.cse0 (mod v_main_~index~0_2 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) |v_main_~#array~0.offset_2|))) (not (= (mod v_main_~index~0_2 2) 0))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {948#false} is VALID [2022-04-07 16:58:25,054 INFO L272 TraceCheckUtils]: 25: Hoare triple {948#false} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {948#false} is VALID [2022-04-07 16:58:25,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {948#false} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {948#false} is VALID [2022-04-07 16:58:25,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {948#false} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {948#false} is VALID [2022-04-07 16:58:25,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {948#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {948#false} is VALID [2022-04-07 16:58:25,054 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-07 16:58:25,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:58:25,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641039015] [2022-04-07 16:58:25,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641039015] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:58:25,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928048552] [2022-04-07 16:58:25,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 16:58:25,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:58:25,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:58:25,059 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 16:58:25,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 16:58:25,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 16:58:25,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 16:58:25,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 16:58:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:25,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:58:25,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-04-07 16:58:25,778 INFO L356 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2022-04-07 16:58:25,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-04-07 16:58:32,301 INFO L356 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2022-04-07 16:58:32,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 38 [2022-04-07 16:58:33,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {947#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 16:58:33,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {947#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {947#true} is VALID [2022-04-07 16:58:33,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {947#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 16:58:33,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {947#true} {947#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 16:58:33,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {947#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 16:58:33,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {947#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {952#(= main_~index~0 0)} is VALID [2022-04-07 16:58:33,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {952#(= main_~index~0 0)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {952#(= main_~index~0 0)} is VALID [2022-04-07 16:58:33,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {952#(= main_~index~0 0)} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {953#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-07 16:58:33,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {953#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {988#(and (<= main_~index~0 1) (<= 1 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-07 16:58:33,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {988#(and (<= main_~index~0 1) (<= 1 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {992#(and (<= main_~index~0 2) (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (<= 2 main_~index~0))} is VALID [2022-04-07 16:58:33,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {992#(and (<= main_~index~0 2) (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (<= 2 main_~index~0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {996#(exists ((v_arrayElimCell_8 Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_8) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2)))} is VALID [2022-04-07 16:58:33,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {996#(exists ((v_arrayElimCell_8 Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_8) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {996#(exists ((v_arrayElimCell_8 Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_8) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2)))} is VALID [2022-04-07 16:58:33,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {996#(exists ((v_arrayElimCell_8 Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_8) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2)))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {996#(exists ((v_arrayElimCell_8 Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_8) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2)))} is VALID [2022-04-07 16:58:33,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {996#(exists ((v_arrayElimCell_8 Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_8) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2)))} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {1006#(and (exists ((v_arrayElimCell_8 Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_8) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2))) (= main_~index~0 0))} is VALID [2022-04-07 16:58:33,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {1006#(and (exists ((v_arrayElimCell_8 Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_8) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2))) (= main_~index~0 0))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1006#(and (exists ((v_arrayElimCell_8 Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_8) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2))) (= main_~index~0 0))} is VALID [2022-04-07 16:58:33,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {1006#(and (exists ((v_arrayElimCell_8 Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_8) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2))) (= main_~index~0 0))} [85] L37-->L38: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* (let ((.cse0 (mod v_main_~index~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|) (= (mod v_main_~index~0_1 2) 0)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {1006#(and (exists ((v_arrayElimCell_8 Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_8) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2))) (= main_~index~0 0))} is VALID [2022-04-07 16:58:33,125 INFO L272 TraceCheckUtils]: 16: Hoare triple {1006#(and (exists ((v_arrayElimCell_8 Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_8) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2))) (= main_~index~0 0))} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1016#(exists ((v_arrayElimCell_8 Int) (|v_main_~#array~0.offset_BEFORE_CALL_3| Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int) (|v_main_~#array~0.base_BEFORE_CALL_3| Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= v_arrayElimCell_8 (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) (+ |v_main_~#array~0.offset_BEFORE_CALL_3| (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4)))) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2)))} is VALID [2022-04-07 16:58:33,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {1016#(exists ((v_arrayElimCell_8 Int) (|v_main_~#array~0.offset_BEFORE_CALL_3| Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int) (|v_main_~#array~0.base_BEFORE_CALL_3| Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= v_arrayElimCell_8 (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) (+ |v_main_~#array~0.offset_BEFORE_CALL_3| (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4)))) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2)))} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1016#(exists ((v_arrayElimCell_8 Int) (|v_main_~#array~0.offset_BEFORE_CALL_3| Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int) (|v_main_~#array~0.base_BEFORE_CALL_3| Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= v_arrayElimCell_8 (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) (+ |v_main_~#array~0.offset_BEFORE_CALL_3| (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4)))) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2)))} is VALID [2022-04-07 16:58:33,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {1016#(exists ((v_arrayElimCell_8 Int) (|v_main_~#array~0.offset_BEFORE_CALL_3| Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int) (|v_main_~#array~0.base_BEFORE_CALL_3| Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= v_arrayElimCell_8 (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) (+ |v_main_~#array~0.offset_BEFORE_CALL_3| (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4)))) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2)))} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1016#(exists ((v_arrayElimCell_8 Int) (|v_main_~#array~0.offset_BEFORE_CALL_3| Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int) (|v_main_~#array~0.base_BEFORE_CALL_3| Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= v_arrayElimCell_8 (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) (+ |v_main_~#array~0.offset_BEFORE_CALL_3| (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4)))) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2)))} is VALID [2022-04-07 16:58:33,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {1016#(exists ((v_arrayElimCell_8 Int) (|v_main_~#array~0.offset_BEFORE_CALL_3| Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int) (|v_main_~#array~0.base_BEFORE_CALL_3| Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= v_arrayElimCell_8 (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) (+ |v_main_~#array~0.offset_BEFORE_CALL_3| (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4)))) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2)))} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1016#(exists ((v_arrayElimCell_8 Int) (|v_main_~#array~0.offset_BEFORE_CALL_3| Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int) (|v_main_~#array~0.base_BEFORE_CALL_3| Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= v_arrayElimCell_8 (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) (+ |v_main_~#array~0.offset_BEFORE_CALL_3| (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4)))) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2)))} is VALID [2022-04-07 16:58:33,127 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1016#(exists ((v_arrayElimCell_8 Int) (|v_main_~#array~0.offset_BEFORE_CALL_3| Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int) (|v_main_~#array~0.base_BEFORE_CALL_3| Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= v_arrayElimCell_8 (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) (+ |v_main_~#array~0.offset_BEFORE_CALL_3| (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4)))) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2)))} {1006#(and (exists ((v_arrayElimCell_8 Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_8) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2))) (= main_~index~0 0))} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1006#(and (exists ((v_arrayElimCell_8 Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_8) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2))) (= main_~index~0 0))} is VALID [2022-04-07 16:58:33,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {1006#(and (exists ((v_arrayElimCell_8 Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_8) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2))) (= main_~index~0 0))} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {1006#(and (exists ((v_arrayElimCell_8 Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_8) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2))) (= main_~index~0 0))} is VALID [2022-04-07 16:58:33,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {1006#(and (exists ((v_arrayElimCell_8 Int) (aux_div_aux_mod_main_~index~0_27_87 Int) (aux_div_main_~index~0_27 Int)) (and (<= (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 3) (<= 3 (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967294 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27)) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_8) (< (+ v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27) 4294966295) (* aux_div_aux_mod_main_~index~0_27_87 4294967296)) (<= 0 v_arrayElimCell_8) (<= (* aux_div_aux_mod_main_~index~0_27_87 4294967296) (+ 4294967295 v_arrayElimCell_8 (* 2 aux_div_main_~index~0_27))) (< v_arrayElimCell_8 2))) (= main_~index~0 0))} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {988#(and (<= main_~index~0 1) (<= 1 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-07 16:58:33,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {988#(and (<= main_~index~0 1) (<= 1 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {988#(and (<= main_~index~0 1) (<= 1 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-07 16:58:33,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {988#(and (<= main_~index~0 1) (<= 1 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} [86] L37-->L40: Formula: (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (let ((.cse0 (mod v_main_~index~0_2 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) |v_main_~#array~0.offset_2|))) (not (= (mod v_main_~index~0_2 2) 0))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {1041#(and (< |main_#t~mem4| 2) (<= 0 |main_#t~mem4|) (<= (div (+ (- 1) |main_#t~mem4|) (- 2)) (div (+ (* (- 1) |main_#t~mem4|) 1) 2)))} is VALID [2022-04-07 16:58:33,136 INFO L272 TraceCheckUtils]: 25: Hoare triple {1041#(and (< |main_#t~mem4| 2) (<= 0 |main_#t~mem4|) (<= (div (+ (- 1) |main_#t~mem4|) (- 2)) (div (+ (* (- 1) |main_#t~mem4|) 1) 2)))} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {1045#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:58:33,136 INFO L290 TraceCheckUtils]: 26: Hoare triple {1045#(<= 1 |__VERIFIER_assert_#in~cond|)} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1049#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:58:33,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {1049#(<= 1 __VERIFIER_assert_~cond)} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {948#false} is VALID [2022-04-07 16:58:33,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {948#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {948#false} is VALID [2022-04-07 16:58:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:58:33,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:58:33,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-04-07 16:58:34,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 262 [2022-04-07 16:58:34,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {948#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {948#false} is VALID [2022-04-07 16:58:34,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {1049#(<= 1 __VERIFIER_assert_~cond)} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {948#false} is VALID [2022-04-07 16:58:34,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {1045#(<= 1 |__VERIFIER_assert_#in~cond|)} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1049#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:58:34,214 INFO L272 TraceCheckUtils]: 25: Hoare triple {1065#(not (= (mod |main_#t~mem4| 4294967296) 0))} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {1045#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:58:34,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {1069#(or (= (mod main_~index~0 2) 0) (and (or (not (= (mod (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967295) 4294967296) 0)) (not (<= (mod main_~index~0 4294967296) 2147483647))) (or (<= (mod main_~index~0 4294967296) 2147483647) (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) 4294967296) 0)))))} [86] L37-->L40: Formula: (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (let ((.cse0 (mod v_main_~index~0_2 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) |v_main_~#array~0.offset_2|))) (not (= (mod v_main_~index~0_2 2) 0))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {1065#(not (= (mod |main_#t~mem4| 4294967296) 0))} is VALID [2022-04-07 16:58:34,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {1073#(or (= (mod main_~index~0 2) 0) (not (= (mod (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967295) 4294967296) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1069#(or (= (mod main_~index~0 2) 0) (and (or (not (= (mod (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967295) 4294967296) 0)) (not (<= (mod main_~index~0 4294967296) 2147483647))) (or (<= (mod main_~index~0 4294967296) 2147483647) (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) 4294967296) 0)))))} is VALID [2022-04-07 16:58:34,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {1077#(or (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {1073#(or (= (mod main_~index~0 2) 0) (not (= (mod (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967295) 4294967296) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-07 16:58:34,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {1077#(or (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {1077#(or (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} is VALID [2022-04-07 16:58:34,232 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {947#true} {1077#(or (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1077#(or (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} is VALID [2022-04-07 16:58:34,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {947#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 16:58:34,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {947#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 16:58:34,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {947#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {947#true} is VALID [2022-04-07 16:58:34,232 INFO L272 TraceCheckUtils]: 16: Hoare triple {1077#(or (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {947#true} is VALID [2022-04-07 16:58:34,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {1077#(or (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} [85] L37-->L38: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* (let ((.cse0 (mod v_main_~index~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|) (= (mod v_main_~index~0_1 2) 0)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {1077#(or (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} is VALID [2022-04-07 16:58:34,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {1077#(or (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1077#(or (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} is VALID [2022-04-07 16:58:34,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {1105#(not (= (mod (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967295) 4294967296) 0))} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {1077#(or (not (= (mod (* 4294967295 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} is VALID [2022-04-07 16:58:34,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {1105#(not (= (mod (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967295) 4294967296) 0))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {1105#(not (= (mod (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967295) 4294967296) 0))} is VALID [2022-04-07 16:58:34,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {1105#(not (= (mod (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967295) 4294967296) 0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1105#(not (= (mod (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967295) 4294967296) 0))} is VALID [2022-04-07 16:58:34,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {1115#(or (forall ((v_ArrVal_48 Int)) (not (= (mod (* (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_48) (+ |main_~#array~0.offset| 4)) 4294967295) 4294967296) 0))) (not (< (mod main_~index~0 4294967296) 1000)))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1105#(not (= (mod (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967295) 4294967296) 0))} is VALID [2022-04-07 16:58:34,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {1119#(or (forall ((v_ArrVal_48 Int)) (not (= (mod (* 4294967295 (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_48) (+ |main_~#array~0.offset| 4))) 4294967296) 0))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1115#(or (forall ((v_ArrVal_48 Int)) (not (= (mod (* (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_48) (+ |main_~#array~0.offset| 4)) 4294967295) 4294967296) 0))) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-07 16:58:34,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {1123#(or (and (forall ((|main_~#array~0.offset| Int)) (or (= (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) (+ |main_~#array~0.offset| 4)) (= (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (+ |main_~#array~0.offset| 4)))) (forall ((|main_~#array~0.offset| Int)) (not (= (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (+ |main_~#array~0.offset| 4))))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (< (mod main_~index~0 4294967296) 1000)))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1119#(or (forall ((v_ArrVal_48 Int)) (not (= (mod (* 4294967295 (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_48) (+ |main_~#array~0.offset| 4))) 4294967296) 0))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} is VALID [2022-04-07 16:58:34,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {1127#(or (and (forall ((|main_~#array~0.offset| Int)) (not (= (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) (+ |main_~#array~0.offset| 4)))) (forall ((|main_~#array~0.offset| Int)) (or (= (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (+ |main_~#array~0.offset| 4)) (= (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) (+ |main_~#array~0.offset| 4))))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (< (mod (+ 2 main_~index~0) 4294967296) 1000)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1123#(or (and (forall ((|main_~#array~0.offset| Int)) (or (= (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) (+ |main_~#array~0.offset| 4)) (= (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (+ |main_~#array~0.offset| 4)))) (forall ((|main_~#array~0.offset| Int)) (not (= (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (+ |main_~#array~0.offset| 4))))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-07 16:58:34,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {1127#(or (and (forall ((|main_~#array~0.offset| Int)) (not (= (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) (+ |main_~#array~0.offset| 4)))) (forall ((|main_~#array~0.offset| Int)) (or (= (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (+ |main_~#array~0.offset| 4)) (= (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) (+ |main_~#array~0.offset| 4))))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (< (mod (+ 2 main_~index~0) 4294967296) 1000)))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1127#(or (and (forall ((|main_~#array~0.offset| Int)) (not (= (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) (+ |main_~#array~0.offset| 4)))) (forall ((|main_~#array~0.offset| Int)) (or (= (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (+ |main_~#array~0.offset| 4)) (= (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) (+ |main_~#array~0.offset| 4))))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (< (mod (+ 2 main_~index~0) 4294967296) 1000)))} is VALID [2022-04-07 16:58:34,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {947#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {1127#(or (and (forall ((|main_~#array~0.offset| Int)) (not (= (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) (+ |main_~#array~0.offset| 4)))) (forall ((|main_~#array~0.offset| Int)) (or (= (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (+ |main_~#array~0.offset| 4)) (= (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) (+ |main_~#array~0.offset| 4))))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (< (mod (+ 2 main_~index~0) 4294967296) 1000)))} is VALID [2022-04-07 16:58:34,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {947#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 16:58:34,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {947#true} {947#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 16:58:34,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {947#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 16:58:34,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {947#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {947#true} is VALID [2022-04-07 16:58:34,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {947#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 16:58:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:58:34,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928048552] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:58:34,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:58:34,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 13] total 24 [2022-04-07 16:58:34,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167815381] [2022-04-07 16:58:34,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:58:34,248 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 29 [2022-04-07 16:58:34,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:58:34,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 16:58:34,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:58:34,383 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-07 16:58:34,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:58:34,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-07 16:58:34,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2022-04-07 16:58:34,384 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 24 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 16:58:36,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:58:36,106 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-04-07 16:58:36,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-07 16:58:36,106 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 29 [2022-04-07 16:58:36,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:58:36,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 16:58:36,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2022-04-07 16:58:36,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 16:58:36,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2022-04-07 16:58:36,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 60 transitions. [2022-04-07 16:58:36,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:58:36,195 INFO L225 Difference]: With dead ends: 73 [2022-04-07 16:58:36,195 INFO L226 Difference]: Without dead ends: 73 [2022-04-07 16:58:36,196 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=284, Invalid=1438, Unknown=0, NotChecked=0, Total=1722 [2022-04-07 16:58:36,196 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 59 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 219 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:58:36,196 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 97 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 326 Invalid, 0 Unknown, 219 Unchecked, 0.4s Time] [2022-04-07 16:58:36,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-07 16:58:36,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 48. [2022-04-07 16:58:36,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:58:36,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 48 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 16:58:36,209 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 48 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 16:58:36,209 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 48 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 16:58:36,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:58:36,212 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-04-07 16:58:36,213 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-07 16:58:36,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:58:36,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:58:36,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 73 states. [2022-04-07 16:58:36,213 INFO L87 Difference]: Start difference. First operand has 48 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 73 states. [2022-04-07 16:58:36,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:58:36,215 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-04-07 16:58:36,215 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-07 16:58:36,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:58:36,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:58:36,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:58:36,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:58:36,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 16:58:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-04-07 16:58:36,218 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 29 [2022-04-07 16:58:36,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:58:36,218 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-04-07 16:58:36,218 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 16:58:36,218 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-04-07 16:58:36,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-07 16:58:36,219 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:58:36,219 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:58:36,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 16:58:36,419 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:58:36,420 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:58:36,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:58:36,420 INFO L85 PathProgramCache]: Analyzing trace with hash -213422642, now seen corresponding path program 1 times [2022-04-07 16:58:36,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:58:36,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144989895] [2022-04-07 16:58:36,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:58:36,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:58:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:36,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:58:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:36,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {1475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1457#true} is VALID [2022-04-07 16:58:36,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {1457#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1457#true} is VALID [2022-04-07 16:58:36,526 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1457#true} {1457#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1457#true} is VALID [2022-04-07 16:58:36,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-07 16:58:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:36,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {1457#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1457#true} is VALID [2022-04-07 16:58:36,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {1457#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1457#true} is VALID [2022-04-07 16:58:36,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {1457#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1457#true} is VALID [2022-04-07 16:58:36,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1457#true} {1458#false} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1458#false} is VALID [2022-04-07 16:58:36,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-07 16:58:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:36,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {1457#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1457#true} is VALID [2022-04-07 16:58:36,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {1457#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1457#true} is VALID [2022-04-07 16:58:36,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {1457#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1457#true} is VALID [2022-04-07 16:58:36,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1457#true} {1458#false} [102] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {1458#false} is VALID [2022-04-07 16:58:36,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {1457#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:58:36,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {1475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1457#true} is VALID [2022-04-07 16:58:36,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {1457#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1457#true} is VALID [2022-04-07 16:58:36,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1457#true} {1457#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1457#true} is VALID [2022-04-07 16:58:36,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {1457#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1457#true} is VALID [2022-04-07 16:58:36,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {1457#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {1462#(= main_~index~0 0)} is VALID [2022-04-07 16:58:36,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {1462#(= main_~index~0 0)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1462#(= main_~index~0 0)} is VALID [2022-04-07 16:58:36,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {1462#(= main_~index~0 0)} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1463#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-07 16:58:36,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {1463#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1463#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-07 16:58:36,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {1463#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1464#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-07 16:58:36,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {1464#(and (<= main_~index~0 2) (<= 2 main_~index~0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1464#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-07 16:58:36,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {1464#(and (<= main_~index~0 2) (<= 2 main_~index~0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1465#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-07 16:58:36,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {1465#(and (<= 3 main_~index~0) (<= main_~index~0 3))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1465#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-07 16:58:36,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {1465#(and (<= 3 main_~index~0) (<= main_~index~0 3))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1466#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 4))} is VALID [2022-04-07 16:58:36,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {1466#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 4))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {1458#false} is VALID [2022-04-07 16:58:36,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {1458#false} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {1458#false} is VALID [2022-04-07 16:58:36,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {1458#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1458#false} is VALID [2022-04-07 16:58:36,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {1458#false} [85] L37-->L38: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* (let ((.cse0 (mod v_main_~index~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|) (= (mod v_main_~index~0_1 2) 0)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {1458#false} is VALID [2022-04-07 16:58:36,544 INFO L272 TraceCheckUtils]: 18: Hoare triple {1458#false} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1457#true} is VALID [2022-04-07 16:58:36,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {1457#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1457#true} is VALID [2022-04-07 16:58:36,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {1457#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1457#true} is VALID [2022-04-07 16:58:36,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {1457#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1457#true} is VALID [2022-04-07 16:58:36,544 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1457#true} {1458#false} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1458#false} is VALID [2022-04-07 16:58:36,544 INFO L290 TraceCheckUtils]: 23: Hoare triple {1458#false} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {1458#false} is VALID [2022-04-07 16:58:36,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {1458#false} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {1458#false} is VALID [2022-04-07 16:58:36,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {1458#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1458#false} is VALID [2022-04-07 16:58:36,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {1458#false} [86] L37-->L40: Formula: (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (let ((.cse0 (mod v_main_~index~0_2 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) |v_main_~#array~0.offset_2|))) (not (= (mod v_main_~index~0_2 2) 0))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {1458#false} is VALID [2022-04-07 16:58:36,544 INFO L272 TraceCheckUtils]: 27: Hoare triple {1458#false} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {1457#true} is VALID [2022-04-07 16:58:36,545 INFO L290 TraceCheckUtils]: 28: Hoare triple {1457#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1457#true} is VALID [2022-04-07 16:58:36,545 INFO L290 TraceCheckUtils]: 29: Hoare triple {1457#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1457#true} is VALID [2022-04-07 16:58:36,545 INFO L290 TraceCheckUtils]: 30: Hoare triple {1457#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1457#true} is VALID [2022-04-07 16:58:36,545 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1457#true} {1458#false} [102] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {1458#false} is VALID [2022-04-07 16:58:36,546 INFO L290 TraceCheckUtils]: 32: Hoare triple {1458#false} [92] L40-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem4=|v_main_#t~mem4_3|} AuxVars[] AssignedVars[main_#t~mem4] {1458#false} is VALID [2022-04-07 16:58:36,546 INFO L290 TraceCheckUtils]: 33: Hoare triple {1458#false} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {1458#false} is VALID [2022-04-07 16:58:36,546 INFO L290 TraceCheckUtils]: 34: Hoare triple {1458#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1458#false} is VALID [2022-04-07 16:58:36,546 INFO L290 TraceCheckUtils]: 35: Hoare triple {1458#false} [85] L37-->L38: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* (let ((.cse0 (mod v_main_~index~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|) (= (mod v_main_~index~0_1 2) 0)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {1458#false} is VALID [2022-04-07 16:58:36,546 INFO L272 TraceCheckUtils]: 36: Hoare triple {1458#false} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1458#false} is VALID [2022-04-07 16:58:36,546 INFO L290 TraceCheckUtils]: 37: Hoare triple {1458#false} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1458#false} is VALID [2022-04-07 16:58:36,546 INFO L290 TraceCheckUtils]: 38: Hoare triple {1458#false} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1458#false} is VALID [2022-04-07 16:58:36,546 INFO L290 TraceCheckUtils]: 39: Hoare triple {1458#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1458#false} is VALID [2022-04-07 16:58:36,546 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 16:58:36,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:58:36,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144989895] [2022-04-07 16:58:36,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144989895] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:58:36,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160967459] [2022-04-07 16:58:36,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:58:36,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:58:36,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:58:36,548 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 16:58:36,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 16:58:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:36,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-07 16:58:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:36,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:58:36,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-04-07 16:58:36,697 INFO L356 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2022-04-07 16:58:36,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2022-04-07 16:58:36,761 INFO L356 Elim1Store]: treesize reduction 132, result has 19.0 percent of original size [2022-04-07 16:58:36,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 58 [2022-04-07 16:58:36,875 INFO L356 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-04-07 16:58:36,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 44 [2022-04-07 16:58:37,700 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-04-07 16:58:37,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 13 [2022-04-07 16:58:37,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {1457#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1457#true} is VALID [2022-04-07 16:58:37,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {1457#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1457#true} is VALID [2022-04-07 16:58:37,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {1457#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1457#true} is VALID [2022-04-07 16:58:37,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1457#true} {1457#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1457#true} is VALID [2022-04-07 16:58:37,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {1457#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1457#true} is VALID [2022-04-07 16:58:37,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {1457#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {1462#(= main_~index~0 0)} is VALID [2022-04-07 16:58:37,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {1462#(= main_~index~0 0)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1497#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-07 16:58:37,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {1497#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1501#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-07 16:58:37,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {1501#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1505#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)) (= main_~index~0 1))} is VALID [2022-04-07 16:58:37,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {1505#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)) (= main_~index~0 1))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1509#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) (mod main_~index~0 2)))} is VALID [2022-04-07 16:58:37,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {1509#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) (mod main_~index~0 2)))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1513#(and (= 2 main_~index~0) (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) (mod main_~index~0 2)) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-07 16:58:37,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {1513#(and (= 2 main_~index~0) (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) (mod main_~index~0 2)) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1517#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) (mod main_~index~0 2)) (= 2 (+ (- 1) main_~index~0)) (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 4294967293) 4294967296) 4) |main_~#array~0.offset|))))} is VALID [2022-04-07 16:58:37,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {1517#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) (mod main_~index~0 2)) (= 2 (+ (- 1) main_~index~0)) (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 4294967293) 4294967296) 4) |main_~#array~0.offset|))))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1521#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 16:58:37,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {1521#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1521#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 16:58:37,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {1521#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {1521#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 16:58:37,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {1521#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {1531#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 16:58:37,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {1531#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1531#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 16:58:37,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {1531#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [85] L37-->L38: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* (let ((.cse0 (mod v_main_~index~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|) (= (mod v_main_~index~0_1 2) 0)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {1538#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) |main_#t~mem3|) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 16:58:37,766 INFO L272 TraceCheckUtils]: 18: Hoare triple {1538#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) |main_#t~mem3|) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1542#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) |v_main_~#array~0.offset_BEFORE_CALL_5|) 0)))} is VALID [2022-04-07 16:58:37,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {1542#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) |v_main_~#array~0.offset_BEFORE_CALL_5|) 0)))} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1546#(and (exists ((|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) |v_main_~#array~0.offset_BEFORE_CALL_5|) 0))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2022-04-07 16:58:37,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {1546#(and (exists ((|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) |v_main_~#array~0.offset_BEFORE_CALL_5|) 0))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1550#(and (exists ((|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) |v_main_~#array~0.offset_BEFORE_CALL_5|) 0))) (not (= |__VERIFIER_assert_#in~cond| 0)))} is VALID [2022-04-07 16:58:37,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {1550#(and (exists ((|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) |v_main_~#array~0.offset_BEFORE_CALL_5|) 0))) (not (= |__VERIFIER_assert_#in~cond| 0)))} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#(and (exists ((|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) |v_main_~#array~0.offset_BEFORE_CALL_5|) 0))) (not (= |__VERIFIER_assert_#in~cond| 0)))} is VALID [2022-04-07 16:58:37,770 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1550#(and (exists ((|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) |v_main_~#array~0.offset_BEFORE_CALL_5|) 0))) (not (= |__VERIFIER_assert_#in~cond| 0)))} {1538#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) |main_#t~mem3|) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1531#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 16:58:37,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {1531#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {1531#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 16:58:37,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {1531#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {1563#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-07 16:58:37,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {1563#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1563#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-07 16:58:37,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {1563#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} [86] L37-->L40: Formula: (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (let ((.cse0 (mod v_main_~index~0_2 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) |v_main_~#array~0.offset_2|))) (not (= (mod v_main_~index~0_2 2) 0))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {1563#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-07 16:58:37,773 INFO L272 TraceCheckUtils]: 27: Hoare triple {1563#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {1542#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) |v_main_~#array~0.offset_BEFORE_CALL_5|) 0)))} is VALID [2022-04-07 16:58:37,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {1542#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) |v_main_~#array~0.offset_BEFORE_CALL_5|) 0)))} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1542#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) |v_main_~#array~0.offset_BEFORE_CALL_5|) 0)))} is VALID [2022-04-07 16:58:37,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {1542#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) |v_main_~#array~0.offset_BEFORE_CALL_5|) 0)))} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1542#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) |v_main_~#array~0.offset_BEFORE_CALL_5|) 0)))} is VALID [2022-04-07 16:58:37,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {1542#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) |v_main_~#array~0.offset_BEFORE_CALL_5|) 0)))} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1542#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) |v_main_~#array~0.offset_BEFORE_CALL_5|) 0)))} is VALID [2022-04-07 16:58:37,776 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1542#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) |v_main_~#array~0.offset_BEFORE_CALL_5|) 0)))} {1563#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} [102] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {1563#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-07 16:58:37,777 INFO L290 TraceCheckUtils]: 32: Hoare triple {1563#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} [92] L40-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem4=|v_main_#t~mem4_3|} AuxVars[] AssignedVars[main_#t~mem4] {1563#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-07 16:58:37,777 INFO L290 TraceCheckUtils]: 33: Hoare triple {1563#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {1513#(and (= 2 main_~index~0) (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) (mod main_~index~0 2)) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-07 16:58:37,778 INFO L290 TraceCheckUtils]: 34: Hoare triple {1513#(and (= 2 main_~index~0) (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) (mod main_~index~0 2)) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1513#(and (= 2 main_~index~0) (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) (mod main_~index~0 2)) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-07 16:58:37,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {1513#(and (= 2 main_~index~0) (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) (mod main_~index~0 2)) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} [85] L37-->L38: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* (let ((.cse0 (mod v_main_~index~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|) (= (mod v_main_~index~0_1 2) 0)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {1597#(= |main_#t~mem3| 0)} is VALID [2022-04-07 16:58:37,779 INFO L272 TraceCheckUtils]: 36: Hoare triple {1597#(= |main_#t~mem3| 0)} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1601#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:58:37,779 INFO L290 TraceCheckUtils]: 37: Hoare triple {1601#(<= 1 |__VERIFIER_assert_#in~cond|)} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1605#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:58:37,780 INFO L290 TraceCheckUtils]: 38: Hoare triple {1605#(<= 1 __VERIFIER_assert_~cond)} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1458#false} is VALID [2022-04-07 16:58:37,780 INFO L290 TraceCheckUtils]: 39: Hoare triple {1458#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1458#false} is VALID [2022-04-07 16:58:37,780 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 16:58:37,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:58:41,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 180 [2022-04-07 16:58:41,929 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-04-07 16:58:41,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12556 treesize of output 12424 [2022-04-07 16:58:50,018 INFO L290 TraceCheckUtils]: 39: Hoare triple {1458#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1458#false} is VALID [2022-04-07 16:58:50,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {1605#(<= 1 __VERIFIER_assert_~cond)} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1458#false} is VALID [2022-04-07 16:58:50,019 INFO L290 TraceCheckUtils]: 37: Hoare triple {1601#(<= 1 |__VERIFIER_assert_#in~cond|)} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1605#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:58:50,019 INFO L272 TraceCheckUtils]: 36: Hoare triple {1621#(= (mod |main_#t~mem3| 4294967296) 0)} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1601#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:58:50,023 INFO L290 TraceCheckUtils]: 35: Hoare triple {1625#(or (and (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 4294967296) 2147483647))) (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (<= (mod main_~index~0 4294967296) 2147483647))) (not (<= (mod main_~index~0 2) 0)))} [85] L37-->L38: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* (let ((.cse0 (mod v_main_~index~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|) (= (mod v_main_~index~0_1 2) 0)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {1621#(= (mod |main_#t~mem3| 4294967296) 0)} is VALID [2022-04-07 16:58:50,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {1629#(or (<= (div (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1)) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 2) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1625#(or (and (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 4294967296) 2147483647))) (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (<= (mod main_~index~0 4294967296) 2147483647))) (not (<= (mod main_~index~0 2) 0)))} is VALID [2022-04-07 16:58:50,025 INFO L290 TraceCheckUtils]: 33: Hoare triple {1633#(or (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 4294967296) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 1)) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (<= (mod (+ main_~index~0 1) 2) 0)))} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {1629#(or (<= (div (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1)) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 2) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-07 16:58:50,025 INFO L290 TraceCheckUtils]: 32: Hoare triple {1633#(or (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 4294967296) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 1)) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (<= (mod (+ main_~index~0 1) 2) 0)))} [92] L40-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem4=|v_main_#t~mem4_3|} AuxVars[] AssignedVars[main_#t~mem4] {1633#(or (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 4294967296) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 1)) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (<= (mod (+ main_~index~0 1) 2) 0)))} is VALID [2022-04-07 16:58:50,026 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1457#true} {1633#(or (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 4294967296) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 1)) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (<= (mod (+ main_~index~0 1) 2) 0)))} [102] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {1633#(or (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 4294967296) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 1)) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (<= (mod (+ main_~index~0 1) 2) 0)))} is VALID [2022-04-07 16:58:50,026 INFO L290 TraceCheckUtils]: 30: Hoare triple {1457#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1457#true} is VALID [2022-04-07 16:58:50,026 INFO L290 TraceCheckUtils]: 29: Hoare triple {1457#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1457#true} is VALID [2022-04-07 16:58:50,026 INFO L290 TraceCheckUtils]: 28: Hoare triple {1457#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1457#true} is VALID [2022-04-07 16:58:50,026 INFO L272 TraceCheckUtils]: 27: Hoare triple {1633#(or (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 4294967296) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 1)) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (<= (mod (+ main_~index~0 1) 2) 0)))} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {1457#true} is VALID [2022-04-07 16:58:50,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {1633#(or (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 4294967296) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 1)) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (<= (mod (+ main_~index~0 1) 2) 0)))} [86] L37-->L40: Formula: (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (let ((.cse0 (mod v_main_~index~0_2 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) |v_main_~#array~0.offset_2|))) (not (= (mod v_main_~index~0_2 2) 0))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {1633#(or (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 4294967296) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 1)) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (<= (mod (+ main_~index~0 1) 2) 0)))} is VALID [2022-04-07 16:58:50,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {1633#(or (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 4294967296) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 1)) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (<= (mod (+ main_~index~0 1) 2) 0)))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1633#(or (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 4294967296) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 1)) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (<= (mod (+ main_~index~0 1) 2) 0)))} is VALID [2022-04-07 16:58:50,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {1661#(or (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 2) 0)) (not (< (mod (+ 2 main_~index~0) 4294967296) 1000)))} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {1633#(or (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 4294967296) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|))) 4294967296) 1)) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (<= (mod (+ main_~index~0 1) 2) 0)))} is VALID [2022-04-07 16:58:50,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {1661#(or (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 2) 0)) (not (< (mod (+ 2 main_~index~0) 4294967296) 1000)))} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {1661#(or (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 2) 0)) (not (< (mod (+ 2 main_~index~0) 4294967296) 1000)))} is VALID [2022-04-07 16:58:50,042 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1672#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (forall ((|v_main_~#array~0.offset_BEFORE_CALL_8| Int) (|v_main_~#array~0.base_BEFORE_CALL_8| Int) (aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 Int) (aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 Int)) (or (< 0 aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) (< (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) 0) (< aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 0) (<= 1000 (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48)) (<= (div (* (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) (+ |v_main_~#array~0.offset_BEFORE_CALL_8| (* (mod (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) 4294967296) 4)))) (- 4294967296)) (+ (div (+ (- 4294967296) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) (+ |v_main_~#array~0.offset_BEFORE_CALL_8| (* (mod (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) 4294967296) 4)))) 4294967296) 1)))))} {1668#(or (not (= (mod |main_#t~mem3| 4294967296) 0)) (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 2) 0)) (not (< (mod (+ 2 main_~index~0) 4294967296) 1000)))} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1661#(or (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 2) 0)) (not (< (mod (+ 2 main_~index~0) 4294967296) 1000)))} is VALID [2022-04-07 16:58:50,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {1672#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (forall ((|v_main_~#array~0.offset_BEFORE_CALL_8| Int) (|v_main_~#array~0.base_BEFORE_CALL_8| Int) (aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 Int) (aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 Int)) (or (< 0 aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) (< (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) 0) (< aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 0) (<= 1000 (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48)) (<= (div (* (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) (+ |v_main_~#array~0.offset_BEFORE_CALL_8| (* (mod (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) 4294967296) 4)))) (- 4294967296)) (+ (div (+ (- 4294967296) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) (+ |v_main_~#array~0.offset_BEFORE_CALL_8| (* (mod (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) 4294967296) 4)))) 4294967296) 1)))))} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1672#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (forall ((|v_main_~#array~0.offset_BEFORE_CALL_8| Int) (|v_main_~#array~0.base_BEFORE_CALL_8| Int) (aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 Int) (aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 Int)) (or (< 0 aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) (< (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) 0) (< aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 0) (<= 1000 (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48)) (<= (div (* (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) (+ |v_main_~#array~0.offset_BEFORE_CALL_8| (* (mod (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) 4294967296) 4)))) (- 4294967296)) (+ (div (+ (- 4294967296) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) (+ |v_main_~#array~0.offset_BEFORE_CALL_8| (* (mod (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) 4294967296) 4)))) 4294967296) 1)))))} is VALID [2022-04-07 16:58:50,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {1679#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (forall ((|v_main_~#array~0.offset_BEFORE_CALL_8| Int) (|v_main_~#array~0.base_BEFORE_CALL_8| Int) (aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 Int) (aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 Int)) (or (< 0 aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) (< (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) 0) (< aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 0) (<= 1000 (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48)) (<= (div (* (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) (+ |v_main_~#array~0.offset_BEFORE_CALL_8| (* (mod (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) 4294967296) 4)))) (- 4294967296)) (+ (div (+ (- 4294967296) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) (+ |v_main_~#array~0.offset_BEFORE_CALL_8| (* (mod (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) 4294967296) 4)))) 4294967296) 1)))) (= __VERIFIER_assert_~cond 0))} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1672#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (forall ((|v_main_~#array~0.offset_BEFORE_CALL_8| Int) (|v_main_~#array~0.base_BEFORE_CALL_8| Int) (aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 Int) (aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 Int)) (or (< 0 aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) (< (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) 0) (< aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 0) (<= 1000 (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48)) (<= (div (* (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) (+ |v_main_~#array~0.offset_BEFORE_CALL_8| (* (mod (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) 4294967296) 4)))) (- 4294967296)) (+ (div (+ (- 4294967296) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) (+ |v_main_~#array~0.offset_BEFORE_CALL_8| (* (mod (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) 4294967296) 4)))) 4294967296) 1)))))} is VALID [2022-04-07 16:58:50,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {1457#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1679#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (forall ((|v_main_~#array~0.offset_BEFORE_CALL_8| Int) (|v_main_~#array~0.base_BEFORE_CALL_8| Int) (aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 Int) (aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 Int)) (or (< 0 aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) (< (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) 0) (< aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 0) (<= 1000 (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48)) (<= (div (* (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) (+ |v_main_~#array~0.offset_BEFORE_CALL_8| (* (mod (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) 4294967296) 4)))) (- 4294967296)) (+ (div (+ (- 4294967296) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) (+ |v_main_~#array~0.offset_BEFORE_CALL_8| (* (mod (+ (* aux_div_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48 2) aux_mod_aux_mod_v_main_~index~0_BEFORE_CALL_8_52_48) 4294967296) 4)))) 4294967296) 1)))) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 16:58:50,047 INFO L272 TraceCheckUtils]: 18: Hoare triple {1668#(or (not (= (mod |main_#t~mem3| 4294967296) 0)) (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 2) 0)) (not (< (mod (+ 2 main_~index~0) 4294967296) 1000)))} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1457#true} is VALID [2022-04-07 16:58:50,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {1686#(or (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (and (or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)) (<= (mod main_~index~0 4294967296) 2147483647)) (or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)) (not (<= (mod main_~index~0 4294967296) 2147483647)))) (not (<= (mod main_~index~0 2) 0)) (not (< (mod (+ 2 main_~index~0) 4294967296) 1000)))} [85] L37-->L38: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* (let ((.cse0 (mod v_main_~index~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|) (= (mod v_main_~index~0_1 2) 0)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {1668#(or (not (= (mod |main_#t~mem3| 4294967296) 0)) (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 2) 0)) (not (< (mod (+ 2 main_~index~0) 4294967296) 1000)))} is VALID [2022-04-07 16:58:50,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {1690#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)) (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 2) 0)) (not (< (mod (+ 2 main_~index~0) 4294967296) 1000)) (not (< (mod main_~index~0 4294967296) 1000)))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1686#(or (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (and (or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)) (<= (mod main_~index~0 4294967296) 2147483647)) (or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)) (not (<= (mod main_~index~0 4294967296) 2147483647)))) (not (<= (mod main_~index~0 2) 0)) (not (< (mod (+ 2 main_~index~0) 4294967296) 1000)))} is VALID [2022-04-07 16:58:50,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {1694#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)) (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8))) (- 4294967296)) (+ (div (+ (- 4294967296) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8))) 4294967296) 1)))} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {1690#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)) (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 2) 0)) (not (< (mod (+ 2 main_~index~0) 4294967296) 1000)) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-07 16:58:50,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {1694#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)) (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8))) (- 4294967296)) (+ (div (+ (- 4294967296) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8))) 4294967296) 1)))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {1694#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)) (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8))) (- 4294967296)) (+ (div (+ (- 4294967296) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8))) 4294967296) 1)))} is VALID [2022-04-07 16:58:50,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {1694#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)) (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8))) (- 4294967296)) (+ (div (+ (- 4294967296) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8))) 4294967296) 1)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1694#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)) (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8))) (- 4294967296)) (+ (div (+ (- 4294967296) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8))) 4294967296) 1)))} is VALID [2022-04-07 16:58:50,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {1704#(or (forall ((v_ArrVal_76 Int)) (or (<= (div (* (- 1) (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_76) (+ |main_~#array~0.offset| 8))) (- 4294967296)) (+ (div (+ (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_76) (+ |main_~#array~0.offset| 8)) (- 4294967296)) 4294967296) 1)) (not (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0)))) (not (< (mod main_~index~0 4294967296) 1000)))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1694#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)) (<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8))) (- 4294967296)) (+ (div (+ (- 4294967296) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8))) 4294967296) 1)))} is VALID [2022-04-07 16:58:50,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {1708#(or (forall ((v_ArrVal_76 Int)) (or (not (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0)) (<= (div (* (- 1) (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) (+ |main_~#array~0.offset| 8))) (- 4294967296)) (+ (div (+ (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) (+ |main_~#array~0.offset| 8)) (- 4294967296)) 4294967296) 1)))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1704#(or (forall ((v_ArrVal_76 Int)) (or (<= (div (* (- 1) (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_76) (+ |main_~#array~0.offset| 8))) (- 4294967296)) (+ (div (+ (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_76) (+ |main_~#array~0.offset| 8)) (- 4294967296)) 4294967296) 1)) (not (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0)))) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-07 16:58:50,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {1712#(or (forall ((v_ArrVal_76 Int)) (or (<= (div (* (- 1) (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) (mod main_~index~0 2)) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) (+ |main_~#array~0.offset| 8))) (- 4294967296)) (+ (div (+ (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) (mod main_~index~0 2)) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) (+ |main_~#array~0.offset| 8)) (- 4294967296)) 4294967296) 1)) (not (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) (mod main_~index~0 2)) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0)))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (< (mod main_~index~0 4294967296) 1000)))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1708#(or (forall ((v_ArrVal_76 Int)) (or (not (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0)) (<= (div (* (- 1) (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) (+ |main_~#array~0.offset| 8))) (- 4294967296)) (+ (div (+ (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) (+ |main_~#array~0.offset| 8)) (- 4294967296)) 4294967296) 1)))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} is VALID [2022-04-07 16:58:50,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {1716#(or (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (forall ((v_ArrVal_76 Int)) (or (not (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (mod (+ main_~index~0 1) 2)) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0)) (<= (div (* (- 1) (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (mod (+ main_~index~0 1) 2)) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) (+ |main_~#array~0.offset| 8))) (- 4294967296)) (+ (div (+ (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (mod (+ main_~index~0 1) 2)) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) (+ |main_~#array~0.offset| 8)) (- 4294967296)) 4294967296) 1)))) (not (< (mod (+ 2 main_~index~0) 4294967296) 1000)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1712#(or (forall ((v_ArrVal_76 Int)) (or (<= (div (* (- 1) (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) (mod main_~index~0 2)) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) (+ |main_~#array~0.offset| 8))) (- 4294967296)) (+ (div (+ (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) (mod main_~index~0 2)) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) (+ |main_~#array~0.offset| 8)) (- 4294967296)) 4294967296) 1)) (not (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) (mod main_~index~0 2)) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0)))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-07 16:58:50,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {1720#(or (forall ((v_ArrVal_76 Int)) (or (<= (div (* (- 1) (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) (mod main_~index~0 2)) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (mod (+ main_~index~0 1) 2)) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) (+ |main_~#array~0.offset| 8))) (- 4294967296)) (+ (div (+ (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) (mod main_~index~0 2)) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (mod (+ main_~index~0 1) 2)) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) (+ |main_~#array~0.offset| 8)) (- 4294967296)) 4294967296) 1)) (not (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) (mod main_~index~0 2)) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (mod (+ main_~index~0 1) 2)) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0)))) (<= 1000 (mod main_~index~0 4294967296)) (<= 1000 (mod (+ 2 main_~index~0) 4294967296)))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1716#(or (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (forall ((v_ArrVal_76 Int)) (or (not (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (mod (+ main_~index~0 1) 2)) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0)) (<= (div (* (- 1) (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (mod (+ main_~index~0 1) 2)) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) (+ |main_~#array~0.offset| 8))) (- 4294967296)) (+ (div (+ (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (mod (+ main_~index~0 1) 2)) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) (+ |main_~#array~0.offset| 8)) (- 4294967296)) 4294967296) 1)))) (not (< (mod (+ 2 main_~index~0) 4294967296) 1000)))} is VALID [2022-04-07 16:58:50,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {1724#(or (<= 1000 (mod (+ main_~index~0 1) 4294967296)) (<= 1000 (mod (+ 3 main_~index~0) 4294967296)) (forall ((v_ArrVal_76 Int)) (or (not (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (mod (+ main_~index~0 1) 2)) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) (mod main_~index~0 2)) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0)) (<= (div (* (- 1) (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (mod (+ main_~index~0 1) 2)) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) (mod main_~index~0 2)) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_76) (+ |main_~#array~0.offset| 8))) (- 4294967296)) (+ (div (+ (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (mod (+ main_~index~0 1) 2)) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) (mod main_~index~0 2)) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_76) (+ |main_~#array~0.offset| 8)) (- 4294967296)) 4294967296) 1)))))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1720#(or (forall ((v_ArrVal_76 Int)) (or (<= (div (* (- 1) (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) (mod main_~index~0 2)) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (mod (+ main_~index~0 1) 2)) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) (+ |main_~#array~0.offset| 8))) (- 4294967296)) (+ (div (+ (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) (mod main_~index~0 2)) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (mod (+ main_~index~0 1) 2)) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) (+ |main_~#array~0.offset| 8)) (- 4294967296)) 4294967296) 1)) (not (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) (mod main_~index~0 2)) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (mod (+ main_~index~0 1) 2)) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0)))) (<= 1000 (mod main_~index~0 4294967296)) (<= 1000 (mod (+ 2 main_~index~0) 4294967296)))} is VALID [2022-04-07 16:58:50,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {1728#(or (= (* (mod (+ main_~index~0 1) 4294967296) 4) 8) (= (* (mod (+ 2 main_~index~0) 4294967296) 4) 8) (= 8 (* (mod main_~index~0 4294967296) 4)) (<= 1000 (mod main_~index~0 4294967296)) (<= 1000 (mod (+ 3 main_~index~0) 4294967296)))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1724#(or (<= 1000 (mod (+ main_~index~0 1) 4294967296)) (<= 1000 (mod (+ 3 main_~index~0) 4294967296)) (forall ((v_ArrVal_76 Int)) (or (not (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (mod (+ main_~index~0 1) 2)) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) (mod main_~index~0 2)) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0)) (<= (div (* (- 1) (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (mod (+ main_~index~0 1) 2)) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) (mod main_~index~0 2)) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_76) (+ |main_~#array~0.offset| 8))) (- 4294967296)) (+ (div (+ (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (mod (+ main_~index~0 1) 2)) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) (mod main_~index~0 2)) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_76) (+ |main_~#array~0.offset| 8)) (- 4294967296)) 4294967296) 1)))))} is VALID [2022-04-07 16:58:50,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {1457#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {1728#(or (= (* (mod (+ main_~index~0 1) 4294967296) 4) 8) (= (* (mod (+ 2 main_~index~0) 4294967296) 4) 8) (= 8 (* (mod main_~index~0 4294967296) 4)) (<= 1000 (mod main_~index~0 4294967296)) (<= 1000 (mod (+ 3 main_~index~0) 4294967296)))} is VALID [2022-04-07 16:58:50,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {1457#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1457#true} is VALID [2022-04-07 16:58:50,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1457#true} {1457#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1457#true} is VALID [2022-04-07 16:58:50,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {1457#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1457#true} is VALID [2022-04-07 16:58:50,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {1457#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1457#true} is VALID [2022-04-07 16:58:50,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {1457#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1457#true} is VALID [2022-04-07 16:58:50,114 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 16:58:50,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160967459] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:58:50,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:58:50,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19, 22] total 42 [2022-04-07 16:58:50,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521314347] [2022-04-07 16:58:50,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:58:50,116 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 40 states have internal predecessors, (78), 8 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 40 [2022-04-07 16:58:50,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:58:50,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 40 states have internal predecessors, (78), 8 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-07 16:58:50,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:58:50,334 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-07 16:58:50,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:58:50,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-07 16:58:50,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1470, Unknown=0, NotChecked=0, Total=1722 [2022-04-07 16:58:50,336 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 42 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 40 states have internal predecessors, (78), 8 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-07 16:58:55,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:58:55,775 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2022-04-07 16:58:55,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-07 16:58:55,775 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 40 states have internal predecessors, (78), 8 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 40 [2022-04-07 16:58:55,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:58:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 40 states have internal predecessors, (78), 8 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-07 16:58:55,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 71 transitions. [2022-04-07 16:58:55,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 40 states have internal predecessors, (78), 8 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-07 16:58:55,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 71 transitions. [2022-04-07 16:58:55,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 71 transitions. [2022-04-07 16:58:55,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:58:56,000 INFO L225 Difference]: With dead ends: 74 [2022-04-07 16:58:56,000 INFO L226 Difference]: Without dead ends: 74 [2022-04-07 16:58:56,002 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=573, Invalid=4119, Unknown=0, NotChecked=0, Total=4692 [2022-04-07 16:58:56,002 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 54 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 295 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-07 16:58:56,002 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 205 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 288 Invalid, 0 Unknown, 295 Unchecked, 0.5s Time] [2022-04-07 16:58:56,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-07 16:58:56,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2022-04-07 16:58:56,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:58:56,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 72 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 59 states have internal predecessors, (66), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 16:58:56,006 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 72 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 59 states have internal predecessors, (66), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 16:58:56,006 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 72 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 59 states have internal predecessors, (66), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 16:58:56,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:58:56,008 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2022-04-07 16:58:56,008 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2022-04-07 16:58:56,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:58:56,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:58:56,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 59 states have internal predecessors, (66), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 74 states. [2022-04-07 16:58:56,009 INFO L87 Difference]: Start difference. First operand has 72 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 59 states have internal predecessors, (66), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 74 states. [2022-04-07 16:58:56,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:58:56,011 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2022-04-07 16:58:56,011 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2022-04-07 16:58:56,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:58:56,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:58:56,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:58:56,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:58:56,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 59 states have internal predecessors, (66), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 16:58:56,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2022-04-07 16:58:56,013 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 40 [2022-04-07 16:58:56,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:58:56,013 INFO L478 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2022-04-07 16:58:56,013 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 40 states have internal predecessors, (78), 8 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-07 16:58:56,014 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-04-07 16:58:56,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-07 16:58:56,014 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:58:56,014 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:58:56,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 16:58:56,219 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:58:56,219 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:58:56,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:58:56,220 INFO L85 PathProgramCache]: Analyzing trace with hash 768467414, now seen corresponding path program 2 times [2022-04-07 16:58:56,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:58:56,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423070087] [2022-04-07 16:58:56,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:58:56,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:58:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:56,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:58:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:56,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {2123#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2101#true} is VALID [2022-04-07 16:58:56,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {2101#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2101#true} is VALID [2022-04-07 16:58:56,384 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2101#true} {2101#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2101#true} is VALID [2022-04-07 16:58:56,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-07 16:58:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:56,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {2101#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2101#true} is VALID [2022-04-07 16:58:56,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {2101#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2101#true} is VALID [2022-04-07 16:58:56,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {2101#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2101#true} is VALID [2022-04-07 16:58:56,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2101#true} {2102#false} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {2102#false} is VALID [2022-04-07 16:58:56,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-07 16:58:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:56,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {2101#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2101#true} is VALID [2022-04-07 16:58:56,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {2101#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2101#true} is VALID [2022-04-07 16:58:56,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {2101#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2101#true} is VALID [2022-04-07 16:58:56,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2101#true} {2102#false} [102] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {2102#false} is VALID [2022-04-07 16:58:56,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {2101#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2123#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:58:56,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {2123#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2101#true} is VALID [2022-04-07 16:58:56,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {2101#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2101#true} is VALID [2022-04-07 16:58:56,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2101#true} {2101#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2101#true} is VALID [2022-04-07 16:58:56,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {2101#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2101#true} is VALID [2022-04-07 16:58:56,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {2101#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {2106#(= main_~index~0 0)} is VALID [2022-04-07 16:58:56,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {2106#(= main_~index~0 0)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2106#(= main_~index~0 0)} is VALID [2022-04-07 16:58:56,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {2106#(= main_~index~0 0)} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2107#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-07 16:58:56,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {2107#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2107#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-07 16:58:56,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {2107#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2108#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-07 16:58:56,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {2108#(and (<= main_~index~0 2) (<= 2 main_~index~0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2108#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-07 16:58:56,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {2108#(and (<= main_~index~0 2) (<= 2 main_~index~0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2109#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-07 16:58:56,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {2109#(and (<= 3 main_~index~0) (<= main_~index~0 3))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2109#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-07 16:58:56,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {2109#(and (<= 3 main_~index~0) (<= main_~index~0 3))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2110#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-07 16:58:56,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {2110#(and (<= 4 main_~index~0) (<= main_~index~0 4))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2110#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-07 16:58:56,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {2110#(and (<= 4 main_~index~0) (<= main_~index~0 4))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2111#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-07 16:58:56,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {2111#(and (<= 5 main_~index~0) (<= main_~index~0 5))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2111#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-07 16:58:56,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {2111#(and (<= 5 main_~index~0) (<= main_~index~0 5))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2112#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-07 16:58:56,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {2112#(and (<= 6 main_~index~0) (<= main_~index~0 6))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2112#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-07 16:58:56,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {2112#(and (<= 6 main_~index~0) (<= main_~index~0 6))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2113#(and (<= 7 main_~index~0) (<= main_~index~0 7))} is VALID [2022-04-07 16:58:56,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {2113#(and (<= 7 main_~index~0) (<= main_~index~0 7))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2113#(and (<= 7 main_~index~0) (<= main_~index~0 7))} is VALID [2022-04-07 16:58:56,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {2113#(and (<= 7 main_~index~0) (<= main_~index~0 7))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2114#(and (<= main_~index~0 8) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:58:56,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {2114#(and (<= main_~index~0 8) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {2102#false} is VALID [2022-04-07 16:58:56,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {2102#false} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {2102#false} is VALID [2022-04-07 16:58:56,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {2102#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {2102#false} is VALID [2022-04-07 16:58:56,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {2102#false} [85] L37-->L38: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* (let ((.cse0 (mod v_main_~index~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|) (= (mod v_main_~index~0_1 2) 0)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {2102#false} is VALID [2022-04-07 16:58:56,403 INFO L272 TraceCheckUtils]: 26: Hoare triple {2102#false} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {2101#true} is VALID [2022-04-07 16:58:56,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {2101#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2101#true} is VALID [2022-04-07 16:58:56,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {2101#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2101#true} is VALID [2022-04-07 16:58:56,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {2101#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2101#true} is VALID [2022-04-07 16:58:56,404 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2101#true} {2102#false} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {2102#false} is VALID [2022-04-07 16:58:56,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {2102#false} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {2102#false} is VALID [2022-04-07 16:58:56,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {2102#false} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {2102#false} is VALID [2022-04-07 16:58:56,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {2102#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {2102#false} is VALID [2022-04-07 16:58:56,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {2102#false} [86] L37-->L40: Formula: (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (let ((.cse0 (mod v_main_~index~0_2 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) |v_main_~#array~0.offset_2|))) (not (= (mod v_main_~index~0_2 2) 0))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {2102#false} is VALID [2022-04-07 16:58:56,404 INFO L272 TraceCheckUtils]: 35: Hoare triple {2102#false} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {2101#true} is VALID [2022-04-07 16:58:56,404 INFO L290 TraceCheckUtils]: 36: Hoare triple {2101#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2101#true} is VALID [2022-04-07 16:58:56,404 INFO L290 TraceCheckUtils]: 37: Hoare triple {2101#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2101#true} is VALID [2022-04-07 16:58:56,404 INFO L290 TraceCheckUtils]: 38: Hoare triple {2101#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2101#true} is VALID [2022-04-07 16:58:56,404 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2101#true} {2102#false} [102] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {2102#false} is VALID [2022-04-07 16:58:56,404 INFO L290 TraceCheckUtils]: 40: Hoare triple {2102#false} [92] L40-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem4=|v_main_#t~mem4_3|} AuxVars[] AssignedVars[main_#t~mem4] {2102#false} is VALID [2022-04-07 16:58:56,405 INFO L290 TraceCheckUtils]: 41: Hoare triple {2102#false} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {2102#false} is VALID [2022-04-07 16:58:56,405 INFO L290 TraceCheckUtils]: 42: Hoare triple {2102#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {2102#false} is VALID [2022-04-07 16:58:56,405 INFO L290 TraceCheckUtils]: 43: Hoare triple {2102#false} [85] L37-->L38: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* (let ((.cse0 (mod v_main_~index~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|) (= (mod v_main_~index~0_1 2) 0)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {2102#false} is VALID [2022-04-07 16:58:56,405 INFO L272 TraceCheckUtils]: 44: Hoare triple {2102#false} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {2102#false} is VALID [2022-04-07 16:58:56,405 INFO L290 TraceCheckUtils]: 45: Hoare triple {2102#false} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2102#false} is VALID [2022-04-07 16:58:56,405 INFO L290 TraceCheckUtils]: 46: Hoare triple {2102#false} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2102#false} is VALID [2022-04-07 16:58:56,405 INFO L290 TraceCheckUtils]: 47: Hoare triple {2102#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2102#false} is VALID [2022-04-07 16:58:56,406 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 16:58:56,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:58:56,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423070087] [2022-04-07 16:58:56,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423070087] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:58:56,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683098560] [2022-04-07 16:58:56,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 16:58:56,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:58:56,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:58:56,407 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 16:58:56,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-07 16:58:56,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 16:58:56,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 16:58:56,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-07 16:58:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:58:56,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:58:56,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-04-07 16:58:56,615 INFO L356 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2022-04-07 16:58:56,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2022-04-07 16:58:56,698 INFO L356 Elim1Store]: treesize reduction 76, result has 18.3 percent of original size [2022-04-07 16:58:56,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2022-04-07 16:58:56,814 INFO L356 Elim1Store]: treesize reduction 158, result has 16.8 percent of original size [2022-04-07 16:58:56,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 58 [2022-04-07 16:58:56,915 INFO L356 Elim1Store]: treesize reduction 158, result has 16.8 percent of original size [2022-04-07 16:58:56,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 56 [2022-04-07 16:58:57,032 INFO L356 Elim1Store]: treesize reduction 128, result has 16.9 percent of original size [2022-04-07 16:58:57,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 48 [2022-04-07 16:58:57,119 INFO L356 Elim1Store]: treesize reduction 128, result has 16.9 percent of original size [2022-04-07 16:58:57,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 48 [2022-04-07 16:58:57,206 INFO L356 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-04-07 16:58:57,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 44 [2022-04-07 16:58:58,034 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-04-07 16:58:58,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 13 [2022-04-07 16:58:58,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {2101#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2101#true} is VALID [2022-04-07 16:58:58,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {2101#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2101#true} is VALID [2022-04-07 16:58:58,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {2101#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2101#true} is VALID [2022-04-07 16:58:58,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2101#true} {2101#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2101#true} is VALID [2022-04-07 16:58:58,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {2101#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2101#true} is VALID [2022-04-07 16:58:58,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {2101#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {2106#(= main_~index~0 0)} is VALID [2022-04-07 16:58:58,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {2106#(= main_~index~0 0)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2145#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-07 16:58:58,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {2145#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2149#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-07 16:58:58,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {2149#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2153#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)) (= main_~index~0 1))} is VALID [2022-04-07 16:58:58,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {2153#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)) (= main_~index~0 1))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2157#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 16:58:58,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {2157#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2161#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-07 16:58:58,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {2161#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2165#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= 2 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 16:58:58,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {2165#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= 2 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2165#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= 2 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 16:58:58,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {2165#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= 2 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2172#(and (= (+ (- 2) main_~index~0) 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) (mod main_~index~0 2)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 16:58:58,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {2172#(and (= (+ (- 2) main_~index~0) 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) (mod main_~index~0 2)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2172#(and (= (+ (- 2) main_~index~0) 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) (mod main_~index~0 2)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 16:58:58,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {2172#(and (= (+ (- 2) main_~index~0) 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) (mod main_~index~0 2)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2179#(and (= 5 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 16:58:58,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {2179#(and (= 5 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2179#(and (= 5 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 16:58:58,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {2179#(and (= 5 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2186#(and (= 5 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 16:58:58,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {2186#(and (= 5 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2186#(and (= 5 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 16:58:58,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {2186#(and (= 5 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2193#(and (= (+ (- 2) main_~index~0) 5) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 16:58:58,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {2193#(and (= (+ (- 2) main_~index~0) 5) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2197#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 16:58:58,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {2197#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2197#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 16:58:58,108 INFO L290 TraceCheckUtils]: 22: Hoare triple {2197#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {2197#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 16:58:58,112 INFO L290 TraceCheckUtils]: 23: Hoare triple {2197#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {2207#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 16:58:58,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {2207#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {2207#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 16:58:58,113 INFO L290 TraceCheckUtils]: 25: Hoare triple {2207#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [85] L37-->L38: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* (let ((.cse0 (mod v_main_~index~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|) (= (mod v_main_~index~0_1 2) 0)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {2214#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) |main_#t~mem3|) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 16:58:58,114 INFO L272 TraceCheckUtils]: 26: Hoare triple {2214#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) |main_#t~mem3|) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {2218#(exists ((|v_main_~#array~0.base_BEFORE_CALL_9| Int) (|v_main_~#array~0.offset_BEFORE_CALL_9| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) |v_main_~#array~0.offset_BEFORE_CALL_9|) 0)))} is VALID [2022-04-07 16:58:58,115 INFO L290 TraceCheckUtils]: 27: Hoare triple {2218#(exists ((|v_main_~#array~0.base_BEFORE_CALL_9| Int) (|v_main_~#array~0.offset_BEFORE_CALL_9| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) |v_main_~#array~0.offset_BEFORE_CALL_9|) 0)))} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2222#(and (exists ((|v_main_~#array~0.base_BEFORE_CALL_9| Int) (|v_main_~#array~0.offset_BEFORE_CALL_9| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) |v_main_~#array~0.offset_BEFORE_CALL_9|) 0))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2022-04-07 16:58:58,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {2222#(and (exists ((|v_main_~#array~0.base_BEFORE_CALL_9| Int) (|v_main_~#array~0.offset_BEFORE_CALL_9| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) |v_main_~#array~0.offset_BEFORE_CALL_9|) 0))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2226#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#array~0.base_BEFORE_CALL_9| Int) (|v_main_~#array~0.offset_BEFORE_CALL_9| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) |v_main_~#array~0.offset_BEFORE_CALL_9|) 0))))} is VALID [2022-04-07 16:58:58,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {2226#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#array~0.base_BEFORE_CALL_9| Int) (|v_main_~#array~0.offset_BEFORE_CALL_9| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) |v_main_~#array~0.offset_BEFORE_CALL_9|) 0))))} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2226#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#array~0.base_BEFORE_CALL_9| Int) (|v_main_~#array~0.offset_BEFORE_CALL_9| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) |v_main_~#array~0.offset_BEFORE_CALL_9|) 0))))} is VALID [2022-04-07 16:58:58,117 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2226#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#array~0.base_BEFORE_CALL_9| Int) (|v_main_~#array~0.offset_BEFORE_CALL_9| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) |v_main_~#array~0.offset_BEFORE_CALL_9|) 0))))} {2214#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) |main_#t~mem3|) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {2207#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 16:58:58,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {2207#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {2207#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 16:58:58,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {2207#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {2239#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-07 16:58:58,118 INFO L290 TraceCheckUtils]: 33: Hoare triple {2239#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {2239#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-07 16:58:58,119 INFO L290 TraceCheckUtils]: 34: Hoare triple {2239#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} [86] L37-->L40: Formula: (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (let ((.cse0 (mod v_main_~index~0_2 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) |v_main_~#array~0.offset_2|))) (not (= (mod v_main_~index~0_2 2) 0))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {2239#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-07 16:58:58,120 INFO L272 TraceCheckUtils]: 35: Hoare triple {2239#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {2218#(exists ((|v_main_~#array~0.base_BEFORE_CALL_9| Int) (|v_main_~#array~0.offset_BEFORE_CALL_9| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) |v_main_~#array~0.offset_BEFORE_CALL_9|) 0)))} is VALID [2022-04-07 16:58:58,120 INFO L290 TraceCheckUtils]: 36: Hoare triple {2218#(exists ((|v_main_~#array~0.base_BEFORE_CALL_9| Int) (|v_main_~#array~0.offset_BEFORE_CALL_9| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) |v_main_~#array~0.offset_BEFORE_CALL_9|) 0)))} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2218#(exists ((|v_main_~#array~0.base_BEFORE_CALL_9| Int) (|v_main_~#array~0.offset_BEFORE_CALL_9| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) |v_main_~#array~0.offset_BEFORE_CALL_9|) 0)))} is VALID [2022-04-07 16:58:58,121 INFO L290 TraceCheckUtils]: 37: Hoare triple {2218#(exists ((|v_main_~#array~0.base_BEFORE_CALL_9| Int) (|v_main_~#array~0.offset_BEFORE_CALL_9| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) |v_main_~#array~0.offset_BEFORE_CALL_9|) 0)))} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2218#(exists ((|v_main_~#array~0.base_BEFORE_CALL_9| Int) (|v_main_~#array~0.offset_BEFORE_CALL_9| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) |v_main_~#array~0.offset_BEFORE_CALL_9|) 0)))} is VALID [2022-04-07 16:58:58,121 INFO L290 TraceCheckUtils]: 38: Hoare triple {2218#(exists ((|v_main_~#array~0.base_BEFORE_CALL_9| Int) (|v_main_~#array~0.offset_BEFORE_CALL_9| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) |v_main_~#array~0.offset_BEFORE_CALL_9|) 0)))} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2218#(exists ((|v_main_~#array~0.base_BEFORE_CALL_9| Int) (|v_main_~#array~0.offset_BEFORE_CALL_9| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) |v_main_~#array~0.offset_BEFORE_CALL_9|) 0)))} is VALID [2022-04-07 16:58:58,122 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2218#(exists ((|v_main_~#array~0.base_BEFORE_CALL_9| Int) (|v_main_~#array~0.offset_BEFORE_CALL_9| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 4)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) (+ |v_main_~#array~0.offset_BEFORE_CALL_9| 8)) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_9|) |v_main_~#array~0.offset_BEFORE_CALL_9|) 0)))} {2239#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} [102] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {2239#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-07 16:58:58,122 INFO L290 TraceCheckUtils]: 40: Hoare triple {2239#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} [92] L40-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem4=|v_main_#t~mem4_3|} AuxVars[] AssignedVars[main_#t~mem4] {2239#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-07 16:58:58,123 INFO L290 TraceCheckUtils]: 41: Hoare triple {2239#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {2161#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-07 16:58:58,123 INFO L290 TraceCheckUtils]: 42: Hoare triple {2161#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {2161#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-07 16:58:58,124 INFO L290 TraceCheckUtils]: 43: Hoare triple {2161#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} [85] L37-->L38: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* (let ((.cse0 (mod v_main_~index~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|) (= (mod v_main_~index~0_1 2) 0)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {2273#(= |main_#t~mem3| 0)} is VALID [2022-04-07 16:58:58,124 INFO L272 TraceCheckUtils]: 44: Hoare triple {2273#(= |main_#t~mem3| 0)} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {2277#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:58:58,124 INFO L290 TraceCheckUtils]: 45: Hoare triple {2277#(<= 1 |__VERIFIER_assert_#in~cond|)} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2281#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:58:58,125 INFO L290 TraceCheckUtils]: 46: Hoare triple {2281#(<= 1 __VERIFIER_assert_~cond)} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2102#false} is VALID [2022-04-07 16:58:58,125 INFO L290 TraceCheckUtils]: 47: Hoare triple {2102#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2102#false} is VALID [2022-04-07 16:58:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 16:58:58,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:59:26,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 320 treesize of output 314 [2022-04-07 16:59:26,590 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-04-07 16:59:26,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 286221380 treesize of output 286155588 [2022-04-07 17:06:56,293 WARN L232 SmtUtils]: Spent 7.49m on a formula simplification that was a NOOP. DAG size: 2622 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-07 17:07:54,212 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-07 17:07:54,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 17:07:54,416 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:07:54,417 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:635) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-07 17:07:54,420 INFO L158 Benchmark]: Toolchain (without parser) took 582020.58ms. Allocated memory was 201.3MB in the beginning and 758.1MB in the end (delta: 556.8MB). Free memory was 153.4MB in the beginning and 709.2MB in the end (delta: -555.9MB). Peak memory consumption was 451.0MB. Max. memory is 8.0GB. [2022-04-07 17:07:54,420 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 201.3MB. Free memory was 169.6MB in the beginning and 169.4MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 17:07:54,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.38ms. Allocated memory is still 201.3MB. Free memory was 153.1MB in the beginning and 176.9MB in the end (delta: -23.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-07 17:07:54,420 INFO L158 Benchmark]: Boogie Preprocessor took 41.01ms. Allocated memory is still 201.3MB. Free memory was 176.9MB in the beginning and 175.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 17:07:54,420 INFO L158 Benchmark]: RCFGBuilder took 240.15ms. Allocated memory is still 201.3MB. Free memory was 175.3MB in the beginning and 164.1MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-07 17:07:54,421 INFO L158 Benchmark]: IcfgTransformer took 48.34ms. Allocated memory is still 201.3MB. Free memory was 164.1MB in the beginning and 162.3MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 17:07:54,421 INFO L158 Benchmark]: TraceAbstraction took 581469.54ms. Allocated memory was 201.3MB in the beginning and 758.1MB in the end (delta: 556.8MB). Free memory was 162.0MB in the beginning and 709.2MB in the end (delta: -547.2MB). Peak memory consumption was 459.8MB. Max. memory is 8.0GB. [2022-04-07 17:07:54,422 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 201.3MB. Free memory was 169.6MB in the beginning and 169.4MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.38ms. Allocated memory is still 201.3MB. Free memory was 153.1MB in the beginning and 176.9MB in the end (delta: -23.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.01ms. Allocated memory is still 201.3MB. Free memory was 176.9MB in the beginning and 175.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 240.15ms. Allocated memory is still 201.3MB. Free memory was 175.3MB in the beginning and 164.1MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 48.34ms. Allocated memory is still 201.3MB. Free memory was 164.1MB in the beginning and 162.3MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 581469.54ms. Allocated memory was 201.3MB in the beginning and 758.1MB in the end (delta: 556.8MB). Free memory was 162.0MB in the beginning and 709.2MB in the end (delta: -547.2MB). Peak memory consumption was 459.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-07 17:07:54,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...