/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench/hard-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:52:14,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:52:14,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:52:14,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:52:14,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:52:14,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:52:14,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:52:14,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:52:14,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:52:14,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:52:14,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:52:14,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:52:14,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:52:14,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:52:14,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:52:14,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:52:14,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:52:14,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:52:14,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:52:14,189 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:52:14,191 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:52:14,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:52:14,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:52:14,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:52:14,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:52:14,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:52:14,197 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:52:14,197 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:52:14,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:52:14,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:52:14,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:52:14,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:52:14,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:52:14,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:52:14,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:52:14,202 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:52:14,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:52:14,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:52:14,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:52:14,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:52:14,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:52:14,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:52:14,211 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 11:52:14,244 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:52:14,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:52:14,245 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:52:14,245 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:52:14,246 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:52:14,246 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:52:14,247 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:52:14,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:52:14,247 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:52:14,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:52:14,249 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:52:14,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:52:14,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:52:14,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:52:14,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:52:14,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:52:14,249 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:52:14,249 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:52:14,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:52:14,250 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:52:14,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:52:14,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:52:14,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:52:14,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:52:14,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:52:14,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:52:14,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:52:14,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:52:14,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:52:14,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:52:14,251 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:52:14,251 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:52:14,251 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:52:14,252 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 11:52:14,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:52:14,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:52:14,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:52:14,491 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:52:14,493 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:52:14,494 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/hard-ll.c [2022-04-27 11:52:14,548 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5a3be71b/32018918bb8d4e2a87bf822512a11f13/FLAG1090ed286 [2022-04-27 11:52:14,921 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:52:14,922 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/hard-ll.c [2022-04-27 11:52:14,929 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5a3be71b/32018918bb8d4e2a87bf822512a11f13/FLAG1090ed286 [2022-04-27 11:52:15,353 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5a3be71b/32018918bb8d4e2a87bf822512a11f13 [2022-04-27 11:52:15,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:52:15,357 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:52:15,361 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:52:15,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:52:15,364 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:52:15,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:52:15" (1/1) ... [2022-04-27 11:52:15,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4232c5bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:52:15, skipping insertion in model container [2022-04-27 11:52:15,366 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:52:15" (1/1) ... [2022-04-27 11:52:15,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:52:15,400 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:52:15,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/hard-ll.c[538,551] [2022-04-27 11:52:15,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:52:15,579 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:52:15,594 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/hard-ll.c[538,551] [2022-04-27 11:52:15,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:52:15,613 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:52:15,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:52:15 WrapperNode [2022-04-27 11:52:15,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:52:15,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:52:15,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:52:15,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:52:15,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:52:15" (1/1) ... [2022-04-27 11:52:15,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:52:15" (1/1) ... [2022-04-27 11:52:15,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:52:15" (1/1) ... [2022-04-27 11:52:15,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:52:15" (1/1) ... [2022-04-27 11:52:15,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:52:15" (1/1) ... [2022-04-27 11:52:15,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:52:15" (1/1) ... [2022-04-27 11:52:15,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:52:15" (1/1) ... [2022-04-27 11:52:15,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:52:15,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:52:15,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:52:15,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:52:15,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:52:15" (1/1) ... [2022-04-27 11:52:15,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:52:15,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:52:15,683 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-27 11:52:15,685 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-27 11:52:15,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:52:15,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:52:15,715 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:52:15,715 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 11:52:15,716 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:52:15,716 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:52:15,717 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:52:15,717 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:52:15,717 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:52:15,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:52:15,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 11:52:15,718 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 11:52:15,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:52:15,718 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:52:15,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:52:15,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:52:15,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:52:15,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:52:15,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:52:15,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:52:15,768 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:52:15,769 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:52:15,928 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:52:15,934 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:52:15,934 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 11:52:15,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:52:15 BoogieIcfgContainer [2022-04-27 11:52:15,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:52:15,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:52:15,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:52:15,965 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:52:15,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:52:15" (1/3) ... [2022-04-27 11:52:15,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62cd07a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:52:15, skipping insertion in model container [2022-04-27 11:52:15,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:52:15" (2/3) ... [2022-04-27 11:52:15,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62cd07a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:52:15, skipping insertion in model container [2022-04-27 11:52:15,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:52:15" (3/3) ... [2022-04-27 11:52:15,968 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-ll.c [2022-04-27 11:52:15,982 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:52:15,982 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:52:16,024 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:52:16,031 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5e3bfacd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@478aeeef [2022-04-27 11:52:16,031 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:52:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 11:52:16,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:52:16,045 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:52:16,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:52:16,046 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:52:16,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:52:16,052 INFO L85 PathProgramCache]: Analyzing trace with hash -977830905, now seen corresponding path program 1 times [2022-04-27 11:52:16,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:52:16,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146020011] [2022-04-27 11:52:16,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:16,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:52:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:16,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:52:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:16,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38#true} is VALID [2022-04-27 11:52:16,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-27 11:52:16,205 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #94#return; {38#true} is VALID [2022-04-27 11:52:16,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:52:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:16,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-27 11:52:16,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-27 11:52:16,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-27 11:52:16,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} #78#return; {39#false} is VALID [2022-04-27 11:52:16,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:52:16,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38#true} is VALID [2022-04-27 11:52:16,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-27 11:52:16,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #94#return; {38#true} is VALID [2022-04-27 11:52:16,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret6 := main(); {38#true} is VALID [2022-04-27 11:52:16,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {38#true} is VALID [2022-04-27 11:52:16,240 INFO L272 TraceCheckUtils]: 6: Hoare triple {38#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {38#true} is VALID [2022-04-27 11:52:16,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-27 11:52:16,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-27 11:52:16,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-27 11:52:16,241 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {39#false} {38#true} #78#return; {39#false} is VALID [2022-04-27 11:52:16,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#false} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {39#false} is VALID [2022-04-27 11:52:16,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-27 11:52:16,242 INFO L272 TraceCheckUtils]: 13: Hoare triple {39#false} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {39#false} is VALID [2022-04-27 11:52:16,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2022-04-27 11:52:16,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2022-04-27 11:52:16,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-27 11:52:16,243 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-27 11:52:16,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:52:16,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146020011] [2022-04-27 11:52:16,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146020011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:52:16,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:52:16,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:52:16,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143010686] [2022-04-27 11:52:16,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:52:16,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 11:52:16,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:52:16,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:52:16,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:16,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:52:16,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:52:16,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:52:16,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:52:16,328 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:52:16,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:16,546 INFO L93 Difference]: Finished difference Result 61 states and 95 transitions. [2022-04-27 11:52:16,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:52:16,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 11:52:16,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:52:16,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:52:16,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-27 11:52:16,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:52:16,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-27 11:52:16,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-27 11:52:16,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:16,716 INFO L225 Difference]: With dead ends: 61 [2022-04-27 11:52:16,716 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 11:52:16,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-27 11:52:16,725 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:52:16,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:52:16,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 11:52:16,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 11:52:16,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:52:16,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:52:16,768 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:52:16,769 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:52:16,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:16,774 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-27 11:52:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-27 11:52:16,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:16,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:16,776 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 30 states. [2022-04-27 11:52:16,777 INFO L87 Difference]: Start difference. First operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 30 states. [2022-04-27 11:52:16,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:16,784 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-27 11:52:16,785 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-27 11:52:16,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:16,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:16,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:52:16,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:52:16,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:52:16,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-04-27 11:52:16,801 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2022-04-27 11:52:16,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:52:16,801 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-04-27 11:52:16,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:52:16,802 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-27 11:52:16,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:52:16,803 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:52:16,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:52:16,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:52:16,803 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:52:16,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:52:16,806 INFO L85 PathProgramCache]: Analyzing trace with hash -297772535, now seen corresponding path program 1 times [2022-04-27 11:52:16,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:52:16,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889949063] [2022-04-27 11:52:16,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:16,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:52:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:16,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:52:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:16,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {240#true} is VALID [2022-04-27 11:52:16,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#true} assume true; {240#true} is VALID [2022-04-27 11:52:16,931 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {240#true} {240#true} #94#return; {240#true} is VALID [2022-04-27 11:52:16,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:52:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:16,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#true} ~cond := #in~cond; {240#true} is VALID [2022-04-27 11:52:16,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#true} assume !(0 == ~cond); {240#true} is VALID [2022-04-27 11:52:16,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {240#true} assume true; {240#true} is VALID [2022-04-27 11:52:16,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {240#true} {240#true} #78#return; {240#true} is VALID [2022-04-27 11:52:16,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {240#true} call ULTIMATE.init(); {252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:52:16,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {240#true} is VALID [2022-04-27 11:52:16,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {240#true} assume true; {240#true} is VALID [2022-04-27 11:52:16,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {240#true} {240#true} #94#return; {240#true} is VALID [2022-04-27 11:52:16,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {240#true} call #t~ret6 := main(); {240#true} is VALID [2022-04-27 11:52:16,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {240#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {240#true} is VALID [2022-04-27 11:52:16,946 INFO L272 TraceCheckUtils]: 6: Hoare triple {240#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {240#true} is VALID [2022-04-27 11:52:16,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#true} ~cond := #in~cond; {240#true} is VALID [2022-04-27 11:52:16,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {240#true} assume !(0 == ~cond); {240#true} is VALID [2022-04-27 11:52:16,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {240#true} assume true; {240#true} is VALID [2022-04-27 11:52:16,946 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {240#true} {240#true} #78#return; {240#true} is VALID [2022-04-27 11:52:16,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {240#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {249#(= main_~q~0 0)} is VALID [2022-04-27 11:52:16,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {249#(= main_~q~0 0)} assume !false; {249#(= main_~q~0 0)} is VALID [2022-04-27 11:52:16,948 INFO L272 TraceCheckUtils]: 13: Hoare triple {249#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {250#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:52:16,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {250#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {251#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:52:16,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {251#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {241#false} is VALID [2022-04-27 11:52:16,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {241#false} assume !false; {241#false} is VALID [2022-04-27 11:52:16,949 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-27 11:52:16,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:52:16,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889949063] [2022-04-27 11:52:16,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889949063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:52:16,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:52:16,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 11:52:16,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291420344] [2022-04-27 11:52:16,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:52:16,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 11:52:16,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:52:16,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:52:16,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:16,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:52:16,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:52:16,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:52:16,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:52:16,983 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:52:17,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:17,444 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2022-04-27 11:52:17,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:52:17,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 11:52:17,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:52:17,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:52:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-27 11:52:17,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:52:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-27 11:52:17,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-27 11:52:17,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:17,525 INFO L225 Difference]: With dead ends: 43 [2022-04-27 11:52:17,525 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 11:52:17,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:52:17,531 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 37 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:52:17,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 45 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:52:17,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 11:52:17,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-04-27 11:52:17,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:52:17,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:52:17,544 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:52:17,545 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:52:17,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:17,553 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-27 11:52:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-27 11:52:17,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:17,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:17,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 41 states. [2022-04-27 11:52:17,563 INFO L87 Difference]: Start difference. First operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 41 states. [2022-04-27 11:52:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:17,568 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-27 11:52:17,568 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-27 11:52:17,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:17,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:17,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:52:17,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:52:17,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:52:17,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-04-27 11:52:17,571 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2022-04-27 11:52:17,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:52:17,571 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-04-27 11:52:17,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:52:17,573 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-27 11:52:17,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 11:52:17,574 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:52:17,574 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:52:17,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:52:17,574 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:52:17,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:52:17,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1294462534, now seen corresponding path program 1 times [2022-04-27 11:52:17,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:52:17,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714402585] [2022-04-27 11:52:17,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:17,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:52:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:17,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:52:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:17,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {458#true} is VALID [2022-04-27 11:52:17,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-27 11:52:17,703 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {458#true} {458#true} #94#return; {458#true} is VALID [2022-04-27 11:52:17,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:52:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:17,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {458#true} ~cond := #in~cond; {458#true} is VALID [2022-04-27 11:52:17,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} assume !(0 == ~cond); {458#true} is VALID [2022-04-27 11:52:17,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-27 11:52:17,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} #78#return; {458#true} is VALID [2022-04-27 11:52:17,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 11:52:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:17,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {458#true} ~cond := #in~cond; {458#true} is VALID [2022-04-27 11:52:17,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} assume !(0 == ~cond); {458#true} is VALID [2022-04-27 11:52:17,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-27 11:52:17,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {467#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} #80#return; {467#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-27 11:52:17,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {458#true} call ULTIMATE.init(); {474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:52:17,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {458#true} is VALID [2022-04-27 11:52:17,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-27 11:52:17,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} #94#return; {458#true} is VALID [2022-04-27 11:52:17,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {458#true} call #t~ret6 := main(); {458#true} is VALID [2022-04-27 11:52:17,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {458#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {458#true} is VALID [2022-04-27 11:52:17,719 INFO L272 TraceCheckUtils]: 6: Hoare triple {458#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {458#true} is VALID [2022-04-27 11:52:17,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {458#true} ~cond := #in~cond; {458#true} is VALID [2022-04-27 11:52:17,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {458#true} assume !(0 == ~cond); {458#true} is VALID [2022-04-27 11:52:17,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-27 11:52:17,720 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {458#true} {458#true} #78#return; {458#true} is VALID [2022-04-27 11:52:17,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {467#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-27 11:52:17,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {467#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} assume !false; {467#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-27 11:52:17,721 INFO L272 TraceCheckUtils]: 13: Hoare triple {467#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {458#true} is VALID [2022-04-27 11:52:17,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#true} ~cond := #in~cond; {458#true} is VALID [2022-04-27 11:52:17,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {458#true} assume !(0 == ~cond); {458#true} is VALID [2022-04-27 11:52:17,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-27 11:52:17,722 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {458#true} {467#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} #80#return; {467#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-27 11:52:17,724 INFO L272 TraceCheckUtils]: 18: Hoare triple {467#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {472#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:52:17,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {472#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {473#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:52:17,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {473#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {459#false} is VALID [2022-04-27 11:52:17,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {459#false} assume !false; {459#false} is VALID [2022-04-27 11:52:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:52:17,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:52:17,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714402585] [2022-04-27 11:52:17,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714402585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:52:17,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:52:17,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 11:52:17,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856011095] [2022-04-27 11:52:17,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:52:17,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 11:52:17,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:52:17,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:52:17,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:17,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:52:17,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:52:17,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:52:17,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:52:17,746 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:52:18,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:18,236 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-27 11:52:18,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:52:18,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 11:52:18,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:52:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:52:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-27 11:52:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:52:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-27 11:52:18,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-27 11:52:18,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:18,304 INFO L225 Difference]: With dead ends: 47 [2022-04-27 11:52:18,304 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 11:52:18,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:52:18,305 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 32 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:52:18,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 45 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:52:18,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 11:52:18,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2022-04-27 11:52:18,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:52:18,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:52:18,313 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:52:18,314 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:52:18,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:18,316 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-27 11:52:18,316 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-27 11:52:18,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:18,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:18,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-27 11:52:18,317 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-27 11:52:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:18,320 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-27 11:52:18,320 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-27 11:52:18,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:18,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:18,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:52:18,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:52:18,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:52:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-04-27 11:52:18,322 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 22 [2022-04-27 11:52:18,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:52:18,323 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-04-27 11:52:18,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:52:18,323 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-27 11:52:18,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 11:52:18,323 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:52:18,324 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:52:18,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 11:52:18,324 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:52:18,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:52:18,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1449027479, now seen corresponding path program 1 times [2022-04-27 11:52:18,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:52:18,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909419861] [2022-04-27 11:52:18,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:18,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:52:18,337 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:52:18,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [560415119] [2022-04-27 11:52:18,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:18,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:52:18,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:52:18,348 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-27 11:52:18,358 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-27 11:52:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:18,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 11:52:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:18,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:52:18,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {698#true} call ULTIMATE.init(); {698#true} is VALID [2022-04-27 11:52:18,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {698#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {698#true} is VALID [2022-04-27 11:52:18,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {698#true} assume true; {698#true} is VALID [2022-04-27 11:52:18,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {698#true} {698#true} #94#return; {698#true} is VALID [2022-04-27 11:52:18,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {698#true} call #t~ret6 := main(); {698#true} is VALID [2022-04-27 11:52:18,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {698#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {698#true} is VALID [2022-04-27 11:52:18,654 INFO L272 TraceCheckUtils]: 6: Hoare triple {698#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {698#true} is VALID [2022-04-27 11:52:18,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {698#true} ~cond := #in~cond; {698#true} is VALID [2022-04-27 11:52:18,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {698#true} assume !(0 == ~cond); {698#true} is VALID [2022-04-27 11:52:18,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {698#true} assume true; {698#true} is VALID [2022-04-27 11:52:18,655 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {698#true} {698#true} #78#return; {698#true} is VALID [2022-04-27 11:52:18,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {698#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {736#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 11:52:18,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {736#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !false; {736#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 11:52:18,664 INFO L272 TraceCheckUtils]: 13: Hoare triple {736#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {698#true} is VALID [2022-04-27 11:52:18,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {698#true} ~cond := #in~cond; {698#true} is VALID [2022-04-27 11:52:18,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {698#true} assume !(0 == ~cond); {698#true} is VALID [2022-04-27 11:52:18,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {698#true} assume true; {698#true} is VALID [2022-04-27 11:52:18,665 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {698#true} {736#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #80#return; {736#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 11:52:18,665 INFO L272 TraceCheckUtils]: 18: Hoare triple {736#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {698#true} is VALID [2022-04-27 11:52:18,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {698#true} ~cond := #in~cond; {698#true} is VALID [2022-04-27 11:52:18,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {698#true} assume !(0 == ~cond); {698#true} is VALID [2022-04-27 11:52:18,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {698#true} assume true; {698#true} is VALID [2022-04-27 11:52:18,667 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {698#true} {736#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #82#return; {736#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 11:52:18,668 INFO L272 TraceCheckUtils]: 23: Hoare triple {736#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {773#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:52:18,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {773#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {777#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:52:18,669 INFO L290 TraceCheckUtils]: 25: Hoare triple {777#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {699#false} is VALID [2022-04-27 11:52:18,669 INFO L290 TraceCheckUtils]: 26: Hoare triple {699#false} assume !false; {699#false} is VALID [2022-04-27 11:52:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:52:18,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:52:18,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:52:18,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909419861] [2022-04-27 11:52:18,670 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:52:18,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560415119] [2022-04-27 11:52:18,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560415119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:52:18,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:52:18,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:52:18,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147471261] [2022-04-27 11:52:18,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:52:18,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 11:52:18,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:52:18,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:52:18,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:18,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:52:18,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:52:18,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:52:18,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:52:18,698 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:52:18,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:18,913 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-27 11:52:18,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:52:18,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 11:52:18,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:52:18,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:52:18,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-27 11:52:18,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:52:18,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-27 11:52:18,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2022-04-27 11:52:18,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:18,982 INFO L225 Difference]: With dead ends: 66 [2022-04-27 11:52:18,982 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 11:52:18,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:52:18,983 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:52:18,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 127 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:52:18,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 11:52:18,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-27 11:52:18,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:52:18,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 11:52:18,993 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 11:52:18,993 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 11:52:18,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:18,996 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-04-27 11:52:18,996 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-04-27 11:52:18,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:18,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:18,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 52 states. [2022-04-27 11:52:18,997 INFO L87 Difference]: Start difference. First operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 52 states. [2022-04-27 11:52:18,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:18,999 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-04-27 11:52:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-04-27 11:52:18,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:18,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:19,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:52:19,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:52:19,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 11:52:19,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2022-04-27 11:52:19,002 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 27 [2022-04-27 11:52:19,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:52:19,002 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2022-04-27 11:52:19,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:52:19,003 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-04-27 11:52:19,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 11:52:19,003 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:52:19,004 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:52:19,031 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-27 11:52:19,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:52:19,225 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:52:19,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:52:19,225 INFO L85 PathProgramCache]: Analyzing trace with hash 905213191, now seen corresponding path program 1 times [2022-04-27 11:52:19,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:52:19,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050255201] [2022-04-27 11:52:19,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:19,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:52:19,239 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:52:19,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1849762628] [2022-04-27 11:52:19,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:19,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:52:19,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:52:19,240 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-27 11:52:19,264 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-27 11:52:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:19,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 11:52:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:19,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:52:19,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {1063#true} call ULTIMATE.init(); {1063#true} is VALID [2022-04-27 11:52:19,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {1063#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1063#true} is VALID [2022-04-27 11:52:19,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {1063#true} assume true; {1063#true} is VALID [2022-04-27 11:52:19,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1063#true} {1063#true} #94#return; {1063#true} is VALID [2022-04-27 11:52:19,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {1063#true} call #t~ret6 := main(); {1063#true} is VALID [2022-04-27 11:52:19,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {1063#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1063#true} is VALID [2022-04-27 11:52:19,895 INFO L272 TraceCheckUtils]: 6: Hoare triple {1063#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1063#true} is VALID [2022-04-27 11:52:19,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {1063#true} ~cond := #in~cond; {1063#true} is VALID [2022-04-27 11:52:19,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {1063#true} assume !(0 == ~cond); {1063#true} is VALID [2022-04-27 11:52:19,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {1063#true} assume true; {1063#true} is VALID [2022-04-27 11:52:19,895 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1063#true} {1063#true} #78#return; {1063#true} is VALID [2022-04-27 11:52:19,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {1063#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {1101#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 11:52:19,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {1101#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !false; {1101#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 11:52:19,905 INFO L272 TraceCheckUtils]: 13: Hoare triple {1101#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1063#true} is VALID [2022-04-27 11:52:19,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {1063#true} ~cond := #in~cond; {1063#true} is VALID [2022-04-27 11:52:19,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {1063#true} assume !(0 == ~cond); {1063#true} is VALID [2022-04-27 11:52:19,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {1063#true} assume true; {1063#true} is VALID [2022-04-27 11:52:19,906 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1063#true} {1101#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #80#return; {1101#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 11:52:19,906 INFO L272 TraceCheckUtils]: 18: Hoare triple {1101#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {1063#true} is VALID [2022-04-27 11:52:19,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {1063#true} ~cond := #in~cond; {1063#true} is VALID [2022-04-27 11:52:19,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {1063#true} assume !(0 == ~cond); {1063#true} is VALID [2022-04-27 11:52:19,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {1063#true} assume true; {1063#true} is VALID [2022-04-27 11:52:19,907 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1063#true} {1101#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #82#return; {1101#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 11:52:19,907 INFO L272 TraceCheckUtils]: 23: Hoare triple {1101#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {1063#true} is VALID [2022-04-27 11:52:19,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {1063#true} ~cond := #in~cond; {1063#true} is VALID [2022-04-27 11:52:19,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {1063#true} assume !(0 == ~cond); {1063#true} is VALID [2022-04-27 11:52:19,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {1063#true} assume true; {1063#true} is VALID [2022-04-27 11:52:19,908 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1063#true} {1101#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #84#return; {1101#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 11:52:19,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {1101#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {1153#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 11:52:19,910 INFO L290 TraceCheckUtils]: 29: Hoare triple {1153#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !false; {1153#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 11:52:19,911 INFO L272 TraceCheckUtils]: 30: Hoare triple {1153#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {1160#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:52:19,911 INFO L290 TraceCheckUtils]: 31: Hoare triple {1160#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1164#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:52:19,912 INFO L290 TraceCheckUtils]: 32: Hoare triple {1164#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1064#false} is VALID [2022-04-27 11:52:19,912 INFO L290 TraceCheckUtils]: 33: Hoare triple {1064#false} assume !false; {1064#false} is VALID [2022-04-27 11:52:19,912 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 11:52:19,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:52:19,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:52:19,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050255201] [2022-04-27 11:52:19,913 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:52:19,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849762628] [2022-04-27 11:52:19,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849762628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:52:19,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:52:19,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 11:52:19,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040578201] [2022-04-27 11:52:19,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:52:19,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 11:52:19,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:52:19,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 11:52:19,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:19,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:52:19,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:52:19,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:52:19,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:52:19,941 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 11:52:20,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:20,258 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-04-27 11:52:20,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:52:20,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 11:52:20,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:52:20,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 11:52:20,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-04-27 11:52:20,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 11:52:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-04-27 11:52:20,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2022-04-27 11:52:20,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:20,323 INFO L225 Difference]: With dead ends: 66 [2022-04-27 11:52:20,324 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 11:52:20,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 11:52:20,325 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 9 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:52:20,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 138 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:52:20,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 11:52:20,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-27 11:52:20,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:52:20,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 11:52:20,336 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 11:52:20,336 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 11:52:20,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:20,341 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-04-27 11:52:20,341 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-04-27 11:52:20,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:20,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:20,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 55 states. [2022-04-27 11:52:20,342 INFO L87 Difference]: Start difference. First operand has 55 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 55 states. [2022-04-27 11:52:20,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:20,344 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-04-27 11:52:20,344 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-04-27 11:52:20,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:20,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:20,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:52:20,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:52:20,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 11:52:20,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-04-27 11:52:20,346 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 34 [2022-04-27 11:52:20,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:52:20,346 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-04-27 11:52:20,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 11:52:20,347 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-04-27 11:52:20,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 11:52:20,347 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:52:20,348 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:52:20,372 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-27 11:52:20,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:52:20,548 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:52:20,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:52:20,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1576096488, now seen corresponding path program 1 times [2022-04-27 11:52:20,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:52:20,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295457331] [2022-04-27 11:52:20,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:20,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:52:20,563 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:52:20,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [660108690] [2022-04-27 11:52:20,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:20,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:52:20,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:52:20,564 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-27 11:52:20,575 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-27 11:52:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:20,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 11:52:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:20,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:52:21,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {1457#true} call ULTIMATE.init(); {1457#true} is VALID [2022-04-27 11:52:21,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {1457#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1457#true} is VALID [2022-04-27 11:52:21,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {1457#true} assume true; {1457#true} is VALID [2022-04-27 11:52:21,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1457#true} {1457#true} #94#return; {1457#true} is VALID [2022-04-27 11:52:21,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {1457#true} call #t~ret6 := main(); {1457#true} is VALID [2022-04-27 11:52:21,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {1457#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1457#true} is VALID [2022-04-27 11:52:21,519 INFO L272 TraceCheckUtils]: 6: Hoare triple {1457#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1457#true} is VALID [2022-04-27 11:52:21,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {1457#true} ~cond := #in~cond; {1483#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:52:21,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {1483#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1487#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:52:21,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {1487#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1487#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:52:21,521 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1487#(not (= |assume_abort_if_not_#in~cond| 0))} {1457#true} #78#return; {1494#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-27 11:52:21,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {1494#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {1498#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 11:52:21,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {1498#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !false; {1498#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 11:52:21,522 INFO L272 TraceCheckUtils]: 13: Hoare triple {1498#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1457#true} is VALID [2022-04-27 11:52:21,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {1457#true} ~cond := #in~cond; {1457#true} is VALID [2022-04-27 11:52:21,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {1457#true} assume !(0 == ~cond); {1457#true} is VALID [2022-04-27 11:52:21,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {1457#true} assume true; {1457#true} is VALID [2022-04-27 11:52:21,528 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1457#true} {1498#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #80#return; {1498#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 11:52:21,528 INFO L272 TraceCheckUtils]: 18: Hoare triple {1498#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {1457#true} is VALID [2022-04-27 11:52:21,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {1457#true} ~cond := #in~cond; {1457#true} is VALID [2022-04-27 11:52:21,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {1457#true} assume !(0 == ~cond); {1457#true} is VALID [2022-04-27 11:52:21,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {1457#true} assume true; {1457#true} is VALID [2022-04-27 11:52:21,531 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1457#true} {1498#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #82#return; {1498#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 11:52:21,531 INFO L272 TraceCheckUtils]: 23: Hoare triple {1498#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {1457#true} is VALID [2022-04-27 11:52:21,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {1457#true} ~cond := #in~cond; {1457#true} is VALID [2022-04-27 11:52:21,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {1457#true} assume !(0 == ~cond); {1457#true} is VALID [2022-04-27 11:52:21,531 INFO L290 TraceCheckUtils]: 26: Hoare triple {1457#true} assume true; {1457#true} is VALID [2022-04-27 11:52:21,532 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1457#true} {1498#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #84#return; {1498#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 11:52:21,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {1498#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {1550#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 11:52:21,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {1550#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} assume !false; {1550#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 11:52:21,534 INFO L272 TraceCheckUtils]: 30: Hoare triple {1550#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1457#true} is VALID [2022-04-27 11:52:21,534 INFO L290 TraceCheckUtils]: 31: Hoare triple {1457#true} ~cond := #in~cond; {1457#true} is VALID [2022-04-27 11:52:21,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {1457#true} assume !(0 == ~cond); {1457#true} is VALID [2022-04-27 11:52:21,535 INFO L290 TraceCheckUtils]: 33: Hoare triple {1457#true} assume true; {1457#true} is VALID [2022-04-27 11:52:21,536 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1457#true} {1550#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #80#return; {1550#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 11:52:21,537 INFO L272 TraceCheckUtils]: 35: Hoare triple {1550#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {1457#true} is VALID [2022-04-27 11:52:21,538 INFO L290 TraceCheckUtils]: 36: Hoare triple {1457#true} ~cond := #in~cond; {1457#true} is VALID [2022-04-27 11:52:21,538 INFO L290 TraceCheckUtils]: 37: Hoare triple {1457#true} assume !(0 == ~cond); {1457#true} is VALID [2022-04-27 11:52:21,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {1457#true} assume true; {1457#true} is VALID [2022-04-27 11:52:21,542 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1457#true} {1550#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #82#return; {1550#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 11:52:21,543 INFO L272 TraceCheckUtils]: 40: Hoare triple {1550#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {1587#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:52:21,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {1587#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1591#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:52:21,544 INFO L290 TraceCheckUtils]: 42: Hoare triple {1591#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1458#false} is VALID [2022-04-27 11:52:21,545 INFO L290 TraceCheckUtils]: 43: Hoare triple {1458#false} assume !false; {1458#false} is VALID [2022-04-27 11:52:21,545 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 11:52:21,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:52:21,985 INFO L290 TraceCheckUtils]: 43: Hoare triple {1458#false} assume !false; {1458#false} is VALID [2022-04-27 11:52:21,986 INFO L290 TraceCheckUtils]: 42: Hoare triple {1591#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1458#false} is VALID [2022-04-27 11:52:21,986 INFO L290 TraceCheckUtils]: 41: Hoare triple {1587#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1591#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:52:21,987 INFO L272 TraceCheckUtils]: 40: Hoare triple {1607#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {1587#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:52:21,988 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1457#true} {1607#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #82#return; {1607#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 11:52:21,988 INFO L290 TraceCheckUtils]: 38: Hoare triple {1457#true} assume true; {1457#true} is VALID [2022-04-27 11:52:21,988 INFO L290 TraceCheckUtils]: 37: Hoare triple {1457#true} assume !(0 == ~cond); {1457#true} is VALID [2022-04-27 11:52:21,988 INFO L290 TraceCheckUtils]: 36: Hoare triple {1457#true} ~cond := #in~cond; {1457#true} is VALID [2022-04-27 11:52:21,988 INFO L272 TraceCheckUtils]: 35: Hoare triple {1607#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {1457#true} is VALID [2022-04-27 11:52:21,989 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1457#true} {1607#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #80#return; {1607#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 11:52:21,989 INFO L290 TraceCheckUtils]: 33: Hoare triple {1457#true} assume true; {1457#true} is VALID [2022-04-27 11:52:21,989 INFO L290 TraceCheckUtils]: 32: Hoare triple {1457#true} assume !(0 == ~cond); {1457#true} is VALID [2022-04-27 11:52:21,989 INFO L290 TraceCheckUtils]: 31: Hoare triple {1457#true} ~cond := #in~cond; {1457#true} is VALID [2022-04-27 11:52:21,989 INFO L272 TraceCheckUtils]: 30: Hoare triple {1607#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1457#true} is VALID [2022-04-27 11:52:21,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {1607#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !false; {1607#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 11:52:21,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {1607#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {1607#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 11:52:21,998 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1457#true} {1607#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #84#return; {1607#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 11:52:21,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {1457#true} assume true; {1457#true} is VALID [2022-04-27 11:52:21,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {1457#true} assume !(0 == ~cond); {1457#true} is VALID [2022-04-27 11:52:21,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {1457#true} ~cond := #in~cond; {1457#true} is VALID [2022-04-27 11:52:21,998 INFO L272 TraceCheckUtils]: 23: Hoare triple {1607#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {1457#true} is VALID [2022-04-27 11:52:21,999 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1457#true} {1607#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #82#return; {1607#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 11:52:21,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {1457#true} assume true; {1457#true} is VALID [2022-04-27 11:52:21,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {1457#true} assume !(0 == ~cond); {1457#true} is VALID [2022-04-27 11:52:21,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {1457#true} ~cond := #in~cond; {1457#true} is VALID [2022-04-27 11:52:21,999 INFO L272 TraceCheckUtils]: 18: Hoare triple {1607#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {1457#true} is VALID [2022-04-27 11:52:22,000 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1457#true} {1607#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #80#return; {1607#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 11:52:22,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {1457#true} assume true; {1457#true} is VALID [2022-04-27 11:52:22,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {1457#true} assume !(0 == ~cond); {1457#true} is VALID [2022-04-27 11:52:22,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {1457#true} ~cond := #in~cond; {1457#true} is VALID [2022-04-27 11:52:22,000 INFO L272 TraceCheckUtils]: 13: Hoare triple {1607#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1457#true} is VALID [2022-04-27 11:52:22,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {1607#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !false; {1607#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 11:52:22,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {1457#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {1607#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 11:52:22,001 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1457#true} {1457#true} #78#return; {1457#true} is VALID [2022-04-27 11:52:22,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {1457#true} assume true; {1457#true} is VALID [2022-04-27 11:52:22,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {1457#true} assume !(0 == ~cond); {1457#true} is VALID [2022-04-27 11:52:22,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {1457#true} ~cond := #in~cond; {1457#true} is VALID [2022-04-27 11:52:22,001 INFO L272 TraceCheckUtils]: 6: Hoare triple {1457#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1457#true} is VALID [2022-04-27 11:52:22,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {1457#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1457#true} is VALID [2022-04-27 11:52:22,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {1457#true} call #t~ret6 := main(); {1457#true} is VALID [2022-04-27 11:52:22,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1457#true} {1457#true} #94#return; {1457#true} is VALID [2022-04-27 11:52:22,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {1457#true} assume true; {1457#true} is VALID [2022-04-27 11:52:22,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {1457#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1457#true} is VALID [2022-04-27 11:52:22,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {1457#true} call ULTIMATE.init(); {1457#true} is VALID [2022-04-27 11:52:22,002 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-27 11:52:22,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:52:22,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295457331] [2022-04-27 11:52:22,003 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:52:22,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660108690] [2022-04-27 11:52:22,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660108690] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:52:22,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:52:22,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-27 11:52:22,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423934292] [2022-04-27 11:52:22,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:52:22,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-04-27 11:52:22,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:52:22,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 11:52:22,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:22,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:52:22,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:52:22,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:52:22,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:52:22,036 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 11:52:22,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:22,297 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2022-04-27 11:52:22,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:52:22,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-04-27 11:52:22,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:52:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 11:52:22,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-27 11:52:22,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 11:52:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-27 11:52:22,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-27 11:52:22,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:22,372 INFO L225 Difference]: With dead ends: 67 [2022-04-27 11:52:22,373 INFO L226 Difference]: Without dead ends: 65 [2022-04-27 11:52:22,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:52:22,374 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 8 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:52:22,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 111 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:52:22,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-27 11:52:22,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2022-04-27 11:52:22,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:52:22,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 62 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 15 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 11:52:22,396 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 62 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 15 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 11:52:22,396 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 62 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 15 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 11:52:22,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:22,399 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-04-27 11:52:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2022-04-27 11:52:22,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:22,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:22,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 15 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 65 states. [2022-04-27 11:52:22,400 INFO L87 Difference]: Start difference. First operand has 62 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 15 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 65 states. [2022-04-27 11:52:22,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:22,402 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-04-27 11:52:22,402 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2022-04-27 11:52:22,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:22,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:22,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:52:22,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:52:22,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 15 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 11:52:22,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-04-27 11:52:22,405 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 44 [2022-04-27 11:52:22,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:52:22,405 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-04-27 11:52:22,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 11:52:22,405 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-04-27 11:52:22,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-27 11:52:22,406 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:52:22,412 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:52:22,443 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-27 11:52:22,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:52:22,628 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:52:22,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:52:22,628 INFO L85 PathProgramCache]: Analyzing trace with hash -212431496, now seen corresponding path program 1 times [2022-04-27 11:52:22,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:52:22,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135000335] [2022-04-27 11:52:22,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:22,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:52:22,644 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:52:22,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [366643538] [2022-04-27 11:52:22,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:22,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:52:22,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:52:22,652 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-27 11:52:22,652 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-27 11:52:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:22,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 11:52:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:22,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:52:28,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {2047#true} call ULTIMATE.init(); {2047#true} is VALID [2022-04-27 11:52:28,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {2047#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2047#true} is VALID [2022-04-27 11:52:28,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-27 11:52:28,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2047#true} {2047#true} #94#return; {2047#true} is VALID [2022-04-27 11:52:28,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {2047#true} call #t~ret6 := main(); {2047#true} is VALID [2022-04-27 11:52:28,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {2047#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2047#true} is VALID [2022-04-27 11:52:28,246 INFO L272 TraceCheckUtils]: 6: Hoare triple {2047#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2047#true} is VALID [2022-04-27 11:52:28,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {2047#true} ~cond := #in~cond; {2047#true} is VALID [2022-04-27 11:52:28,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {2047#true} assume !(0 == ~cond); {2047#true} is VALID [2022-04-27 11:52:28,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-27 11:52:28,246 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2047#true} {2047#true} #78#return; {2047#true} is VALID [2022-04-27 11:52:28,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {2047#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {2085#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 11:52:28,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {2085#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !false; {2085#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 11:52:28,247 INFO L272 TraceCheckUtils]: 13: Hoare triple {2085#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2047#true} is VALID [2022-04-27 11:52:28,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {2047#true} ~cond := #in~cond; {2047#true} is VALID [2022-04-27 11:52:28,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {2047#true} assume !(0 == ~cond); {2047#true} is VALID [2022-04-27 11:52:28,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-27 11:52:28,248 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2047#true} {2085#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #80#return; {2085#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 11:52:28,249 INFO L272 TraceCheckUtils]: 18: Hoare triple {2085#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2047#true} is VALID [2022-04-27 11:52:28,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {2047#true} ~cond := #in~cond; {2047#true} is VALID [2022-04-27 11:52:28,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {2047#true} assume !(0 == ~cond); {2047#true} is VALID [2022-04-27 11:52:28,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-27 11:52:28,250 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2047#true} {2085#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #82#return; {2085#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 11:52:28,250 INFO L272 TraceCheckUtils]: 23: Hoare triple {2085#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2047#true} is VALID [2022-04-27 11:52:28,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {2047#true} ~cond := #in~cond; {2047#true} is VALID [2022-04-27 11:52:28,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {2047#true} assume !(0 == ~cond); {2047#true} is VALID [2022-04-27 11:52:28,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-27 11:52:28,251 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2047#true} {2085#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #84#return; {2085#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 11:52:28,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {2085#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2137#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 11:52:28,253 INFO L290 TraceCheckUtils]: 29: Hoare triple {2137#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} assume !false; {2137#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 11:52:28,253 INFO L272 TraceCheckUtils]: 30: Hoare triple {2137#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2047#true} is VALID [2022-04-27 11:52:28,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {2047#true} ~cond := #in~cond; {2047#true} is VALID [2022-04-27 11:52:28,253 INFO L290 TraceCheckUtils]: 32: Hoare triple {2047#true} assume !(0 == ~cond); {2047#true} is VALID [2022-04-27 11:52:28,253 INFO L290 TraceCheckUtils]: 33: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-27 11:52:28,254 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2047#true} {2137#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} #80#return; {2137#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 11:52:28,254 INFO L272 TraceCheckUtils]: 35: Hoare triple {2137#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2047#true} is VALID [2022-04-27 11:52:28,254 INFO L290 TraceCheckUtils]: 36: Hoare triple {2047#true} ~cond := #in~cond; {2047#true} is VALID [2022-04-27 11:52:28,254 INFO L290 TraceCheckUtils]: 37: Hoare triple {2047#true} assume !(0 == ~cond); {2047#true} is VALID [2022-04-27 11:52:28,254 INFO L290 TraceCheckUtils]: 38: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-27 11:52:28,255 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2047#true} {2137#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} #82#return; {2137#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 11:52:28,255 INFO L272 TraceCheckUtils]: 40: Hoare triple {2137#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2047#true} is VALID [2022-04-27 11:52:28,255 INFO L290 TraceCheckUtils]: 41: Hoare triple {2047#true} ~cond := #in~cond; {2047#true} is VALID [2022-04-27 11:52:28,255 INFO L290 TraceCheckUtils]: 42: Hoare triple {2047#true} assume !(0 == ~cond); {2047#true} is VALID [2022-04-27 11:52:28,255 INFO L290 TraceCheckUtils]: 43: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-27 11:52:28,256 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2047#true} {2137#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} #84#return; {2137#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 11:52:28,258 INFO L290 TraceCheckUtils]: 45: Hoare triple {2137#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} assume !(~r~0 >= ~d~0); {2189#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (mod main_~B~0 4294967296) 1)) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~r~0 1)) (= main_~q~0 0))} is VALID [2022-04-27 11:52:28,259 INFO L290 TraceCheckUtils]: 46: Hoare triple {2189#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (mod main_~B~0 4294967296) 1)) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~r~0 1)) (= main_~q~0 0))} assume !false; {2189#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (mod main_~B~0 4294967296) 1)) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~r~0 1)) (= main_~q~0 0))} is VALID [2022-04-27 11:52:28,260 INFO L272 TraceCheckUtils]: 47: Hoare triple {2189#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (mod main_~B~0 4294967296) 1)) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~r~0 1)) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {2196#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:52:28,260 INFO L290 TraceCheckUtils]: 48: Hoare triple {2196#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2200#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:52:28,261 INFO L290 TraceCheckUtils]: 49: Hoare triple {2200#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2048#false} is VALID [2022-04-27 11:52:28,261 INFO L290 TraceCheckUtils]: 50: Hoare triple {2048#false} assume !false; {2048#false} is VALID [2022-04-27 11:52:28,261 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 11:52:28,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:52:28,687 INFO L290 TraceCheckUtils]: 50: Hoare triple {2048#false} assume !false; {2048#false} is VALID [2022-04-27 11:52:28,688 INFO L290 TraceCheckUtils]: 49: Hoare triple {2200#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2048#false} is VALID [2022-04-27 11:52:28,688 INFO L290 TraceCheckUtils]: 48: Hoare triple {2196#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2200#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:52:28,689 INFO L272 TraceCheckUtils]: 47: Hoare triple {2216#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {2196#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:52:28,689 INFO L290 TraceCheckUtils]: 46: Hoare triple {2216#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} assume !false; {2216#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-27 11:52:28,690 INFO L290 TraceCheckUtils]: 45: Hoare triple {2223#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} assume !(~r~0 >= ~d~0); {2216#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-27 11:52:28,690 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2047#true} {2223#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} #84#return; {2223#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 11:52:28,690 INFO L290 TraceCheckUtils]: 43: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-27 11:52:28,691 INFO L290 TraceCheckUtils]: 42: Hoare triple {2047#true} assume !(0 == ~cond); {2047#true} is VALID [2022-04-27 11:52:28,691 INFO L290 TraceCheckUtils]: 41: Hoare triple {2047#true} ~cond := #in~cond; {2047#true} is VALID [2022-04-27 11:52:28,691 INFO L272 TraceCheckUtils]: 40: Hoare triple {2223#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2047#true} is VALID [2022-04-27 11:52:28,691 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2047#true} {2223#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} #82#return; {2223#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 11:52:28,691 INFO L290 TraceCheckUtils]: 38: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-27 11:52:28,691 INFO L290 TraceCheckUtils]: 37: Hoare triple {2047#true} assume !(0 == ~cond); {2047#true} is VALID [2022-04-27 11:52:28,692 INFO L290 TraceCheckUtils]: 36: Hoare triple {2047#true} ~cond := #in~cond; {2047#true} is VALID [2022-04-27 11:52:28,692 INFO L272 TraceCheckUtils]: 35: Hoare triple {2223#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2047#true} is VALID [2022-04-27 11:52:28,692 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2047#true} {2223#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} #80#return; {2223#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 11:52:28,692 INFO L290 TraceCheckUtils]: 33: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-27 11:52:28,692 INFO L290 TraceCheckUtils]: 32: Hoare triple {2047#true} assume !(0 == ~cond); {2047#true} is VALID [2022-04-27 11:52:28,692 INFO L290 TraceCheckUtils]: 31: Hoare triple {2047#true} ~cond := #in~cond; {2047#true} is VALID [2022-04-27 11:52:28,693 INFO L272 TraceCheckUtils]: 30: Hoare triple {2223#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2047#true} is VALID [2022-04-27 11:52:28,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {2223#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} assume !false; {2223#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 11:52:28,694 INFO L290 TraceCheckUtils]: 28: Hoare triple {2275#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2223#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 11:52:28,694 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2047#true} {2275#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} #84#return; {2275#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-27 11:52:28,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-27 11:52:28,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {2047#true} assume !(0 == ~cond); {2047#true} is VALID [2022-04-27 11:52:28,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {2047#true} ~cond := #in~cond; {2047#true} is VALID [2022-04-27 11:52:28,695 INFO L272 TraceCheckUtils]: 23: Hoare triple {2275#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2047#true} is VALID [2022-04-27 11:52:28,695 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2047#true} {2275#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} #82#return; {2275#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-27 11:52:28,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-27 11:52:28,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {2047#true} assume !(0 == ~cond); {2047#true} is VALID [2022-04-27 11:52:28,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {2047#true} ~cond := #in~cond; {2047#true} is VALID [2022-04-27 11:52:28,696 INFO L272 TraceCheckUtils]: 18: Hoare triple {2275#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2047#true} is VALID [2022-04-27 11:52:28,696 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2047#true} {2275#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} #80#return; {2275#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-27 11:52:28,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-27 11:52:28,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {2047#true} assume !(0 == ~cond); {2047#true} is VALID [2022-04-27 11:52:28,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {2047#true} ~cond := #in~cond; {2047#true} is VALID [2022-04-27 11:52:28,697 INFO L272 TraceCheckUtils]: 13: Hoare triple {2275#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2047#true} is VALID [2022-04-27 11:52:28,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {2275#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} assume !false; {2275#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-27 11:52:28,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {2047#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {2275#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-27 11:52:28,698 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2047#true} {2047#true} #78#return; {2047#true} is VALID [2022-04-27 11:52:28,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-27 11:52:28,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {2047#true} assume !(0 == ~cond); {2047#true} is VALID [2022-04-27 11:52:28,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {2047#true} ~cond := #in~cond; {2047#true} is VALID [2022-04-27 11:52:28,698 INFO L272 TraceCheckUtils]: 6: Hoare triple {2047#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2047#true} is VALID [2022-04-27 11:52:28,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {2047#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2047#true} is VALID [2022-04-27 11:52:28,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {2047#true} call #t~ret6 := main(); {2047#true} is VALID [2022-04-27 11:52:28,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2047#true} {2047#true} #94#return; {2047#true} is VALID [2022-04-27 11:52:28,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-27 11:52:28,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {2047#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2047#true} is VALID [2022-04-27 11:52:28,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {2047#true} call ULTIMATE.init(); {2047#true} is VALID [2022-04-27 11:52:28,699 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 11:52:28,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:52:28,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135000335] [2022-04-27 11:52:28,699 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:52:28,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366643538] [2022-04-27 11:52:28,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366643538] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:52:28,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:52:28,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-27 11:52:28,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848327737] [2022-04-27 11:52:28,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:52:28,702 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 51 [2022-04-27 11:52:28,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:52:28,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 11:52:28,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:28,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 11:52:28,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:52:28,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 11:52:28,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:52:28,768 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 11:52:32,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:32,664 INFO L93 Difference]: Finished difference Result 107 states and 133 transitions. [2022-04-27 11:52:32,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 11:52:32,664 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 51 [2022-04-27 11:52:32,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:52:32,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 11:52:32,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2022-04-27 11:52:32,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 11:52:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2022-04-27 11:52:32,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 104 transitions. [2022-04-27 11:52:32,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:32,781 INFO L225 Difference]: With dead ends: 107 [2022-04-27 11:52:32,781 INFO L226 Difference]: Without dead ends: 105 [2022-04-27 11:52:32,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:52:32,782 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 28 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:52:32,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 204 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-27 11:52:32,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-27 11:52:32,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2022-04-27 11:52:32,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:52:32,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 93 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 59 states have internal predecessors, (64), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 11:52:32,825 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 93 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 59 states have internal predecessors, (64), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 11:52:32,826 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 93 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 59 states have internal predecessors, (64), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 11:52:32,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:32,830 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2022-04-27 11:52:32,830 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2022-04-27 11:52:32,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:32,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:32,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 59 states have internal predecessors, (64), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 105 states. [2022-04-27 11:52:32,832 INFO L87 Difference]: Start difference. First operand has 93 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 59 states have internal predecessors, (64), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 105 states. [2022-04-27 11:52:32,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:32,836 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2022-04-27 11:52:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2022-04-27 11:52:32,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:32,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:32,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:52:32,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:52:32,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 59 states have internal predecessors, (64), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 11:52:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2022-04-27 11:52:32,841 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 51 [2022-04-27 11:52:32,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:52:32,841 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2022-04-27 11:52:32,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 11:52:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2022-04-27 11:52:32,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-27 11:52:32,843 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:52:32,843 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:52:32,868 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-27 11:52:33,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:52:33,059 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:52:33,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:52:33,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1615471943, now seen corresponding path program 1 times [2022-04-27 11:52:33,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:52:33,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244374573] [2022-04-27 11:52:33,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:33,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:52:33,071 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:52:33,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [673391117] [2022-04-27 11:52:33,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:33,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:52:33,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:52:33,083 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-27 11:52:33,105 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-27 11:52:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:33,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-27 11:52:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:33,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:52:41,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {2869#true} call ULTIMATE.init(); {2869#true} is VALID [2022-04-27 11:52:41,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {2869#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2869#true} is VALID [2022-04-27 11:52:41,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {2869#true} assume true; {2869#true} is VALID [2022-04-27 11:52:41,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2869#true} {2869#true} #94#return; {2869#true} is VALID [2022-04-27 11:52:41,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {2869#true} call #t~ret6 := main(); {2869#true} is VALID [2022-04-27 11:52:41,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {2869#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2869#true} is VALID [2022-04-27 11:52:41,005 INFO L272 TraceCheckUtils]: 6: Hoare triple {2869#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2869#true} is VALID [2022-04-27 11:52:41,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {2869#true} ~cond := #in~cond; {2869#true} is VALID [2022-04-27 11:52:41,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {2869#true} assume !(0 == ~cond); {2869#true} is VALID [2022-04-27 11:52:41,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {2869#true} assume true; {2869#true} is VALID [2022-04-27 11:52:41,005 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2869#true} {2869#true} #78#return; {2869#true} is VALID [2022-04-27 11:52:41,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {2869#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {2907#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 11:52:41,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {2907#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {2907#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 11:52:41,018 INFO L272 TraceCheckUtils]: 13: Hoare triple {2907#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2869#true} is VALID [2022-04-27 11:52:41,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {2869#true} ~cond := #in~cond; {2869#true} is VALID [2022-04-27 11:52:41,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {2869#true} assume !(0 == ~cond); {2869#true} is VALID [2022-04-27 11:52:41,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {2869#true} assume true; {2869#true} is VALID [2022-04-27 11:52:41,019 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2869#true} {2907#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #80#return; {2907#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 11:52:41,019 INFO L272 TraceCheckUtils]: 18: Hoare triple {2907#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2869#true} is VALID [2022-04-27 11:52:41,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {2869#true} ~cond := #in~cond; {2869#true} is VALID [2022-04-27 11:52:41,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {2869#true} assume !(0 == ~cond); {2869#true} is VALID [2022-04-27 11:52:41,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {2869#true} assume true; {2869#true} is VALID [2022-04-27 11:52:41,020 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2869#true} {2907#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #82#return; {2907#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 11:52:41,020 INFO L272 TraceCheckUtils]: 23: Hoare triple {2907#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2869#true} is VALID [2022-04-27 11:52:41,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {2869#true} ~cond := #in~cond; {2869#true} is VALID [2022-04-27 11:52:41,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {2869#true} assume !(0 == ~cond); {2869#true} is VALID [2022-04-27 11:52:41,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {2869#true} assume true; {2869#true} is VALID [2022-04-27 11:52:41,022 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2869#true} {2907#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #84#return; {2907#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 11:52:41,023 INFO L290 TraceCheckUtils]: 28: Hoare triple {2907#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2959#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 11:52:41,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {2959#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !false; {2959#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 11:52:41,024 INFO L272 TraceCheckUtils]: 30: Hoare triple {2959#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2869#true} is VALID [2022-04-27 11:52:41,024 INFO L290 TraceCheckUtils]: 31: Hoare triple {2869#true} ~cond := #in~cond; {2869#true} is VALID [2022-04-27 11:52:41,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {2869#true} assume !(0 == ~cond); {2869#true} is VALID [2022-04-27 11:52:41,025 INFO L290 TraceCheckUtils]: 33: Hoare triple {2869#true} assume true; {2869#true} is VALID [2022-04-27 11:52:41,025 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2869#true} {2959#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #80#return; {2959#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 11:52:41,025 INFO L272 TraceCheckUtils]: 35: Hoare triple {2959#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2869#true} is VALID [2022-04-27 11:52:41,026 INFO L290 TraceCheckUtils]: 36: Hoare triple {2869#true} ~cond := #in~cond; {2869#true} is VALID [2022-04-27 11:52:41,026 INFO L290 TraceCheckUtils]: 37: Hoare triple {2869#true} assume !(0 == ~cond); {2869#true} is VALID [2022-04-27 11:52:41,026 INFO L290 TraceCheckUtils]: 38: Hoare triple {2869#true} assume true; {2869#true} is VALID [2022-04-27 11:52:41,028 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2869#true} {2959#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #82#return; {2959#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 11:52:41,028 INFO L272 TraceCheckUtils]: 40: Hoare triple {2959#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2869#true} is VALID [2022-04-27 11:52:41,028 INFO L290 TraceCheckUtils]: 41: Hoare triple {2869#true} ~cond := #in~cond; {2869#true} is VALID [2022-04-27 11:52:41,028 INFO L290 TraceCheckUtils]: 42: Hoare triple {2869#true} assume !(0 == ~cond); {2869#true} is VALID [2022-04-27 11:52:41,029 INFO L290 TraceCheckUtils]: 43: Hoare triple {2869#true} assume true; {2869#true} is VALID [2022-04-27 11:52:41,034 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2869#true} {2959#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #84#return; {2959#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 11:52:41,035 INFO L290 TraceCheckUtils]: 45: Hoare triple {2959#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !(~r~0 >= ~d~0); {3011#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 11:52:41,037 INFO L290 TraceCheckUtils]: 46: Hoare triple {3011#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !false; {3011#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 11:52:41,037 INFO L272 TraceCheckUtils]: 47: Hoare triple {3011#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {2869#true} is VALID [2022-04-27 11:52:41,037 INFO L290 TraceCheckUtils]: 48: Hoare triple {2869#true} ~cond := #in~cond; {2869#true} is VALID [2022-04-27 11:52:41,037 INFO L290 TraceCheckUtils]: 49: Hoare triple {2869#true} assume !(0 == ~cond); {2869#true} is VALID [2022-04-27 11:52:41,037 INFO L290 TraceCheckUtils]: 50: Hoare triple {2869#true} assume true; {2869#true} is VALID [2022-04-27 11:52:41,040 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2869#true} {3011#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #86#return; {3011#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 11:52:41,041 INFO L272 TraceCheckUtils]: 52: Hoare triple {3011#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2869#true} is VALID [2022-04-27 11:52:41,041 INFO L290 TraceCheckUtils]: 53: Hoare triple {2869#true} ~cond := #in~cond; {3036#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:52:41,041 INFO L290 TraceCheckUtils]: 54: Hoare triple {3036#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3040#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:52:41,042 INFO L290 TraceCheckUtils]: 55: Hoare triple {3040#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3040#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:52:41,043 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3040#(not (= |__VERIFIER_assert_#in~cond| 0))} {3011#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #88#return; {3047#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 11:52:41,044 INFO L290 TraceCheckUtils]: 57: Hoare triple {3047#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {3051#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (* 2 (mod main_~B~0 4294967296))) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0) (= main_~p~0 1))} is VALID [2022-04-27 11:52:41,046 INFO L290 TraceCheckUtils]: 58: Hoare triple {3051#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (* 2 (mod main_~B~0 4294967296))) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {3055#(and (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296)) main_~r~0) (= main_~q~0 1) (< (mod main_~A~0 4294967296) (* 2 (mod main_~B~0 4294967296))))} is VALID [2022-04-27 11:52:41,064 INFO L290 TraceCheckUtils]: 59: Hoare triple {3055#(and (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296)) main_~r~0) (= main_~q~0 1) (< (mod main_~A~0 4294967296) (* 2 (mod main_~B~0 4294967296))))} assume !false; {3055#(and (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296)) main_~r~0) (= main_~q~0 1) (< (mod main_~A~0 4294967296) (* 2 (mod main_~B~0 4294967296))))} is VALID [2022-04-27 11:52:41,065 INFO L272 TraceCheckUtils]: 60: Hoare triple {3055#(and (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296)) main_~r~0) (= main_~q~0 1) (< (mod main_~A~0 4294967296) (* 2 (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {3062#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:52:41,066 INFO L290 TraceCheckUtils]: 61: Hoare triple {3062#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3066#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:52:41,066 INFO L290 TraceCheckUtils]: 62: Hoare triple {3066#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2870#false} is VALID [2022-04-27 11:52:41,066 INFO L290 TraceCheckUtils]: 63: Hoare triple {2870#false} assume !false; {2870#false} is VALID [2022-04-27 11:52:41,066 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 36 proven. 8 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-27 11:52:41,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:53:20,609 WARN L232 SmtUtils]: Spent 18.58s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:54:59,512 WARN L232 SmtUtils]: Spent 24.28s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:56:06,652 INFO L290 TraceCheckUtils]: 63: Hoare triple {2870#false} assume !false; {2870#false} is VALID [2022-04-27 11:56:06,652 INFO L290 TraceCheckUtils]: 62: Hoare triple {3066#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2870#false} is VALID [2022-04-27 11:56:06,653 INFO L290 TraceCheckUtils]: 61: Hoare triple {3062#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3066#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:06,653 INFO L272 TraceCheckUtils]: 60: Hoare triple {3082#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {3062#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:06,654 INFO L290 TraceCheckUtils]: 59: Hoare triple {3082#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} assume !false; {3082#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-27 11:56:06,656 INFO L290 TraceCheckUtils]: 58: Hoare triple {3089#(= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) main_~r~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {3082#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-27 11:56:06,665 INFO L290 TraceCheckUtils]: 57: Hoare triple {3093#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {3089#(= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) main_~r~0))} is VALID [2022-04-27 11:56:06,668 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3040#(not (= |__VERIFIER_assert_#in~cond| 0))} {3097#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} #88#return; {3093#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-27 11:56:06,668 INFO L290 TraceCheckUtils]: 55: Hoare triple {3040#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3040#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:56:06,669 INFO L290 TraceCheckUtils]: 54: Hoare triple {3107#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3040#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:56:06,669 INFO L290 TraceCheckUtils]: 53: Hoare triple {2869#true} ~cond := #in~cond; {3107#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:56:06,670 INFO L272 TraceCheckUtils]: 52: Hoare triple {3097#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2869#true} is VALID [2022-04-27 11:56:06,671 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2869#true} {3097#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} #86#return; {3097#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} is VALID [2022-04-27 11:56:06,671 INFO L290 TraceCheckUtils]: 50: Hoare triple {2869#true} assume true; {2869#true} is VALID [2022-04-27 11:56:06,671 INFO L290 TraceCheckUtils]: 49: Hoare triple {2869#true} assume !(0 == ~cond); {2869#true} is VALID [2022-04-27 11:56:06,671 INFO L290 TraceCheckUtils]: 48: Hoare triple {2869#true} ~cond := #in~cond; {2869#true} is VALID [2022-04-27 11:56:06,671 INFO L272 TraceCheckUtils]: 47: Hoare triple {3097#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {2869#true} is VALID [2022-04-27 11:56:06,673 INFO L290 TraceCheckUtils]: 46: Hoare triple {3097#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} assume !false; {3097#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} is VALID [2022-04-27 11:56:06,674 INFO L290 TraceCheckUtils]: 45: Hoare triple {3132#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} assume !(~r~0 >= ~d~0); {3097#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} is VALID [2022-04-27 11:56:06,675 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2869#true} {3132#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} #84#return; {3132#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 11:56:06,675 INFO L290 TraceCheckUtils]: 43: Hoare triple {2869#true} assume true; {2869#true} is VALID [2022-04-27 11:56:06,675 INFO L290 TraceCheckUtils]: 42: Hoare triple {2869#true} assume !(0 == ~cond); {2869#true} is VALID [2022-04-27 11:56:06,675 INFO L290 TraceCheckUtils]: 41: Hoare triple {2869#true} ~cond := #in~cond; {2869#true} is VALID [2022-04-27 11:56:06,675 INFO L272 TraceCheckUtils]: 40: Hoare triple {3132#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2869#true} is VALID [2022-04-27 11:56:06,676 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2869#true} {3132#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} #82#return; {3132#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 11:56:06,676 INFO L290 TraceCheckUtils]: 38: Hoare triple {2869#true} assume true; {2869#true} is VALID [2022-04-27 11:56:06,676 INFO L290 TraceCheckUtils]: 37: Hoare triple {2869#true} assume !(0 == ~cond); {2869#true} is VALID [2022-04-27 11:56:06,676 INFO L290 TraceCheckUtils]: 36: Hoare triple {2869#true} ~cond := #in~cond; {2869#true} is VALID [2022-04-27 11:56:06,676 INFO L272 TraceCheckUtils]: 35: Hoare triple {3132#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2869#true} is VALID [2022-04-27 11:56:06,677 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2869#true} {3132#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} #80#return; {3132#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 11:56:06,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {2869#true} assume true; {2869#true} is VALID [2022-04-27 11:56:06,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {2869#true} assume !(0 == ~cond); {2869#true} is VALID [2022-04-27 11:56:06,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {2869#true} ~cond := #in~cond; {2869#true} is VALID [2022-04-27 11:56:06,677 INFO L272 TraceCheckUtils]: 30: Hoare triple {3132#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2869#true} is VALID [2022-04-27 11:56:06,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {3132#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} assume !false; {3132#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 11:56:06,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {3184#(or (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3132#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 11:56:06,683 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2869#true} {3184#(or (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} #84#return; {3184#(or (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-27 11:56:06,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {2869#true} assume true; {2869#true} is VALID [2022-04-27 11:56:06,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {2869#true} assume !(0 == ~cond); {2869#true} is VALID [2022-04-27 11:56:06,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {2869#true} ~cond := #in~cond; {2869#true} is VALID [2022-04-27 11:56:06,683 INFO L272 TraceCheckUtils]: 23: Hoare triple {3184#(or (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2869#true} is VALID [2022-04-27 11:56:06,684 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2869#true} {3184#(or (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} #82#return; {3184#(or (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-27 11:56:06,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {2869#true} assume true; {2869#true} is VALID [2022-04-27 11:56:06,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {2869#true} assume !(0 == ~cond); {2869#true} is VALID [2022-04-27 11:56:06,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {2869#true} ~cond := #in~cond; {2869#true} is VALID [2022-04-27 11:56:06,687 INFO L272 TraceCheckUtils]: 18: Hoare triple {3184#(or (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2869#true} is VALID [2022-04-27 11:56:06,690 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2869#true} {3184#(or (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} #80#return; {3184#(or (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-27 11:56:06,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {2869#true} assume true; {2869#true} is VALID [2022-04-27 11:56:06,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {2869#true} assume !(0 == ~cond); {2869#true} is VALID [2022-04-27 11:56:06,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {2869#true} ~cond := #in~cond; {2869#true} is VALID [2022-04-27 11:56:06,690 INFO L272 TraceCheckUtils]: 13: Hoare triple {3184#(or (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2869#true} is VALID [2022-04-27 11:56:06,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {3184#(or (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} assume !false; {3184#(or (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-27 11:56:06,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {2869#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {3184#(or (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-27 11:56:06,692 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2869#true} {2869#true} #78#return; {2869#true} is VALID [2022-04-27 11:56:06,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {2869#true} assume true; {2869#true} is VALID [2022-04-27 11:56:06,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {2869#true} assume !(0 == ~cond); {2869#true} is VALID [2022-04-27 11:56:06,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {2869#true} ~cond := #in~cond; {2869#true} is VALID [2022-04-27 11:56:06,692 INFO L272 TraceCheckUtils]: 6: Hoare triple {2869#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2869#true} is VALID [2022-04-27 11:56:06,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {2869#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2869#true} is VALID [2022-04-27 11:56:06,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {2869#true} call #t~ret6 := main(); {2869#true} is VALID [2022-04-27 11:56:06,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2869#true} {2869#true} #94#return; {2869#true} is VALID [2022-04-27 11:56:06,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {2869#true} assume true; {2869#true} is VALID [2022-04-27 11:56:06,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {2869#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2869#true} is VALID [2022-04-27 11:56:06,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {2869#true} call ULTIMATE.init(); {2869#true} is VALID [2022-04-27 11:56:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 36 proven. 8 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-27 11:56:06,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:56:06,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244374573] [2022-04-27 11:56:06,694 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:56:06,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673391117] [2022-04-27 11:56:06,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673391117] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:56:06,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:56:06,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-04-27 11:56:06,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065652419] [2022-04-27 11:56:06,694 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:56:06,695 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 9 states have call predecessors, (18), 7 states have call successors, (18) Word has length 64 [2022-04-27 11:56:06,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:56:06,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 9 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-27 11:56:06,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:06,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 11:56:06,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:56:06,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 11:56:06,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=271, Unknown=1, NotChecked=0, Total=342 [2022-04-27 11:56:06,809 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 9 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-27 11:56:27,010 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:56:29,033 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:56:30,821 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:56:32,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:56:47,448 WARN L232 SmtUtils]: Spent 9.53s on a formula simplification. DAG size of input: 57 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:56:52,776 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:56:59,369 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:57:27,131 WARN L232 SmtUtils]: Spent 26.01s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:57:46,335 WARN L232 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 58 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:57:53,804 WARN L232 SmtUtils]: Spent 5.49s on a formula simplification. DAG size of input: 63 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:57:58,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:57:58,020 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2022-04-27 11:57:58,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-27 11:57:58,021 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 9 states have call predecessors, (18), 7 states have call successors, (18) Word has length 64 [2022-04-27 11:57:58,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:57:58,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 9 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-27 11:57:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 132 transitions. [2022-04-27 11:57:58,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 9 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-27 11:57:58,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 132 transitions. [2022-04-27 11:57:58,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 132 transitions. [2022-04-27 11:57:59,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:57:59,494 INFO L225 Difference]: With dead ends: 144 [2022-04-27 11:57:59,494 INFO L226 Difference]: Without dead ends: 121 [2022-04-27 11:57:59,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 96.0s TimeCoverageRelationStatistics Valid=162, Invalid=649, Unknown=1, NotChecked=0, Total=812 [2022-04-27 11:57:59,496 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 59 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 131 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.6s IncrementalHoareTripleChecker+Time [2022-04-27 11:57:59,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 217 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 634 Invalid, 5 Unknown, 0 Unchecked, 21.6s Time] [2022-04-27 11:57:59,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-27 11:57:59,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 103. [2022-04-27 11:57:59,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:57:59,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 103 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 11:57:59,575 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 103 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 11:57:59,575 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 103 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 11:57:59,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:57:59,580 INFO L93 Difference]: Finished difference Result 121 states and 153 transitions. [2022-04-27 11:57:59,580 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2022-04-27 11:57:59,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:57:59,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:57:59,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) Second operand 121 states. [2022-04-27 11:57:59,581 INFO L87 Difference]: Start difference. First operand has 103 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) Second operand 121 states. [2022-04-27 11:57:59,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:57:59,586 INFO L93 Difference]: Finished difference Result 121 states and 153 transitions. [2022-04-27 11:57:59,586 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2022-04-27 11:57:59,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:57:59,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:57:59,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:57:59,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:57:59,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 11:57:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2022-04-27 11:57:59,591 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 64 [2022-04-27 11:57:59,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:57:59,591 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2022-04-27 11:57:59,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 9 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-27 11:57:59,592 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2022-04-27 11:57:59,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-27 11:57:59,593 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:57:59,593 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:57:59,618 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-27 11:57:59,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:57:59,817 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:57:59,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:57:59,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1554666020, now seen corresponding path program 1 times [2022-04-27 11:57:59,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:57:59,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667355891] [2022-04-27 11:57:59,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:57:59,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:57:59,828 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:57:59,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2082443203] [2022-04-27 11:57:59,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:57:59,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:57:59,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:57:59,829 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:57:59,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 11:57:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:57:59,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-27 11:57:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:57:59,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:58:25,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {3889#true} call ULTIMATE.init(); {3889#true} is VALID [2022-04-27 11:58:25,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {3889#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3889#true} is VALID [2022-04-27 11:58:25,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {3889#true} assume true; {3889#true} is VALID [2022-04-27 11:58:25,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3889#true} {3889#true} #94#return; {3889#true} is VALID [2022-04-27 11:58:25,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {3889#true} call #t~ret6 := main(); {3889#true} is VALID [2022-04-27 11:58:25,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {3889#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {3889#true} is VALID [2022-04-27 11:58:25,966 INFO L272 TraceCheckUtils]: 6: Hoare triple {3889#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3889#true} is VALID [2022-04-27 11:58:25,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {3889#true} ~cond := #in~cond; {3889#true} is VALID [2022-04-27 11:58:25,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {3889#true} assume !(0 == ~cond); {3889#true} is VALID [2022-04-27 11:58:25,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {3889#true} assume true; {3889#true} is VALID [2022-04-27 11:58:25,967 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3889#true} {3889#true} #78#return; {3889#true} is VALID [2022-04-27 11:58:25,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {3889#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {3927#(and (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 11:58:25,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {3927#(and (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {3927#(and (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 11:58:25,967 INFO L272 TraceCheckUtils]: 13: Hoare triple {3927#(and (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3889#true} is VALID [2022-04-27 11:58:25,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {3889#true} ~cond := #in~cond; {3889#true} is VALID [2022-04-27 11:58:25,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {3889#true} assume !(0 == ~cond); {3889#true} is VALID [2022-04-27 11:58:25,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {3889#true} assume true; {3889#true} is VALID [2022-04-27 11:58:25,968 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3889#true} {3927#(and (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #80#return; {3927#(and (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 11:58:25,968 INFO L272 TraceCheckUtils]: 18: Hoare triple {3927#(and (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3889#true} is VALID [2022-04-27 11:58:25,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {3889#true} ~cond := #in~cond; {3889#true} is VALID [2022-04-27 11:58:25,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {3889#true} assume !(0 == ~cond); {3889#true} is VALID [2022-04-27 11:58:25,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {3889#true} assume true; {3889#true} is VALID [2022-04-27 11:58:25,969 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3889#true} {3927#(and (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #82#return; {3927#(and (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 11:58:25,969 INFO L272 TraceCheckUtils]: 23: Hoare triple {3927#(and (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3889#true} is VALID [2022-04-27 11:58:25,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {3889#true} ~cond := #in~cond; {3967#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:58:25,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {3967#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:58:25,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:58:25,971 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} {3927#(and (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #84#return; {3978#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 11:58:25,972 INFO L290 TraceCheckUtils]: 28: Hoare triple {3978#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3982#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-27 11:58:25,972 INFO L290 TraceCheckUtils]: 29: Hoare triple {3982#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !false; {3982#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-27 11:58:25,972 INFO L272 TraceCheckUtils]: 30: Hoare triple {3982#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3889#true} is VALID [2022-04-27 11:58:25,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {3889#true} ~cond := #in~cond; {3889#true} is VALID [2022-04-27 11:58:25,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {3889#true} assume !(0 == ~cond); {3889#true} is VALID [2022-04-27 11:58:25,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {3889#true} assume true; {3889#true} is VALID [2022-04-27 11:58:25,973 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3889#true} {3982#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} #80#return; {3982#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-27 11:58:25,973 INFO L272 TraceCheckUtils]: 35: Hoare triple {3982#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3889#true} is VALID [2022-04-27 11:58:25,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {3889#true} ~cond := #in~cond; {3889#true} is VALID [2022-04-27 11:58:25,973 INFO L290 TraceCheckUtils]: 37: Hoare triple {3889#true} assume !(0 == ~cond); {3889#true} is VALID [2022-04-27 11:58:25,973 INFO L290 TraceCheckUtils]: 38: Hoare triple {3889#true} assume true; {3889#true} is VALID [2022-04-27 11:58:25,974 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3889#true} {3982#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} #82#return; {3982#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-27 11:58:25,974 INFO L272 TraceCheckUtils]: 40: Hoare triple {3982#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3889#true} is VALID [2022-04-27 11:58:25,974 INFO L290 TraceCheckUtils]: 41: Hoare triple {3889#true} ~cond := #in~cond; {3889#true} is VALID [2022-04-27 11:58:25,974 INFO L290 TraceCheckUtils]: 42: Hoare triple {3889#true} assume !(0 == ~cond); {3889#true} is VALID [2022-04-27 11:58:25,974 INFO L290 TraceCheckUtils]: 43: Hoare triple {3889#true} assume true; {3889#true} is VALID [2022-04-27 11:58:25,978 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3889#true} {3982#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} #84#return; {3982#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-27 11:58:25,979 INFO L290 TraceCheckUtils]: 45: Hoare triple {3982#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !(~r~0 >= ~d~0); {4034#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (not (<= main_~d~0 main_~r~0)) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-27 11:58:25,979 INFO L290 TraceCheckUtils]: 46: Hoare triple {4034#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (not (<= main_~d~0 main_~r~0)) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !false; {4034#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (not (<= main_~d~0 main_~r~0)) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-27 11:58:25,979 INFO L272 TraceCheckUtils]: 47: Hoare triple {4034#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (not (<= main_~d~0 main_~r~0)) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {3889#true} is VALID [2022-04-27 11:58:25,979 INFO L290 TraceCheckUtils]: 48: Hoare triple {3889#true} ~cond := #in~cond; {3889#true} is VALID [2022-04-27 11:58:25,979 INFO L290 TraceCheckUtils]: 49: Hoare triple {3889#true} assume !(0 == ~cond); {3889#true} is VALID [2022-04-27 11:58:25,980 INFO L290 TraceCheckUtils]: 50: Hoare triple {3889#true} assume true; {3889#true} is VALID [2022-04-27 11:58:25,980 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3889#true} {4034#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (not (<= main_~d~0 main_~r~0)) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} #86#return; {4034#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (not (<= main_~d~0 main_~r~0)) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-27 11:58:25,980 INFO L272 TraceCheckUtils]: 52: Hoare triple {4034#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (not (<= main_~d~0 main_~r~0)) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3889#true} is VALID [2022-04-27 11:58:25,980 INFO L290 TraceCheckUtils]: 53: Hoare triple {3889#true} ~cond := #in~cond; {3889#true} is VALID [2022-04-27 11:58:25,980 INFO L290 TraceCheckUtils]: 54: Hoare triple {3889#true} assume !(0 == ~cond); {3889#true} is VALID [2022-04-27 11:58:25,980 INFO L290 TraceCheckUtils]: 55: Hoare triple {3889#true} assume true; {3889#true} is VALID [2022-04-27 11:58:25,981 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3889#true} {4034#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (not (<= main_~d~0 main_~r~0)) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} #88#return; {4034#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (not (<= main_~d~0 main_~r~0)) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-27 11:58:25,982 INFO L290 TraceCheckUtils]: 57: Hoare triple {4034#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (not (<= main_~d~0 main_~r~0)) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {4071#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (not (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0)) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-27 11:58:25,984 INFO L290 TraceCheckUtils]: 58: Hoare triple {4071#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (<= main_~r~0 (mod main_~A~0 4294967296)) (= main_~q~0 0) (not (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0)) (<= (mod main_~B~0 4294967296) main_~r~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {4075#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (<= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (+ main_~d~0 main_~r~0) (* 2 (mod main_~B~0 4294967296))))} is VALID [2022-04-27 11:58:25,984 INFO L290 TraceCheckUtils]: 59: Hoare triple {4075#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (<= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (+ main_~d~0 main_~r~0) (* 2 (mod main_~B~0 4294967296))))} assume !false; {4075#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (<= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (+ main_~d~0 main_~r~0) (* 2 (mod main_~B~0 4294967296))))} is VALID [2022-04-27 11:58:25,984 INFO L272 TraceCheckUtils]: 60: Hoare triple {4075#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (<= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (+ main_~d~0 main_~r~0) (* 2 (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {3889#true} is VALID [2022-04-27 11:58:25,985 INFO L290 TraceCheckUtils]: 61: Hoare triple {3889#true} ~cond := #in~cond; {3967#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:58:25,985 INFO L290 TraceCheckUtils]: 62: Hoare triple {3967#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:58:25,985 INFO L290 TraceCheckUtils]: 63: Hoare triple {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:58:25,989 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} {4075#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (<= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (+ main_~d~0 main_~r~0) (* 2 (mod main_~B~0 4294967296))))} #86#return; {4094#(and (= main_~q~0 main_~p~0) (< (+ main_~d~0 main_~r~0) (* (mod main_~d~0 4294967296) 2)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~d~0 4294967296) main_~q~0) main_~r~0)) (< main_~d~0 4294967296) (<= 0 main_~d~0) (<= (mod main_~d~0 4294967296) (mod main_~A~0 4294967296)))} is VALID [2022-04-27 11:58:25,990 INFO L272 TraceCheckUtils]: 65: Hoare triple {4094#(and (= main_~q~0 main_~p~0) (< (+ main_~d~0 main_~r~0) (* (mod main_~d~0 4294967296) 2)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~d~0 4294967296) main_~q~0) main_~r~0)) (< main_~d~0 4294967296) (<= 0 main_~d~0) (<= (mod main_~d~0 4294967296) (mod main_~A~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3889#true} is VALID [2022-04-27 11:58:25,990 INFO L290 TraceCheckUtils]: 66: Hoare triple {3889#true} ~cond := #in~cond; {3889#true} is VALID [2022-04-27 11:58:25,990 INFO L290 TraceCheckUtils]: 67: Hoare triple {3889#true} assume !(0 == ~cond); {3889#true} is VALID [2022-04-27 11:58:25,990 INFO L290 TraceCheckUtils]: 68: Hoare triple {3889#true} assume true; {3889#true} is VALID [2022-04-27 11:58:25,990 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {3889#true} {4094#(and (= main_~q~0 main_~p~0) (< (+ main_~d~0 main_~r~0) (* (mod main_~d~0 4294967296) 2)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~d~0 4294967296) main_~q~0) main_~r~0)) (< main_~d~0 4294967296) (<= 0 main_~d~0) (<= (mod main_~d~0 4294967296) (mod main_~A~0 4294967296)))} #88#return; {4094#(and (= main_~q~0 main_~p~0) (< (+ main_~d~0 main_~r~0) (* (mod main_~d~0 4294967296) 2)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~d~0 4294967296) main_~q~0) main_~r~0)) (< main_~d~0 4294967296) (<= 0 main_~d~0) (<= (mod main_~d~0 4294967296) (mod main_~A~0 4294967296)))} is VALID [2022-04-27 11:58:25,991 INFO L290 TraceCheckUtils]: 70: Hoare triple {4094#(and (= main_~q~0 main_~p~0) (< (+ main_~d~0 main_~r~0) (* (mod main_~d~0 4294967296) 2)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~d~0 4294967296) main_~q~0) main_~r~0)) (< main_~d~0 4294967296) (<= 0 main_~d~0) (<= (mod main_~d~0 4294967296) (mod main_~A~0 4294967296)))} assume !(1 != ~p~0); {4113#(and (< (+ main_~d~0 main_~r~0) (* (mod main_~d~0 4294967296) 2)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~d~0 4294967296) main_~q~0) main_~r~0)) (<= 0 main_~d~0) (<= (mod main_~d~0 4294967296) (mod main_~A~0 4294967296)) (= main_~q~0 1))} is VALID [2022-04-27 11:58:25,992 INFO L272 TraceCheckUtils]: 71: Hoare triple {4113#(and (< (+ main_~d~0 main_~r~0) (* (mod main_~d~0 4294967296) 2)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~d~0 4294967296) main_~q~0) main_~r~0)) (<= 0 main_~d~0) (<= (mod main_~d~0 4294967296) (mod main_~A~0 4294967296)) (= main_~q~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4117#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:58:25,993 INFO L290 TraceCheckUtils]: 72: Hoare triple {4117#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4121#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:58:25,993 INFO L290 TraceCheckUtils]: 73: Hoare triple {4121#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3890#false} is VALID [2022-04-27 11:58:25,993 INFO L290 TraceCheckUtils]: 74: Hoare triple {3890#false} assume !false; {3890#false} is VALID [2022-04-27 11:58:25,993 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 45 proven. 32 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-04-27 11:58:25,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:00:18,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:00:18,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667355891] [2022-04-27 12:00:18,470 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:00:18,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082443203] [2022-04-27 12:00:18,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082443203] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:00:18,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:00:18,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 12:00:18,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107002530] [2022-04-27 12:00:18,470 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:00:18,472 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 7 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 75 [2022-04-27 12:00:18,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:00:18,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 7 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-27 12:00:18,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:00:18,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 12:00:18,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:00:18,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 12:00:18,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2022-04-27 12:00:18,548 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 7 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-27 12:00:25,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:25,639 INFO L93 Difference]: Finished difference Result 132 states and 160 transitions. [2022-04-27 12:00:25,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 12:00:25,639 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 7 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 75 [2022-04-27 12:00:25,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:00:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 7 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-27 12:00:25,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 93 transitions. [2022-04-27 12:00:25,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 7 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-27 12:00:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 93 transitions. [2022-04-27 12:00:25,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 93 transitions. [2022-04-27 12:00:25,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:00:25,772 INFO L225 Difference]: With dead ends: 132 [2022-04-27 12:00:25,772 INFO L226 Difference]: Without dead ends: 98 [2022-04-27 12:00:25,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2022-04-27 12:00:25,773 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 17 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-27 12:00:25,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 206 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-27 12:00:25,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-27 12:00:25,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-04-27 12:00:25,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:00:25,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 98 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 63 states have internal predecessors, (67), 25 states have call successors, (25), 14 states have call predecessors, (25), 13 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:00:25,820 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 98 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 63 states have internal predecessors, (67), 25 states have call successors, (25), 14 states have call predecessors, (25), 13 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:00:25,821 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 98 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 63 states have internal predecessors, (67), 25 states have call successors, (25), 14 states have call predecessors, (25), 13 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:00:25,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:25,824 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2022-04-27 12:00:25,824 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2022-04-27 12:00:25,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:25,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:25,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 63 states have internal predecessors, (67), 25 states have call successors, (25), 14 states have call predecessors, (25), 13 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 98 states. [2022-04-27 12:00:25,825 INFO L87 Difference]: Start difference. First operand has 98 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 63 states have internal predecessors, (67), 25 states have call successors, (25), 14 states have call predecessors, (25), 13 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 98 states. [2022-04-27 12:00:25,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:25,828 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2022-04-27 12:00:25,828 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2022-04-27 12:00:25,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:25,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:25,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:00:25,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:00:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 63 states have internal predecessors, (67), 25 states have call successors, (25), 14 states have call predecessors, (25), 13 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:00:25,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 115 transitions. [2022-04-27 12:00:25,832 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 115 transitions. Word has length 75 [2022-04-27 12:00:25,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:00:25,833 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 115 transitions. [2022-04-27 12:00:25,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 7 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-27 12:00:25,833 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2022-04-27 12:00:25,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-27 12:00:25,834 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:00:25,834 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:00:25,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 12:00:26,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:00:26,048 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:00:26,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:00:26,048 INFO L85 PathProgramCache]: Analyzing trace with hash 84599292, now seen corresponding path program 1 times [2022-04-27 12:00:26,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:00:26,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178440895] [2022-04-27 12:00:26,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:00:26,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:00:26,057 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:00:26,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [685627492] [2022-04-27 12:00:26,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:00:26,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:00:26,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:00:26,059 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:00:26,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 12:00:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:00:26,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 12:00:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:00:26,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:00:27,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {4814#true} call ULTIMATE.init(); {4814#true} is VALID [2022-04-27 12:00:27,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {4814#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4814#true} is VALID [2022-04-27 12:00:27,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {4814#true} assume true; {4814#true} is VALID [2022-04-27 12:00:27,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4814#true} {4814#true} #94#return; {4814#true} is VALID [2022-04-27 12:00:27,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {4814#true} call #t~ret6 := main(); {4814#true} is VALID [2022-04-27 12:00:27,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {4814#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {4814#true} is VALID [2022-04-27 12:00:27,271 INFO L272 TraceCheckUtils]: 6: Hoare triple {4814#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4814#true} is VALID [2022-04-27 12:00:27,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {4814#true} ~cond := #in~cond; {4814#true} is VALID [2022-04-27 12:00:27,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {4814#true} assume !(0 == ~cond); {4814#true} is VALID [2022-04-27 12:00:27,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {4814#true} assume true; {4814#true} is VALID [2022-04-27 12:00:27,272 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4814#true} {4814#true} #78#return; {4814#true} is VALID [2022-04-27 12:00:27,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {4814#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {4852#(<= 1 main_~p~0)} is VALID [2022-04-27 12:00:27,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {4852#(<= 1 main_~p~0)} assume !false; {4852#(<= 1 main_~p~0)} is VALID [2022-04-27 12:00:27,276 INFO L272 TraceCheckUtils]: 13: Hoare triple {4852#(<= 1 main_~p~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4814#true} is VALID [2022-04-27 12:00:27,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {4814#true} ~cond := #in~cond; {4814#true} is VALID [2022-04-27 12:00:27,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {4814#true} assume !(0 == ~cond); {4814#true} is VALID [2022-04-27 12:00:27,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {4814#true} assume true; {4814#true} is VALID [2022-04-27 12:00:27,277 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4814#true} {4852#(<= 1 main_~p~0)} #80#return; {4852#(<= 1 main_~p~0)} is VALID [2022-04-27 12:00:27,277 INFO L272 TraceCheckUtils]: 18: Hoare triple {4852#(<= 1 main_~p~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {4814#true} is VALID [2022-04-27 12:00:27,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {4814#true} ~cond := #in~cond; {4814#true} is VALID [2022-04-27 12:00:27,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {4814#true} assume !(0 == ~cond); {4814#true} is VALID [2022-04-27 12:00:27,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {4814#true} assume true; {4814#true} is VALID [2022-04-27 12:00:27,278 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4814#true} {4852#(<= 1 main_~p~0)} #82#return; {4852#(<= 1 main_~p~0)} is VALID [2022-04-27 12:00:27,278 INFO L272 TraceCheckUtils]: 23: Hoare triple {4852#(<= 1 main_~p~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4814#true} is VALID [2022-04-27 12:00:27,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {4814#true} ~cond := #in~cond; {4814#true} is VALID [2022-04-27 12:00:27,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {4814#true} assume !(0 == ~cond); {4814#true} is VALID [2022-04-27 12:00:27,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {4814#true} assume true; {4814#true} is VALID [2022-04-27 12:00:27,279 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4814#true} {4852#(<= 1 main_~p~0)} #84#return; {4852#(<= 1 main_~p~0)} is VALID [2022-04-27 12:00:27,280 INFO L290 TraceCheckUtils]: 28: Hoare triple {4852#(<= 1 main_~p~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4904#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 12:00:27,280 INFO L290 TraceCheckUtils]: 29: Hoare triple {4904#(<= 1 (div main_~p~0 2))} assume !false; {4904#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 12:00:27,280 INFO L272 TraceCheckUtils]: 30: Hoare triple {4904#(<= 1 (div main_~p~0 2))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4814#true} is VALID [2022-04-27 12:00:27,280 INFO L290 TraceCheckUtils]: 31: Hoare triple {4814#true} ~cond := #in~cond; {4814#true} is VALID [2022-04-27 12:00:27,281 INFO L290 TraceCheckUtils]: 32: Hoare triple {4814#true} assume !(0 == ~cond); {4814#true} is VALID [2022-04-27 12:00:27,281 INFO L290 TraceCheckUtils]: 33: Hoare triple {4814#true} assume true; {4814#true} is VALID [2022-04-27 12:00:27,281 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4814#true} {4904#(<= 1 (div main_~p~0 2))} #80#return; {4904#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 12:00:27,281 INFO L272 TraceCheckUtils]: 35: Hoare triple {4904#(<= 1 (div main_~p~0 2))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {4814#true} is VALID [2022-04-27 12:00:27,281 INFO L290 TraceCheckUtils]: 36: Hoare triple {4814#true} ~cond := #in~cond; {4814#true} is VALID [2022-04-27 12:00:27,281 INFO L290 TraceCheckUtils]: 37: Hoare triple {4814#true} assume !(0 == ~cond); {4814#true} is VALID [2022-04-27 12:00:27,281 INFO L290 TraceCheckUtils]: 38: Hoare triple {4814#true} assume true; {4814#true} is VALID [2022-04-27 12:00:27,282 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4814#true} {4904#(<= 1 (div main_~p~0 2))} #82#return; {4904#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 12:00:27,282 INFO L272 TraceCheckUtils]: 40: Hoare triple {4904#(<= 1 (div main_~p~0 2))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4814#true} is VALID [2022-04-27 12:00:27,282 INFO L290 TraceCheckUtils]: 41: Hoare triple {4814#true} ~cond := #in~cond; {4814#true} is VALID [2022-04-27 12:00:27,282 INFO L290 TraceCheckUtils]: 42: Hoare triple {4814#true} assume !(0 == ~cond); {4814#true} is VALID [2022-04-27 12:00:27,282 INFO L290 TraceCheckUtils]: 43: Hoare triple {4814#true} assume true; {4814#true} is VALID [2022-04-27 12:00:27,283 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4814#true} {4904#(<= 1 (div main_~p~0 2))} #84#return; {4904#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 12:00:27,284 INFO L290 TraceCheckUtils]: 45: Hoare triple {4904#(<= 1 (div main_~p~0 2))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4956#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 12:00:27,284 INFO L290 TraceCheckUtils]: 46: Hoare triple {4956#(<= 1 (div (div main_~p~0 2) 2))} assume !false; {4956#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 12:00:27,284 INFO L272 TraceCheckUtils]: 47: Hoare triple {4956#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4814#true} is VALID [2022-04-27 12:00:27,284 INFO L290 TraceCheckUtils]: 48: Hoare triple {4814#true} ~cond := #in~cond; {4814#true} is VALID [2022-04-27 12:00:27,285 INFO L290 TraceCheckUtils]: 49: Hoare triple {4814#true} assume !(0 == ~cond); {4814#true} is VALID [2022-04-27 12:00:27,285 INFO L290 TraceCheckUtils]: 50: Hoare triple {4814#true} assume true; {4814#true} is VALID [2022-04-27 12:00:27,285 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4814#true} {4956#(<= 1 (div (div main_~p~0 2) 2))} #80#return; {4956#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 12:00:27,285 INFO L272 TraceCheckUtils]: 52: Hoare triple {4956#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {4814#true} is VALID [2022-04-27 12:00:27,285 INFO L290 TraceCheckUtils]: 53: Hoare triple {4814#true} ~cond := #in~cond; {4814#true} is VALID [2022-04-27 12:00:27,285 INFO L290 TraceCheckUtils]: 54: Hoare triple {4814#true} assume !(0 == ~cond); {4814#true} is VALID [2022-04-27 12:00:27,285 INFO L290 TraceCheckUtils]: 55: Hoare triple {4814#true} assume true; {4814#true} is VALID [2022-04-27 12:00:27,286 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4814#true} {4956#(<= 1 (div (div main_~p~0 2) 2))} #82#return; {4956#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 12:00:27,286 INFO L272 TraceCheckUtils]: 57: Hoare triple {4956#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4814#true} is VALID [2022-04-27 12:00:27,286 INFO L290 TraceCheckUtils]: 58: Hoare triple {4814#true} ~cond := #in~cond; {4814#true} is VALID [2022-04-27 12:00:27,286 INFO L290 TraceCheckUtils]: 59: Hoare triple {4814#true} assume !(0 == ~cond); {4814#true} is VALID [2022-04-27 12:00:27,286 INFO L290 TraceCheckUtils]: 60: Hoare triple {4814#true} assume true; {4814#true} is VALID [2022-04-27 12:00:27,287 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {4814#true} {4956#(<= 1 (div (div main_~p~0 2) 2))} #84#return; {4956#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 12:00:27,287 INFO L290 TraceCheckUtils]: 62: Hoare triple {4956#(<= 1 (div (div main_~p~0 2) 2))} assume !(~r~0 >= ~d~0); {4956#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 12:00:27,288 INFO L290 TraceCheckUtils]: 63: Hoare triple {4956#(<= 1 (div (div main_~p~0 2) 2))} assume !false; {4956#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 12:00:27,288 INFO L272 TraceCheckUtils]: 64: Hoare triple {4956#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {4814#true} is VALID [2022-04-27 12:00:27,288 INFO L290 TraceCheckUtils]: 65: Hoare triple {4814#true} ~cond := #in~cond; {4814#true} is VALID [2022-04-27 12:00:27,288 INFO L290 TraceCheckUtils]: 66: Hoare triple {4814#true} assume !(0 == ~cond); {4814#true} is VALID [2022-04-27 12:00:27,288 INFO L290 TraceCheckUtils]: 67: Hoare triple {4814#true} assume true; {4814#true} is VALID [2022-04-27 12:00:27,289 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4814#true} {4956#(<= 1 (div (div main_~p~0 2) 2))} #86#return; {4956#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 12:00:27,289 INFO L272 TraceCheckUtils]: 69: Hoare triple {4956#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4814#true} is VALID [2022-04-27 12:00:27,289 INFO L290 TraceCheckUtils]: 70: Hoare triple {4814#true} ~cond := #in~cond; {4814#true} is VALID [2022-04-27 12:00:27,289 INFO L290 TraceCheckUtils]: 71: Hoare triple {4814#true} assume !(0 == ~cond); {4814#true} is VALID [2022-04-27 12:00:27,289 INFO L290 TraceCheckUtils]: 72: Hoare triple {4814#true} assume true; {4814#true} is VALID [2022-04-27 12:00:27,289 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4814#true} {4956#(<= 1 (div (div main_~p~0 2) 2))} #88#return; {4956#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 12:00:27,290 INFO L290 TraceCheckUtils]: 74: Hoare triple {4956#(<= 1 (div (div main_~p~0 2) 2))} assume !(1 != ~p~0); {4815#false} is VALID [2022-04-27 12:00:27,290 INFO L272 TraceCheckUtils]: 75: Hoare triple {4815#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4815#false} is VALID [2022-04-27 12:00:27,290 INFO L290 TraceCheckUtils]: 76: Hoare triple {4815#false} ~cond := #in~cond; {4815#false} is VALID [2022-04-27 12:00:27,290 INFO L290 TraceCheckUtils]: 77: Hoare triple {4815#false} assume 0 == ~cond; {4815#false} is VALID [2022-04-27 12:00:27,290 INFO L290 TraceCheckUtils]: 78: Hoare triple {4815#false} assume !false; {4815#false} is VALID [2022-04-27 12:00:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-27 12:00:27,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:00:27,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:00:27,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178440895] [2022-04-27 12:00:27,292 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:00:27,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685627492] [2022-04-27 12:00:27,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685627492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:00:27,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:00:27,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:00:27,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659640139] [2022-04-27 12:00:27,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:00:27,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 79 [2022-04-27 12:00:27,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:00:27,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 12:00:27,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:00:27,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:00:27,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:00:27,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:00:27,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:00:27,348 INFO L87 Difference]: Start difference. First operand 98 states and 115 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 12:00:27,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:27,669 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2022-04-27 12:00:27,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:00:27,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 79 [2022-04-27 12:00:27,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:00:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 12:00:27,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-27 12:00:27,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 12:00:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-27 12:00:27,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2022-04-27 12:00:27,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:00:27,757 INFO L225 Difference]: With dead ends: 108 [2022-04-27 12:00:27,757 INFO L226 Difference]: Without dead ends: 100 [2022-04-27 12:00:27,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:00:27,758 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:00:27,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 107 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:00:27,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-27 12:00:27,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-27 12:00:27,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:00:27,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 63 states have internal predecessors, (68), 25 states have call successors, (25), 14 states have call predecessors, (25), 13 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:00:27,819 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 63 states have internal predecessors, (68), 25 states have call successors, (25), 14 states have call predecessors, (25), 13 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:00:27,819 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 63 states have internal predecessors, (68), 25 states have call successors, (25), 14 states have call predecessors, (25), 13 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:00:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:27,822 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2022-04-27 12:00:27,822 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2022-04-27 12:00:27,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:27,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:27,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 63 states have internal predecessors, (68), 25 states have call successors, (25), 14 states have call predecessors, (25), 13 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 100 states. [2022-04-27 12:00:27,823 INFO L87 Difference]: Start difference. First operand has 100 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 63 states have internal predecessors, (68), 25 states have call successors, (25), 14 states have call predecessors, (25), 13 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 100 states. [2022-04-27 12:00:27,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:27,826 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2022-04-27 12:00:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2022-04-27 12:00:27,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:27,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:27,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:00:27,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:00:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 63 states have internal predecessors, (68), 25 states have call successors, (25), 14 states have call predecessors, (25), 13 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:00:27,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2022-04-27 12:00:27,829 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 116 transitions. Word has length 79 [2022-04-27 12:00:27,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:00:27,830 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 116 transitions. [2022-04-27 12:00:27,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 12:00:27,830 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2022-04-27 12:00:27,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-27 12:00:27,831 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:00:27,831 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:00:27,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 12:00:28,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:00:28,055 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:00:28,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:00:28,055 INFO L85 PathProgramCache]: Analyzing trace with hash -132947769, now seen corresponding path program 2 times [2022-04-27 12:00:28,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:00:28,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586219947] [2022-04-27 12:00:28,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:00:28,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:00:28,075 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:00:28,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1411785674] [2022-04-27 12:00:28,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:00:28,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:00:28,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:00:28,076 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:00:28,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 12:00:28,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:00:28,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:00:28,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 12:00:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:00:28,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:00:34,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {5550#true} call ULTIMATE.init(); {5550#true} is VALID [2022-04-27 12:00:34,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {5550#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5550#true} is VALID [2022-04-27 12:00:34,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:00:34,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5550#true} {5550#true} #94#return; {5550#true} is VALID [2022-04-27 12:00:34,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {5550#true} call #t~ret6 := main(); {5550#true} is VALID [2022-04-27 12:00:34,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {5550#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {5550#true} is VALID [2022-04-27 12:00:34,467 INFO L272 TraceCheckUtils]: 6: Hoare triple {5550#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:00:34,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:00:34,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:00:34,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:00:34,467 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5550#true} {5550#true} #78#return; {5550#true} is VALID [2022-04-27 12:00:34,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {5550#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {5588#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:00:34,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {5588#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {5588#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:00:34,468 INFO L272 TraceCheckUtils]: 13: Hoare triple {5588#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:00:34,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:00:34,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:00:34,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:00:34,469 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5550#true} {5588#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #80#return; {5588#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:00:34,469 INFO L272 TraceCheckUtils]: 18: Hoare triple {5588#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:00:34,469 INFO L290 TraceCheckUtils]: 19: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:00:34,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:00:34,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:00:34,470 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5550#true} {5588#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #82#return; {5588#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:00:34,470 INFO L272 TraceCheckUtils]: 23: Hoare triple {5588#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:00:34,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:00:34,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:00:34,470 INFO L290 TraceCheckUtils]: 26: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:00:34,471 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5550#true} {5588#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #84#return; {5588#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:00:34,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {5588#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5640#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} is VALID [2022-04-27 12:00:34,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {5640#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} assume !false; {5640#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} is VALID [2022-04-27 12:00:34,476 INFO L272 TraceCheckUtils]: 30: Hoare triple {5640#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:00:34,476 INFO L290 TraceCheckUtils]: 31: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:00:34,476 INFO L290 TraceCheckUtils]: 32: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:00:34,476 INFO L290 TraceCheckUtils]: 33: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:00:34,477 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5550#true} {5640#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} #80#return; {5640#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} is VALID [2022-04-27 12:00:34,477 INFO L272 TraceCheckUtils]: 35: Hoare triple {5640#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:00:34,477 INFO L290 TraceCheckUtils]: 36: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:00:34,477 INFO L290 TraceCheckUtils]: 37: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:00:34,477 INFO L290 TraceCheckUtils]: 38: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:00:34,478 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5550#true} {5640#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} #82#return; {5640#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} is VALID [2022-04-27 12:00:34,478 INFO L272 TraceCheckUtils]: 40: Hoare triple {5640#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:00:34,478 INFO L290 TraceCheckUtils]: 41: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:00:34,478 INFO L290 TraceCheckUtils]: 42: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:00:34,478 INFO L290 TraceCheckUtils]: 43: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:00:34,479 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5550#true} {5640#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} #84#return; {5640#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} is VALID [2022-04-27 12:00:34,480 INFO L290 TraceCheckUtils]: 45: Hoare triple {5640#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5692#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 12:00:34,481 INFO L290 TraceCheckUtils]: 46: Hoare triple {5692#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} assume !false; {5692#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 12:00:34,481 INFO L272 TraceCheckUtils]: 47: Hoare triple {5692#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:00:34,481 INFO L290 TraceCheckUtils]: 48: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:00:34,481 INFO L290 TraceCheckUtils]: 49: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:00:34,481 INFO L290 TraceCheckUtils]: 50: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:00:34,482 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5550#true} {5692#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} #80#return; {5692#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 12:00:34,482 INFO L272 TraceCheckUtils]: 52: Hoare triple {5692#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:00:34,482 INFO L290 TraceCheckUtils]: 53: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:00:34,482 INFO L290 TraceCheckUtils]: 54: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:00:34,482 INFO L290 TraceCheckUtils]: 55: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:00:34,483 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5550#true} {5692#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} #82#return; {5692#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 12:00:34,483 INFO L272 TraceCheckUtils]: 57: Hoare triple {5692#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:00:34,483 INFO L290 TraceCheckUtils]: 58: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:00:34,483 INFO L290 TraceCheckUtils]: 59: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:00:34,483 INFO L290 TraceCheckUtils]: 60: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:00:34,484 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {5550#true} {5692#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} #84#return; {5692#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 12:00:34,485 INFO L290 TraceCheckUtils]: 62: Hoare triple {5692#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} assume !(~r~0 >= ~d~0); {5744#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 12:00:34,485 INFO L290 TraceCheckUtils]: 63: Hoare triple {5744#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (= main_~p~0 4))} assume !false; {5744#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 12:00:34,485 INFO L272 TraceCheckUtils]: 64: Hoare triple {5744#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:00:34,485 INFO L290 TraceCheckUtils]: 65: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:00:34,486 INFO L290 TraceCheckUtils]: 66: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:00:34,486 INFO L290 TraceCheckUtils]: 67: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:00:34,486 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {5550#true} {5744#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (= main_~p~0 4))} #86#return; {5744#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 12:00:34,486 INFO L272 TraceCheckUtils]: 69: Hoare triple {5744#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:00:34,487 INFO L290 TraceCheckUtils]: 70: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:00:34,487 INFO L290 TraceCheckUtils]: 71: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:00:34,487 INFO L290 TraceCheckUtils]: 72: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:00:34,487 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5550#true} {5744#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (= main_~p~0 4))} #88#return; {5744#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 12:00:34,489 INFO L290 TraceCheckUtils]: 74: Hoare triple {5744#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (= main_~p~0 4))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {5781#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (= main_~p~0 2) (not (<= (* (mod main_~B~0 4294967296) 4) main_~r~0)) (= main_~q~0 0))} is VALID [2022-04-27 12:00:34,491 INFO L290 TraceCheckUtils]: 75: Hoare triple {5781#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (= main_~p~0 2) (not (<= (* (mod main_~B~0 4294967296) 4) main_~r~0)) (= main_~q~0 0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5785#(and (= main_~q~0 main_~p~0) (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (not (<= (* (mod main_~B~0 4294967296) 4) (+ main_~d~0 main_~r~0))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= (* 2 (mod main_~B~0 4294967296)) (+ main_~d~0 main_~r~0)))} is VALID [2022-04-27 12:00:34,491 INFO L290 TraceCheckUtils]: 76: Hoare triple {5785#(and (= main_~q~0 main_~p~0) (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (not (<= (* (mod main_~B~0 4294967296) 4) (+ main_~d~0 main_~r~0))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= (* 2 (mod main_~B~0 4294967296)) (+ main_~d~0 main_~r~0)))} assume !false; {5785#(and (= main_~q~0 main_~p~0) (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (not (<= (* (mod main_~B~0 4294967296) 4) (+ main_~d~0 main_~r~0))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= (* 2 (mod main_~B~0 4294967296)) (+ main_~d~0 main_~r~0)))} is VALID [2022-04-27 12:00:34,491 INFO L272 TraceCheckUtils]: 77: Hoare triple {5785#(and (= main_~q~0 main_~p~0) (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (not (<= (* (mod main_~B~0 4294967296) 4) (+ main_~d~0 main_~r~0))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= (* 2 (mod main_~B~0 4294967296)) (+ main_~d~0 main_~r~0)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:00:34,491 INFO L290 TraceCheckUtils]: 78: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:00:34,492 INFO L290 TraceCheckUtils]: 79: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:00:34,492 INFO L290 TraceCheckUtils]: 80: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:00:34,492 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {5550#true} {5785#(and (= main_~q~0 main_~p~0) (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (not (<= (* (mod main_~B~0 4294967296) 4) (+ main_~d~0 main_~r~0))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= (* 2 (mod main_~B~0 4294967296)) (+ main_~d~0 main_~r~0)))} #86#return; {5785#(and (= main_~q~0 main_~p~0) (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (not (<= (* (mod main_~B~0 4294967296) 4) (+ main_~d~0 main_~r~0))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= (* 2 (mod main_~B~0 4294967296)) (+ main_~d~0 main_~r~0)))} is VALID [2022-04-27 12:00:34,492 INFO L272 TraceCheckUtils]: 82: Hoare triple {5785#(and (= main_~q~0 main_~p~0) (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (not (<= (* (mod main_~B~0 4294967296) 4) (+ main_~d~0 main_~r~0))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= (* 2 (mod main_~B~0 4294967296)) (+ main_~d~0 main_~r~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:00:34,492 INFO L290 TraceCheckUtils]: 83: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:00:34,493 INFO L290 TraceCheckUtils]: 84: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:00:34,493 INFO L290 TraceCheckUtils]: 85: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:00:34,493 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {5550#true} {5785#(and (= main_~q~0 main_~p~0) (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (not (<= (* (mod main_~B~0 4294967296) 4) (+ main_~d~0 main_~r~0))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= (* 2 (mod main_~B~0 4294967296)) (+ main_~d~0 main_~r~0)))} #88#return; {5785#(and (= main_~q~0 main_~p~0) (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (not (<= (* (mod main_~B~0 4294967296) 4) (+ main_~d~0 main_~r~0))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= (* 2 (mod main_~B~0 4294967296)) (+ main_~d~0 main_~r~0)))} is VALID [2022-04-27 12:00:34,495 INFO L290 TraceCheckUtils]: 87: Hoare triple {5785#(and (= main_~q~0 main_~p~0) (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (not (<= (* (mod main_~B~0 4294967296) 4) (+ main_~d~0 main_~r~0))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= (* 2 (mod main_~B~0 4294967296)) (+ main_~d~0 main_~r~0)))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {5822#(and (= main_~q~0 2) (not (<= (* (mod main_~B~0 4294967296) 4) (mod main_~A~0 4294967296))) (= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (div (* (mod main_~B~0 4294967296) 4) 2)) (= main_~d~0 (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 12:00:34,497 INFO L290 TraceCheckUtils]: 88: Hoare triple {5822#(and (= main_~q~0 2) (not (<= (* (mod main_~B~0 4294967296) 4) (mod main_~A~0 4294967296))) (= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (div (* (mod main_~B~0 4294967296) 4) 2)) (= main_~d~0 (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296)) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5826#(and (< (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) 4)) (= main_~q~0 3) (= (+ main_~r~0 (* 3 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* 3 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296)))} is VALID [2022-04-27 12:00:34,512 INFO L290 TraceCheckUtils]: 89: Hoare triple {5826#(and (< (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) 4)) (= main_~q~0 3) (= (+ main_~r~0 (* 3 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* 3 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296)))} assume !false; {5826#(and (< (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) 4)) (= main_~q~0 3) (= (+ main_~r~0 (* 3 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* 3 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296)))} is VALID [2022-04-27 12:00:34,513 INFO L272 TraceCheckUtils]: 90: Hoare triple {5826#(and (< (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) 4)) (= main_~q~0 3) (= (+ main_~r~0 (* 3 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* 3 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {5833#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:00:34,513 INFO L290 TraceCheckUtils]: 91: Hoare triple {5833#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5837#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:00:34,513 INFO L290 TraceCheckUtils]: 92: Hoare triple {5837#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5551#false} is VALID [2022-04-27 12:00:34,513 INFO L290 TraceCheckUtils]: 93: Hoare triple {5551#false} assume !false; {5551#false} is VALID [2022-04-27 12:00:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 26 proven. 24 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-27 12:00:34,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:01:10,560 WARN L232 SmtUtils]: Spent 9.05s on a formula simplification that was a NOOP. DAG size: 152 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 12:02:07,140 INFO L290 TraceCheckUtils]: 93: Hoare triple {5551#false} assume !false; {5551#false} is VALID [2022-04-27 12:02:07,140 INFO L290 TraceCheckUtils]: 92: Hoare triple {5837#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5551#false} is VALID [2022-04-27 12:02:07,141 INFO L290 TraceCheckUtils]: 91: Hoare triple {5833#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5837#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:02:07,141 INFO L272 TraceCheckUtils]: 90: Hoare triple {5853#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {5833#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:02:07,142 INFO L290 TraceCheckUtils]: 89: Hoare triple {5853#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} assume !false; {5853#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-27 12:02:07,144 INFO L290 TraceCheckUtils]: 88: Hoare triple {5860#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) main_~r~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5853#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-27 12:02:07,158 INFO L290 TraceCheckUtils]: 87: Hoare triple {5864#(and (or (not (<= (div main_~d~0 2) main_~r~0)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (not (<= (+ (div main_~d~0 2) 1) main_~r~0)) (= (mod main_~d~0 2) 0)))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {5860#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) main_~r~0)))} is VALID [2022-04-27 12:02:07,159 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {5550#true} {5864#(and (or (not (<= (div main_~d~0 2) main_~r~0)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (not (<= (+ (div main_~d~0 2) 1) main_~r~0)) (= (mod main_~d~0 2) 0)))} #88#return; {5864#(and (or (not (<= (div main_~d~0 2) main_~r~0)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (not (<= (+ (div main_~d~0 2) 1) main_~r~0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 12:02:07,159 INFO L290 TraceCheckUtils]: 85: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:02:07,159 INFO L290 TraceCheckUtils]: 84: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:02:07,159 INFO L290 TraceCheckUtils]: 83: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:02:07,159 INFO L272 TraceCheckUtils]: 82: Hoare triple {5864#(and (or (not (<= (div main_~d~0 2) main_~r~0)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (not (<= (+ (div main_~d~0 2) 1) main_~r~0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:02:07,160 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {5550#true} {5864#(and (or (not (<= (div main_~d~0 2) main_~r~0)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (not (<= (+ (div main_~d~0 2) 1) main_~r~0)) (= (mod main_~d~0 2) 0)))} #86#return; {5864#(and (or (not (<= (div main_~d~0 2) main_~r~0)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (not (<= (+ (div main_~d~0 2) 1) main_~r~0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 12:02:07,160 INFO L290 TraceCheckUtils]: 80: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:02:07,160 INFO L290 TraceCheckUtils]: 79: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:02:07,160 INFO L290 TraceCheckUtils]: 78: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:02:07,160 INFO L272 TraceCheckUtils]: 77: Hoare triple {5864#(and (or (not (<= (div main_~d~0 2) main_~r~0)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (not (<= (+ (div main_~d~0 2) 1) main_~r~0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:02:07,162 INFO L290 TraceCheckUtils]: 76: Hoare triple {5864#(and (or (not (<= (div main_~d~0 2) main_~r~0)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (not (<= (+ (div main_~d~0 2) 1) main_~r~0)) (= (mod main_~d~0 2) 0)))} assume !false; {5864#(and (or (not (<= (div main_~d~0 2) main_~r~0)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (not (<= (+ (div main_~d~0 2) 1) main_~r~0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 12:02:07,183 INFO L290 TraceCheckUtils]: 75: Hoare triple {5901#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (= (mod main_~p~0 2) 0)) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (<= (+ main_~d~0 (div main_~d~0 2)) main_~r~0))) (or (not (<= (+ main_~d~0 (div main_~d~0 2) 1) main_~r~0)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (< main_~p~0 0)) (= (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5864#(and (or (not (<= (div main_~d~0 2) main_~r~0)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (not (<= (+ (div main_~d~0 2) 1) main_~r~0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 12:02:07,484 INFO L290 TraceCheckUtils]: 74: Hoare triple {5905#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2) 1) main_~r~0))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (<= (+ (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (<= (+ 2 (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2)) main_~r~0)) (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (or (not (< main_~p~0 0)) (and (or (not (<= (+ (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (not (<= (+ 2 (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2)) main_~r~0)) (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))))) (= (mod main_~p~0 2) 0)))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {5901#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (= (mod main_~p~0 2) 0)) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (<= (+ main_~d~0 (div main_~d~0 2)) main_~r~0))) (or (not (<= (+ main_~d~0 (div main_~d~0 2) 1) main_~r~0)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (< main_~p~0 0)) (= (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} is VALID [2022-04-27 12:02:07,485 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5550#true} {5905#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2) 1) main_~r~0))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (<= (+ (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (<= (+ 2 (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2)) main_~r~0)) (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (or (not (< main_~p~0 0)) (and (or (not (<= (+ (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (not (<= (+ 2 (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2)) main_~r~0)) (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))))) (= (mod main_~p~0 2) 0)))))} #88#return; {5905#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2) 1) main_~r~0))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (<= (+ (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (<= (+ 2 (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2)) main_~r~0)) (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (or (not (< main_~p~0 0)) (and (or (not (<= (+ (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (not (<= (+ 2 (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2)) main_~r~0)) (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))))) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-27 12:02:07,485 INFO L290 TraceCheckUtils]: 72: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:02:07,485 INFO L290 TraceCheckUtils]: 71: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:02:07,485 INFO L290 TraceCheckUtils]: 70: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:02:07,485 INFO L272 TraceCheckUtils]: 69: Hoare triple {5905#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2) 1) main_~r~0))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (<= (+ (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (<= (+ 2 (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2)) main_~r~0)) (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (or (not (< main_~p~0 0)) (and (or (not (<= (+ (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (not (<= (+ 2 (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2)) main_~r~0)) (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))))) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:02:07,488 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {5550#true} {5905#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2) 1) main_~r~0))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (<= (+ (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (<= (+ 2 (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2)) main_~r~0)) (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (or (not (< main_~p~0 0)) (and (or (not (<= (+ (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (not (<= (+ 2 (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2)) main_~r~0)) (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))))) (= (mod main_~p~0 2) 0)))))} #86#return; {5905#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2) 1) main_~r~0))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (<= (+ (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (<= (+ 2 (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2)) main_~r~0)) (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (or (not (< main_~p~0 0)) (and (or (not (<= (+ (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (not (<= (+ 2 (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2)) main_~r~0)) (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))))) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-27 12:02:07,488 INFO L290 TraceCheckUtils]: 67: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:02:07,488 INFO L290 TraceCheckUtils]: 66: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:02:07,488 INFO L290 TraceCheckUtils]: 65: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:02:07,488 INFO L272 TraceCheckUtils]: 64: Hoare triple {5905#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2) 1) main_~r~0))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (<= (+ (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (<= (+ 2 (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2)) main_~r~0)) (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (or (not (< main_~p~0 0)) (and (or (not (<= (+ (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (not (<= (+ 2 (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2)) main_~r~0)) (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))))) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:02:07,492 INFO L290 TraceCheckUtils]: 63: Hoare triple {5905#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2) 1) main_~r~0))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (<= (+ (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (<= (+ 2 (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2)) main_~r~0)) (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (or (not (< main_~p~0 0)) (and (or (not (<= (+ (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (not (<= (+ 2 (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2)) main_~r~0)) (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))))) (= (mod main_~p~0 2) 0)))))} assume !false; {5905#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2) 1) main_~r~0))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (<= (+ (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (<= (+ 2 (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2)) main_~r~0)) (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (or (not (< main_~p~0 0)) (and (or (not (<= (+ (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (not (<= (+ 2 (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2)) main_~r~0)) (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))))) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-27 12:02:07,496 INFO L290 TraceCheckUtils]: 62: Hoare triple {5942#(or (and (or (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (not (< main_~p~0 0)) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= (mod main_~p~0 2) 0))) (< main_~d~0 0) (<= main_~d~0 main_~r~0))} assume !(~r~0 >= ~d~0); {5905#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2) 1) main_~r~0))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (<= (+ (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (<= (+ 2 (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2)) main_~r~0)) (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (or (not (< main_~p~0 0)) (and (or (not (<= (+ (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2) 1) main_~r~0)) (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (not (<= (+ 2 (div (+ (div main_~d~0 2) 1) 2) (div main_~d~0 2)) main_~r~0)) (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))))) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-27 12:02:07,497 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {5550#true} {5942#(or (and (or (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (not (< main_~p~0 0)) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= (mod main_~p~0 2) 0))) (< main_~d~0 0) (<= main_~d~0 main_~r~0))} #84#return; {5942#(or (and (or (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (not (< main_~p~0 0)) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= (mod main_~p~0 2) 0))) (< main_~d~0 0) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 12:02:07,497 INFO L290 TraceCheckUtils]: 60: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:02:07,497 INFO L290 TraceCheckUtils]: 59: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:02:07,497 INFO L290 TraceCheckUtils]: 58: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:02:07,497 INFO L272 TraceCheckUtils]: 57: Hoare triple {5942#(or (and (or (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (not (< main_~p~0 0)) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= (mod main_~p~0 2) 0))) (< main_~d~0 0) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:02:07,498 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5550#true} {5942#(or (and (or (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (not (< main_~p~0 0)) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= (mod main_~p~0 2) 0))) (< main_~d~0 0) (<= main_~d~0 main_~r~0))} #82#return; {5942#(or (and (or (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (not (< main_~p~0 0)) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= (mod main_~p~0 2) 0))) (< main_~d~0 0) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 12:02:07,498 INFO L290 TraceCheckUtils]: 55: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:02:07,498 INFO L290 TraceCheckUtils]: 54: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:02:07,498 INFO L290 TraceCheckUtils]: 53: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:02:07,498 INFO L272 TraceCheckUtils]: 52: Hoare triple {5942#(or (and (or (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (not (< main_~p~0 0)) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= (mod main_~p~0 2) 0))) (< main_~d~0 0) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:02:07,504 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5550#true} {5942#(or (and (or (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (not (< main_~p~0 0)) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= (mod main_~p~0 2) 0))) (< main_~d~0 0) (<= main_~d~0 main_~r~0))} #80#return; {5942#(or (and (or (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (not (< main_~p~0 0)) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= (mod main_~p~0 2) 0))) (< main_~d~0 0) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 12:02:07,504 INFO L290 TraceCheckUtils]: 50: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:02:07,504 INFO L290 TraceCheckUtils]: 49: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:02:07,504 INFO L290 TraceCheckUtils]: 48: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:02:07,504 INFO L272 TraceCheckUtils]: 47: Hoare triple {5942#(or (and (or (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (not (< main_~p~0 0)) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= (mod main_~p~0 2) 0))) (< main_~d~0 0) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:02:07,506 INFO L290 TraceCheckUtils]: 46: Hoare triple {5942#(or (and (or (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (not (< main_~p~0 0)) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= (mod main_~p~0 2) 0))) (< main_~d~0 0) (<= main_~d~0 main_~r~0))} assume !false; {5942#(or (and (or (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (not (< main_~p~0 0)) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= (mod main_~p~0 2) 0))) (< main_~d~0 0) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 12:02:07,620 INFO L290 TraceCheckUtils]: 45: Hoare triple {5994#(or (and (or (and (not (= (mod (div (* main_~p~0 2) 2) 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0))))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0 1)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)))) (not (< main_~p~0 0)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* main_~d~0 2) main_~r~0) (not (<= (+ main_~d~0 (div main_~d~0 2)) main_~r~0)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5942#(or (and (or (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (not (< main_~p~0 0)) (not (<= (+ (div (div main_~d~0 2) 2) (div main_~d~0 2)) main_~r~0)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= (mod main_~p~0 2) 0))) (< main_~d~0 0) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 12:02:07,621 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5550#true} {5994#(or (and (or (and (not (= (mod (div (* main_~p~0 2) 2) 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0))))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0 1)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)))) (not (< main_~p~0 0)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* main_~d~0 2) main_~r~0) (not (<= (+ main_~d~0 (div main_~d~0 2)) main_~r~0)))} #84#return; {5994#(or (and (or (and (not (= (mod (div (* main_~p~0 2) 2) 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0))))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0 1)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)))) (not (< main_~p~0 0)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* main_~d~0 2) main_~r~0) (not (<= (+ main_~d~0 (div main_~d~0 2)) main_~r~0)))} is VALID [2022-04-27 12:02:07,621 INFO L290 TraceCheckUtils]: 43: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:02:07,621 INFO L290 TraceCheckUtils]: 42: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:02:07,621 INFO L290 TraceCheckUtils]: 41: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:02:07,621 INFO L272 TraceCheckUtils]: 40: Hoare triple {5994#(or (and (or (and (not (= (mod (div (* main_~p~0 2) 2) 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0))))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0 1)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)))) (not (< main_~p~0 0)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* main_~d~0 2) main_~r~0) (not (<= (+ main_~d~0 (div main_~d~0 2)) main_~r~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:02:07,622 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5550#true} {5994#(or (and (or (and (not (= (mod (div (* main_~p~0 2) 2) 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0))))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0 1)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)))) (not (< main_~p~0 0)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* main_~d~0 2) main_~r~0) (not (<= (+ main_~d~0 (div main_~d~0 2)) main_~r~0)))} #82#return; {5994#(or (and (or (and (not (= (mod (div (* main_~p~0 2) 2) 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0))))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0 1)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)))) (not (< main_~p~0 0)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* main_~d~0 2) main_~r~0) (not (<= (+ main_~d~0 (div main_~d~0 2)) main_~r~0)))} is VALID [2022-04-27 12:02:07,622 INFO L290 TraceCheckUtils]: 38: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:02:07,622 INFO L290 TraceCheckUtils]: 37: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:02:07,622 INFO L290 TraceCheckUtils]: 36: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:02:07,622 INFO L272 TraceCheckUtils]: 35: Hoare triple {5994#(or (and (or (and (not (= (mod (div (* main_~p~0 2) 2) 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0))))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0 1)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)))) (not (< main_~p~0 0)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* main_~d~0 2) main_~r~0) (not (<= (+ main_~d~0 (div main_~d~0 2)) main_~r~0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:02:07,623 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5550#true} {5994#(or (and (or (and (not (= (mod (div (* main_~p~0 2) 2) 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0))))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0 1)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)))) (not (< main_~p~0 0)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* main_~d~0 2) main_~r~0) (not (<= (+ main_~d~0 (div main_~d~0 2)) main_~r~0)))} #80#return; {5994#(or (and (or (and (not (= (mod (div (* main_~p~0 2) 2) 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0))))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0 1)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)))) (not (< main_~p~0 0)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* main_~d~0 2) main_~r~0) (not (<= (+ main_~d~0 (div main_~d~0 2)) main_~r~0)))} is VALID [2022-04-27 12:02:07,623 INFO L290 TraceCheckUtils]: 33: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:02:07,623 INFO L290 TraceCheckUtils]: 32: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:02:07,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:02:07,624 INFO L272 TraceCheckUtils]: 30: Hoare triple {5994#(or (and (or (and (not (= (mod (div (* main_~p~0 2) 2) 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0))))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0 1)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)))) (not (< main_~p~0 0)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* main_~d~0 2) main_~r~0) (not (<= (+ main_~d~0 (div main_~d~0 2)) main_~r~0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:02:07,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {5994#(or (and (or (and (not (= (mod (div (* main_~p~0 2) 2) 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0))))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0 1)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)))) (not (< main_~p~0 0)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* main_~d~0 2) main_~r~0) (not (<= (+ main_~d~0 (div main_~d~0 2)) main_~r~0)))} assume !false; {5994#(or (and (or (and (not (= (mod (div (* main_~p~0 2) 2) 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0))))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0 1)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)))) (not (< main_~p~0 0)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* main_~d~0 2) main_~r~0) (not (<= (+ main_~d~0 (div main_~d~0 2)) main_~r~0)))} is VALID [2022-04-27 12:02:07,630 INFO L290 TraceCheckUtils]: 28: Hoare triple {6046#(or (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 3) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (div (* main_~d~0 4) 2) 2)) (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5994#(or (and (or (and (not (= (mod (div (* main_~p~0 2) 2) 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0))))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0 1)) main_~r~0 (* (- 1) (div (div (* main_~d~0 2) 2) 2)))) (not (< main_~p~0 0)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* main_~d~0 2) main_~r~0) (not (<= (+ main_~d~0 (div main_~d~0 2)) main_~r~0)))} is VALID [2022-04-27 12:02:07,631 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5550#true} {6046#(or (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 3) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (div (* main_~d~0 4) 2) 2)) (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)))))} #84#return; {6046#(or (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 3) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (div (* main_~d~0 4) 2) 2)) (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)))))} is VALID [2022-04-27 12:02:07,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:02:07,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:02:07,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:02:07,631 INFO L272 TraceCheckUtils]: 23: Hoare triple {6046#(or (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 3) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (div (* main_~d~0 4) 2) 2)) (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:02:07,632 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5550#true} {6046#(or (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 3) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (div (* main_~d~0 4) 2) 2)) (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)))))} #82#return; {6046#(or (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 3) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (div (* main_~d~0 4) 2) 2)) (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)))))} is VALID [2022-04-27 12:02:07,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:02:07,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:02:07,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:02:07,632 INFO L272 TraceCheckUtils]: 18: Hoare triple {6046#(or (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 3) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (div (* main_~d~0 4) 2) 2)) (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:02:07,633 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5550#true} {6046#(or (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 3) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (div (* main_~d~0 4) 2) 2)) (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)))))} #80#return; {6046#(or (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 3) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (div (* main_~d~0 4) 2) 2)) (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)))))} is VALID [2022-04-27 12:02:07,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:02:07,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:02:07,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:02:07,633 INFO L272 TraceCheckUtils]: 13: Hoare triple {6046#(or (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 3) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (div (* main_~d~0 4) 2) 2)) (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:02:07,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {6046#(or (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 3) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (div (* main_~d~0 4) 2) 2)) (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)))))} assume !false; {6046#(or (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 3) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (div (* main_~d~0 4) 2) 2)) (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)))))} is VALID [2022-04-27 12:02:07,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {5550#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {6046#(or (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 3) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (div (* main_~d~0 4) 2) 2)) (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)))))} is VALID [2022-04-27 12:02:07,636 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5550#true} {5550#true} #78#return; {5550#true} is VALID [2022-04-27 12:02:07,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:02:07,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {5550#true} assume !(0 == ~cond); {5550#true} is VALID [2022-04-27 12:02:07,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {5550#true} ~cond := #in~cond; {5550#true} is VALID [2022-04-27 12:02:07,636 INFO L272 TraceCheckUtils]: 6: Hoare triple {5550#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {5550#true} is VALID [2022-04-27 12:02:07,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {5550#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {5550#true} is VALID [2022-04-27 12:02:07,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {5550#true} call #t~ret6 := main(); {5550#true} is VALID [2022-04-27 12:02:07,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5550#true} {5550#true} #94#return; {5550#true} is VALID [2022-04-27 12:02:07,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-27 12:02:07,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {5550#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5550#true} is VALID [2022-04-27 12:02:07,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {5550#true} call ULTIMATE.init(); {5550#true} is VALID [2022-04-27 12:02:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 26 proven. 24 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-27 12:02:07,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:02:07,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586219947] [2022-04-27 12:02:07,638 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:02:07,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411785674] [2022-04-27 12:02:07,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411785674] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:02:07,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:02:07,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2022-04-27 12:02:07,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792644369] [2022-04-27 12:02:07,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:02:07,639 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 13 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (28), 11 states have call predecessors, (28), 11 states have call successors, (28) Word has length 94 [2022-04-27 12:02:07,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:02:07,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 13 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (28), 11 states have call predecessors, (28), 11 states have call successors, (28) [2022-04-27 12:02:09,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:02:09,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 12:02:09,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:02:09,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 12:02:09,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=296, Unknown=1, NotChecked=0, Total=380 [2022-04-27 12:02:09,005 INFO L87 Difference]: Start difference. First operand 100 states and 116 transitions. Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 13 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (28), 11 states have call predecessors, (28), 11 states have call successors, (28) [2022-04-27 12:02:22,115 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse44 (div c_main_~p~0 2))) (let ((.cse48 (+ .cse44 1))) (let ((.cse24 (= (mod c_main_~d~0 2) 0)) (.cse3 (= (mod c_main_~p~0 2) 0)) (.cse43 (< c_main_~p~0 0)) (.cse42 (< c_main_~d~0 0)) (.cse21 (div c_main_~d~0 2)) (.cse45 (div .cse48 2)) (.cse10 (= (mod .cse48 2) 0)) (.cse16 (= (mod .cse44 2) 0)) (.cse1 (mod c_main_~B~0 4294967296)) (.cse47 (div .cse44 2)) (.cse46 (< .cse44 0))) (let ((.cse15 (not .cse46)) (.cse17 (* .cse1 (+ c_main_~q~0 .cse44 .cse47 1))) (.cse19 (* .cse1 (+ c_main_~q~0 .cse44 .cse47))) (.cse18 (and (not .cse16) .cse46)) (.cse5 (not .cse10)) (.cse8 (* (+ c_main_~q~0 .cse45 .cse44 1) .cse1)) (.cse9 (* .cse1 (+ c_main_~q~0 .cse45 2 .cse44))) (.cse36 (* .cse1 (+ c_main_~q~0 c_main_~p~0 .cse44))) (.cse2 (* (- 1) c_main_~d~0)) (.cse35 (* (+ c_main_~q~0 c_main_~p~0 .cse44 1) .cse1)) (.cse23 (+ .cse21 1)) (.cse25 (not .cse42)) (.cse37 (* (+ c_main_~q~0 .cse44 1) .cse1)) (.cse4 (not .cse43)) (.cse0 (mod c_main_~A~0 4294967296)) (.cse38 (* (+ c_main_~q~0 .cse44) .cse1)) (.cse7 (* (- 1) .cse21)) (.cse20 (and (not .cse3) .cse43)) (.cse34 (and .cse42 (not .cse24)))) (and (or (not (<= c_main_~d~0 c_main_~r~0)) (= .cse0 (+ (* .cse1 (+ c_main_~q~0 c_main_~p~0)) .cse2 c_main_~r~0))) (or (let ((.cse13 (= (mod .cse23 2) 0)) (.cse22 (div .cse23 2))) (let ((.cse14 (not (<= (+ 2 .cse21 .cse22) c_main_~r~0))) (.cse6 (* (- 1) .cse22)) (.cse11 (not .cse13)) (.cse12 (not (<= (+ .cse21 .cse22 1) c_main_~r~0)))) (and (or .cse3 .cse4 (and (or (and (or .cse5 (= (+ .cse6 (- 1) c_main_~r~0 .cse7 .cse8) .cse0)) (or (= .cse0 (+ .cse6 (- 1) .cse9 c_main_~r~0 .cse7)) .cse10)) .cse11 .cse12) (or .cse13 (and (or .cse5 (= .cse0 (+ .cse6 (- 2) c_main_~r~0 .cse7 .cse8))) (or (= (+ .cse6 (- 2) .cse9 c_main_~r~0 .cse7) .cse0) .cse10)) .cse14))) (or (and (or .cse13 .cse14 (and (or .cse15 .cse16 (= (+ .cse6 (- 2) .cse17 c_main_~r~0 .cse7) .cse0)) (or .cse18 (= (+ .cse6 (- 2) .cse19 c_main_~r~0 .cse7) .cse0)))) (or (and (or .cse18 (= .cse0 (+ .cse6 (- 1) .cse19 c_main_~r~0 .cse7))) (or .cse15 .cse16 (= (+ .cse6 (- 1) .cse17 c_main_~r~0 .cse7) .cse0))) .cse11 .cse12)) .cse20)))) .cse24 .cse25) (or (let ((.cse33 (< .cse21 0)) (.cse30 (= 0 (mod .cse21 2))) (.cse32 (div .cse21 2))) (let ((.cse26 (not (<= (+ .cse32 .cse21) c_main_~r~0))) (.cse28 (and .cse33 (not .cse30))) (.cse29 (not .cse33)) (.cse31 (not (<= (+ .cse32 .cse21 1) c_main_~r~0))) (.cse27 (* (- 1) .cse32))) (and (or (and (or .cse26 (and (or .cse15 .cse16 (= (+ .cse17 c_main_~r~0 .cse7 .cse27) .cse0)) (or .cse18 (= (+ .cse19 c_main_~r~0 .cse7 .cse27) .cse0))) .cse28) (or .cse29 .cse30 (and (or .cse15 .cse16 (= .cse0 (+ (- 1) .cse17 c_main_~r~0 .cse7 .cse27))) (or (= .cse0 (+ (- 1) .cse19 c_main_~r~0 .cse7 .cse27)) .cse18)) .cse31)) .cse20) (or (and (or .cse26 .cse28 (and (or (= .cse0 (+ .cse9 c_main_~r~0 .cse7 .cse27)) .cse10) (or .cse5 (= .cse0 (+ c_main_~r~0 .cse7 .cse27 .cse8))))) (or .cse29 .cse30 .cse31 (and (or .cse5 (= .cse0 (+ (- 1) c_main_~r~0 .cse7 .cse27 .cse8))) (or (= .cse0 (+ (- 1) .cse9 c_main_~r~0 .cse7 .cse27)) .cse10)))) .cse3 .cse4)))) .cse34) (or (not (<= (+ c_main_~d~0 .cse21) c_main_~r~0)) .cse34 (and (or (= .cse0 (+ .cse2 c_main_~r~0 .cse7 .cse35)) .cse3 .cse4) (or (= .cse0 (+ .cse36 .cse2 c_main_~r~0 .cse7)) .cse20))) (or (not (<= (+ c_main_~d~0 .cse21 1) c_main_~r~0)) (and (or (= .cse0 (+ (- 1) .cse36 .cse2 c_main_~r~0 .cse7)) .cse20) (or (= .cse0 (+ (- 1) .cse2 c_main_~r~0 .cse7 .cse35)) .cse3 .cse4)) .cse24 .cse25) (or (and (or .cse3 (= .cse0 (+ (- 1) c_main_~r~0 .cse7 .cse37)) .cse4) (or (= .cse0 (+ (- 1) .cse38 c_main_~r~0 .cse7)) .cse20)) (not (<= .cse23 c_main_~r~0)) .cse24 .cse25) (let ((.cse41 (* c_main_~d~0 4))) (or (not (<= (* 3 c_main_~d~0) c_main_~r~0)) (= .cse0 (let ((.cse39 (div .cse41 2))) (+ (* (- 1) (div .cse39 2)) (* .cse1 (let ((.cse40 (div (* c_main_~p~0 4) 2))) (+ c_main_~q~0 (div .cse40 2) .cse40))) c_main_~r~0 (* (- 1) .cse39)))) (<= .cse41 c_main_~r~0))) (= (+ c_main_~r~0 (* c_main_~q~0 .cse1)) .cse0) (or (and (or (= .cse0 (+ c_main_~r~0 .cse7 .cse37)) .cse3 .cse4) (or (= .cse0 (+ .cse38 c_main_~r~0 .cse7)) .cse20)) .cse34 (not (<= .cse21 c_main_~r~0)))))))) is different from false [2022-04-27 12:02:30,928 WARN L232 SmtUtils]: Spent 5.84s on a formula simplification that was a NOOP. DAG size: 115 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 12:03:21,022 WARN L232 SmtUtils]: Spent 37.74s on a formula simplification. DAG size of input: 207 DAG size of output: 196 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 12:03:27,390 WARN L232 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 96 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 12:03:58,345 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:04:35,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:04:35,532 INFO L93 Difference]: Finished difference Result 232 states and 304 transitions. [2022-04-27 12:04:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-27 12:04:35,533 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 13 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (28), 11 states have call predecessors, (28), 11 states have call successors, (28) Word has length 94 [2022-04-27 12:04:35,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:04:35,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 13 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (28), 11 states have call predecessors, (28), 11 states have call successors, (28) [2022-04-27 12:04:35,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 203 transitions. [2022-04-27 12:04:35,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 13 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (28), 11 states have call predecessors, (28), 11 states have call successors, (28) [2022-04-27 12:04:35,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 203 transitions. [2022-04-27 12:04:35,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 203 transitions. [2022-04-27 12:04:37,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:04:37,313 INFO L225 Difference]: With dead ends: 232 [2022-04-27 12:04:37,313 INFO L226 Difference]: Without dead ends: 194 [2022-04-27 12:04:37,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 95.9s TimeCoverageRelationStatistics Valid=179, Invalid=692, Unknown=3, NotChecked=56, Total=930 [2022-04-27 12:04:37,315 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 76 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 200 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 24.4s IncrementalHoareTripleChecker+Time [2022-04-27 12:04:37,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 366 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 701 Invalid, 1 Unknown, 1 Unchecked, 24.4s Time] [2022-04-27 12:04:37,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-04-27 12:04:37,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 171. [2022-04-27 12:04:37,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:04:37,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 171 states, 103 states have (on average 1.145631067961165) internal successors, (118), 106 states have internal predecessors, (118), 48 states have call successors, (48), 20 states have call predecessors, (48), 19 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-27 12:04:37,498 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 171 states, 103 states have (on average 1.145631067961165) internal successors, (118), 106 states have internal predecessors, (118), 48 states have call successors, (48), 20 states have call predecessors, (48), 19 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-27 12:04:37,498 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 171 states, 103 states have (on average 1.145631067961165) internal successors, (118), 106 states have internal predecessors, (118), 48 states have call successors, (48), 20 states have call predecessors, (48), 19 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-27 12:04:37,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:04:37,504 INFO L93 Difference]: Finished difference Result 194 states and 250 transitions. [2022-04-27 12:04:37,504 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 250 transitions. [2022-04-27 12:04:37,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:04:37,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:04:37,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 103 states have (on average 1.145631067961165) internal successors, (118), 106 states have internal predecessors, (118), 48 states have call successors, (48), 20 states have call predecessors, (48), 19 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) Second operand 194 states. [2022-04-27 12:04:37,506 INFO L87 Difference]: Start difference. First operand has 171 states, 103 states have (on average 1.145631067961165) internal successors, (118), 106 states have internal predecessors, (118), 48 states have call successors, (48), 20 states have call predecessors, (48), 19 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) Second operand 194 states. [2022-04-27 12:04:37,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:04:37,511 INFO L93 Difference]: Finished difference Result 194 states and 250 transitions. [2022-04-27 12:04:37,511 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 250 transitions. [2022-04-27 12:04:37,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:04:37,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:04:37,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:04:37,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:04:37,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 103 states have (on average 1.145631067961165) internal successors, (118), 106 states have internal predecessors, (118), 48 states have call successors, (48), 20 states have call predecessors, (48), 19 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-27 12:04:37,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 212 transitions. [2022-04-27 12:04:37,517 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 212 transitions. Word has length 94 [2022-04-27 12:04:37,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:04:37,518 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 212 transitions. [2022-04-27 12:04:37,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 13 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (28), 11 states have call predecessors, (28), 11 states have call successors, (28) [2022-04-27 12:04:37,518 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 212 transitions. [2022-04-27 12:04:37,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-27 12:04:37,519 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:04:37,519 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:04:37,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 12:04:37,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 12:04:37,743 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:04:37,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:04:37,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1451809020, now seen corresponding path program 3 times [2022-04-27 12:04:37,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:04:37,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571179700] [2022-04-27 12:04:37,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:04:37,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:04:37,755 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:04:37,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1908672733] [2022-04-27 12:04:37,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:04:37,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:04:37,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:04:37,764 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:04:37,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 12:04:37,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-04-27 12:04:37,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:04:37,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-27 12:04:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:04:37,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:04:39,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {7127#true} call ULTIMATE.init(); {7127#true} is VALID [2022-04-27 12:04:39,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {7127#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7127#true} is VALID [2022-04-27 12:04:39,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:04:39,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7127#true} {7127#true} #94#return; {7127#true} is VALID [2022-04-27 12:04:39,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {7127#true} call #t~ret6 := main(); {7127#true} is VALID [2022-04-27 12:04:39,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {7127#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {7127#true} is VALID [2022-04-27 12:04:39,769 INFO L272 TraceCheckUtils]: 6: Hoare triple {7127#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:04:39,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {7127#true} ~cond := #in~cond; {7153#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:04:39,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {7153#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {7157#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:04:39,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {7157#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {7157#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:04:39,770 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7157#(not (= |assume_abort_if_not_#in~cond| 0))} {7127#true} #78#return; {7164#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-27 12:04:39,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {7164#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {7168#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 0 main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 1))} is VALID [2022-04-27 12:04:39,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {7168#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 0 main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 1))} assume !false; {7168#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 0 main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 1))} is VALID [2022-04-27 12:04:39,771 INFO L272 TraceCheckUtils]: 13: Hoare triple {7168#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 0 main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:04:39,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:04:39,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:04:39,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:04:39,772 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7127#true} {7168#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 0 main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 1))} #80#return; {7168#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 0 main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 1))} is VALID [2022-04-27 12:04:39,772 INFO L272 TraceCheckUtils]: 18: Hoare triple {7168#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 0 main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:04:39,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:04:39,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:04:39,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:04:39,773 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7127#true} {7168#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 0 main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 1))} #82#return; {7168#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 0 main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 1))} is VALID [2022-04-27 12:04:39,773 INFO L272 TraceCheckUtils]: 23: Hoare triple {7168#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 0 main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:04:39,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:04:39,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:04:39,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:04:39,773 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7127#true} {7168#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 0 main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 1))} #84#return; {7168#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 0 main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 1))} is VALID [2022-04-27 12:04:39,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {7168#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 0 main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7220#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= 0 main_~r~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296))} is VALID [2022-04-27 12:04:39,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {7220#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= 0 main_~r~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296))} assume !false; {7220#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= 0 main_~r~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296))} is VALID [2022-04-27 12:04:39,775 INFO L272 TraceCheckUtils]: 30: Hoare triple {7220#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= 0 main_~r~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:04:39,775 INFO L290 TraceCheckUtils]: 31: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:04:39,775 INFO L290 TraceCheckUtils]: 32: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:04:39,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:04:39,776 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7127#true} {7220#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= 0 main_~r~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296))} #80#return; {7220#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= 0 main_~r~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296))} is VALID [2022-04-27 12:04:39,776 INFO L272 TraceCheckUtils]: 35: Hoare triple {7220#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= 0 main_~r~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:04:39,776 INFO L290 TraceCheckUtils]: 36: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:04:39,776 INFO L290 TraceCheckUtils]: 37: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:04:39,776 INFO L290 TraceCheckUtils]: 38: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:04:39,776 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7127#true} {7220#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= 0 main_~r~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296))} #82#return; {7220#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= 0 main_~r~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296))} is VALID [2022-04-27 12:04:39,776 INFO L272 TraceCheckUtils]: 40: Hoare triple {7220#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= 0 main_~r~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:04:39,777 INFO L290 TraceCheckUtils]: 41: Hoare triple {7127#true} ~cond := #in~cond; {7260#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:04:39,777 INFO L290 TraceCheckUtils]: 42: Hoare triple {7260#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7264#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:04:39,777 INFO L290 TraceCheckUtils]: 43: Hoare triple {7264#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7264#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:04:39,778 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7264#(not (= |__VERIFIER_assert_#in~cond| 0))} {7220#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= 0 main_~r~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296))} #84#return; {7220#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= 0 main_~r~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296))} is VALID [2022-04-27 12:04:39,779 INFO L290 TraceCheckUtils]: 45: Hoare triple {7220#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= 0 main_~r~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7274#(and (<= 0 main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 4))} is VALID [2022-04-27 12:04:39,779 INFO L290 TraceCheckUtils]: 46: Hoare triple {7274#(and (<= 0 main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 4))} assume !false; {7274#(and (<= 0 main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 4))} is VALID [2022-04-27 12:04:39,779 INFO L272 TraceCheckUtils]: 47: Hoare triple {7274#(and (<= 0 main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 4))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:04:39,779 INFO L290 TraceCheckUtils]: 48: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:04:39,779 INFO L290 TraceCheckUtils]: 49: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:04:39,779 INFO L290 TraceCheckUtils]: 50: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:04:39,780 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7127#true} {7274#(and (<= 0 main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 4))} #80#return; {7274#(and (<= 0 main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 4))} is VALID [2022-04-27 12:04:39,780 INFO L272 TraceCheckUtils]: 52: Hoare triple {7274#(and (<= 0 main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 4))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:04:39,780 INFO L290 TraceCheckUtils]: 53: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:04:39,780 INFO L290 TraceCheckUtils]: 54: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:04:39,780 INFO L290 TraceCheckUtils]: 55: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:04:39,780 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {7127#true} {7274#(and (<= 0 main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 4))} #82#return; {7274#(and (<= 0 main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 4))} is VALID [2022-04-27 12:04:39,780 INFO L272 TraceCheckUtils]: 57: Hoare triple {7274#(and (<= 0 main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:04:39,780 INFO L290 TraceCheckUtils]: 58: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:04:39,781 INFO L290 TraceCheckUtils]: 59: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:04:39,781 INFO L290 TraceCheckUtils]: 60: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:04:39,781 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {7127#true} {7274#(and (<= 0 main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 4))} #84#return; {7274#(and (<= 0 main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 4))} is VALID [2022-04-27 12:04:39,781 INFO L290 TraceCheckUtils]: 62: Hoare triple {7274#(and (<= 0 main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 4))} assume !(~r~0 >= ~d~0); {7274#(and (<= 0 main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 4))} is VALID [2022-04-27 12:04:39,782 INFO L290 TraceCheckUtils]: 63: Hoare triple {7274#(and (<= 0 main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 4))} assume !false; {7274#(and (<= 0 main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 4))} is VALID [2022-04-27 12:04:39,782 INFO L272 TraceCheckUtils]: 64: Hoare triple {7274#(and (<= 0 main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 4))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:04:39,782 INFO L290 TraceCheckUtils]: 65: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:04:39,782 INFO L290 TraceCheckUtils]: 66: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:04:39,782 INFO L290 TraceCheckUtils]: 67: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:04:39,782 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7127#true} {7274#(and (<= 0 main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 4))} #86#return; {7274#(and (<= 0 main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 4))} is VALID [2022-04-27 12:04:39,783 INFO L272 TraceCheckUtils]: 69: Hoare triple {7274#(and (<= 0 main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:04:39,783 INFO L290 TraceCheckUtils]: 70: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:04:39,783 INFO L290 TraceCheckUtils]: 71: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:04:39,783 INFO L290 TraceCheckUtils]: 72: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:04:39,783 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7127#true} {7274#(and (<= 0 main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 4))} #88#return; {7274#(and (<= 0 main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 4))} is VALID [2022-04-27 12:04:39,784 INFO L290 TraceCheckUtils]: 74: Hoare triple {7274#(and (<= 0 main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296) (= main_~p~0 4))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {7220#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= 0 main_~r~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296))} is VALID [2022-04-27 12:04:39,784 INFO L290 TraceCheckUtils]: 75: Hoare triple {7220#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= 0 main_~r~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (< main_~r~0 4294967296))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7365#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 12:04:39,785 INFO L290 TraceCheckUtils]: 76: Hoare triple {7365#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} assume !false; {7365#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 12:04:39,785 INFO L272 TraceCheckUtils]: 77: Hoare triple {7365#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:04:39,785 INFO L290 TraceCheckUtils]: 78: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:04:39,785 INFO L290 TraceCheckUtils]: 79: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:04:39,785 INFO L290 TraceCheckUtils]: 80: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:04:39,785 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {7127#true} {7365#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #86#return; {7365#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 12:04:39,786 INFO L272 TraceCheckUtils]: 82: Hoare triple {7365#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:04:39,786 INFO L290 TraceCheckUtils]: 83: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:04:39,786 INFO L290 TraceCheckUtils]: 84: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:04:39,786 INFO L290 TraceCheckUtils]: 85: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:04:39,786 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {7127#true} {7365#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #88#return; {7365#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 12:04:39,788 INFO L290 TraceCheckUtils]: 87: Hoare triple {7365#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {7402#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 12:04:39,788 INFO L290 TraceCheckUtils]: 88: Hoare triple {7402#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7402#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 12:04:39,788 INFO L290 TraceCheckUtils]: 89: Hoare triple {7402#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !false; {7402#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 12:04:39,789 INFO L272 TraceCheckUtils]: 90: Hoare triple {7402#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:04:39,789 INFO L290 TraceCheckUtils]: 91: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:04:39,789 INFO L290 TraceCheckUtils]: 92: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:04:39,789 INFO L290 TraceCheckUtils]: 93: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:04:39,790 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {7127#true} {7402#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #86#return; {7402#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 12:04:39,791 INFO L272 TraceCheckUtils]: 95: Hoare triple {7402#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {7427#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:04:39,791 INFO L290 TraceCheckUtils]: 96: Hoare triple {7427#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7431#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:04:39,791 INFO L290 TraceCheckUtils]: 97: Hoare triple {7431#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7128#false} is VALID [2022-04-27 12:04:39,791 INFO L290 TraceCheckUtils]: 98: Hoare triple {7128#false} assume !false; {7128#false} is VALID [2022-04-27 12:04:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-04-27 12:04:39,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:05:07,840 WARN L232 SmtUtils]: Spent 5.91s on a formula simplification. DAG size of input: 31 DAG size of output: 14 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 12:05:15,712 INFO L290 TraceCheckUtils]: 98: Hoare triple {7128#false} assume !false; {7128#false} is VALID [2022-04-27 12:05:15,713 INFO L290 TraceCheckUtils]: 97: Hoare triple {7431#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7128#false} is VALID [2022-04-27 12:05:15,713 INFO L290 TraceCheckUtils]: 96: Hoare triple {7427#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7431#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:05:15,714 INFO L272 TraceCheckUtils]: 95: Hoare triple {7447#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {7427#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:05:15,714 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {7127#true} {7447#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #86#return; {7447#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 12:05:15,714 INFO L290 TraceCheckUtils]: 93: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:05:15,714 INFO L290 TraceCheckUtils]: 92: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:05:15,714 INFO L290 TraceCheckUtils]: 91: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:05:15,715 INFO L272 TraceCheckUtils]: 90: Hoare triple {7447#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:05:15,715 INFO L290 TraceCheckUtils]: 89: Hoare triple {7447#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !false; {7447#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 12:05:15,716 INFO L290 TraceCheckUtils]: 88: Hoare triple {7447#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7447#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 12:05:15,733 INFO L290 TraceCheckUtils]: 87: Hoare triple {7472#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {7447#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 12:05:15,733 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {7127#true} {7472#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} #88#return; {7472#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-27 12:05:15,734 INFO L290 TraceCheckUtils]: 85: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:05:15,734 INFO L290 TraceCheckUtils]: 84: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:05:15,734 INFO L290 TraceCheckUtils]: 83: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:05:15,734 INFO L272 TraceCheckUtils]: 82: Hoare triple {7472#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:05:15,740 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {7127#true} {7472#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} #86#return; {7472#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-27 12:05:15,740 INFO L290 TraceCheckUtils]: 80: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:05:15,740 INFO L290 TraceCheckUtils]: 79: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:05:15,740 INFO L290 TraceCheckUtils]: 78: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:05:15,740 INFO L272 TraceCheckUtils]: 77: Hoare triple {7472#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:05:15,742 INFO L290 TraceCheckUtils]: 76: Hoare triple {7472#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} assume !false; {7472#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-27 12:05:15,744 INFO L290 TraceCheckUtils]: 75: Hoare triple {7472#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7472#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-27 12:05:15,945 INFO L290 TraceCheckUtils]: 74: Hoare triple {7512#(and (or (and (or (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (+ (div main_~d~0 2) 1) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (+ (div main_~d~0 2) 1) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (div main_~d~0 2) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (div main_~d~0 2) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (div main_~d~0 2) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (or (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296)) (div (+ (div main_~d~0 2) 1) 2))) (or (= (div (+ (div main_~d~0 2) 1) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (+ (div (div main_~d~0 2) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (div main_~d~0 2) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (div (div main_~d~0 2) 2) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (div (div main_~d~0 2) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {7472#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-27 12:05:15,946 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7127#true} {7512#(and (or (and (or (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (+ (div main_~d~0 2) 1) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (+ (div main_~d~0 2) 1) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (div main_~d~0 2) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (div main_~d~0 2) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (div main_~d~0 2) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (or (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296)) (div (+ (div main_~d~0 2) 1) 2))) (or (= (div (+ (div main_~d~0 2) 1) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (+ (div (div main_~d~0 2) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (div main_~d~0 2) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (div (div main_~d~0 2) 2) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (div (div main_~d~0 2) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} #88#return; {7512#(and (or (and (or (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (+ (div main_~d~0 2) 1) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (+ (div main_~d~0 2) 1) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (div main_~d~0 2) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (div main_~d~0 2) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (div main_~d~0 2) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (or (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296)) (div (+ (div main_~d~0 2) 1) 2))) (or (= (div (+ (div main_~d~0 2) 1) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (+ (div (div main_~d~0 2) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (div main_~d~0 2) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (div (div main_~d~0 2) 2) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (div (div main_~d~0 2) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 12:05:15,946 INFO L290 TraceCheckUtils]: 72: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:05:15,946 INFO L290 TraceCheckUtils]: 71: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:05:15,946 INFO L290 TraceCheckUtils]: 70: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:05:15,946 INFO L272 TraceCheckUtils]: 69: Hoare triple {7512#(and (or (and (or (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (+ (div main_~d~0 2) 1) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (+ (div main_~d~0 2) 1) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (div main_~d~0 2) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (div main_~d~0 2) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (div main_~d~0 2) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (or (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296)) (div (+ (div main_~d~0 2) 1) 2))) (or (= (div (+ (div main_~d~0 2) 1) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (+ (div (div main_~d~0 2) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (div main_~d~0 2) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (div (div main_~d~0 2) 2) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (div (div main_~d~0 2) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:05:15,947 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7127#true} {7512#(and (or (and (or (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (+ (div main_~d~0 2) 1) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (+ (div main_~d~0 2) 1) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (div main_~d~0 2) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (div main_~d~0 2) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (div main_~d~0 2) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (or (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296)) (div (+ (div main_~d~0 2) 1) 2))) (or (= (div (+ (div main_~d~0 2) 1) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (+ (div (div main_~d~0 2) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (div main_~d~0 2) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (div (div main_~d~0 2) 2) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (div (div main_~d~0 2) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} #86#return; {7512#(and (or (and (or (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (+ (div main_~d~0 2) 1) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (+ (div main_~d~0 2) 1) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (div main_~d~0 2) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (div main_~d~0 2) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (div main_~d~0 2) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (or (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296)) (div (+ (div main_~d~0 2) 1) 2))) (or (= (div (+ (div main_~d~0 2) 1) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (+ (div (div main_~d~0 2) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (div main_~d~0 2) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (div (div main_~d~0 2) 2) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (div (div main_~d~0 2) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 12:05:15,947 INFO L290 TraceCheckUtils]: 67: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:05:15,947 INFO L290 TraceCheckUtils]: 66: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:05:15,947 INFO L290 TraceCheckUtils]: 65: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:05:15,947 INFO L272 TraceCheckUtils]: 64: Hoare triple {7512#(and (or (and (or (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (+ (div main_~d~0 2) 1) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (+ (div main_~d~0 2) 1) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (div main_~d~0 2) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (div main_~d~0 2) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (div main_~d~0 2) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (or (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296)) (div (+ (div main_~d~0 2) 1) 2))) (or (= (div (+ (div main_~d~0 2) 1) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (+ (div (div main_~d~0 2) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (div main_~d~0 2) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (div (div main_~d~0 2) 2) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (div (div main_~d~0 2) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:05:15,951 INFO L290 TraceCheckUtils]: 63: Hoare triple {7512#(and (or (and (or (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (+ (div main_~d~0 2) 1) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (+ (div main_~d~0 2) 1) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (div main_~d~0 2) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (div main_~d~0 2) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (div main_~d~0 2) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (or (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296)) (div (+ (div main_~d~0 2) 1) 2))) (or (= (div (+ (div main_~d~0 2) 1) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (+ (div (div main_~d~0 2) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (div main_~d~0 2) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (div (div main_~d~0 2) 2) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (div (div main_~d~0 2) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} assume !false; {7512#(and (or (and (or (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (+ (div main_~d~0 2) 1) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (+ (div main_~d~0 2) 1) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (div main_~d~0 2) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (div main_~d~0 2) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (div main_~d~0 2) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (or (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296)) (div (+ (div main_~d~0 2) 1) 2))) (or (= (div (+ (div main_~d~0 2) 1) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (+ (div (div main_~d~0 2) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (div main_~d~0 2) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (div (div main_~d~0 2) 2) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (div (div main_~d~0 2) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 12:05:15,955 INFO L290 TraceCheckUtils]: 62: Hoare triple {7512#(and (or (and (or (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (+ (div main_~d~0 2) 1) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (+ (div main_~d~0 2) 1) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (div main_~d~0 2) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (div main_~d~0 2) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (div main_~d~0 2) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (or (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296)) (div (+ (div main_~d~0 2) 1) 2))) (or (= (div (+ (div main_~d~0 2) 1) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (+ (div (div main_~d~0 2) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (div main_~d~0 2) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (div (div main_~d~0 2) 2) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (div (div main_~d~0 2) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} assume !(~r~0 >= ~d~0); {7512#(and (or (and (or (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (+ (div main_~d~0 2) 1) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (+ (div main_~d~0 2) 1) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (div main_~d~0 2) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (div main_~d~0 2) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (div main_~d~0 2) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (or (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296)) (div (+ (div main_~d~0 2) 1) 2))) (or (= (div (+ (div main_~d~0 2) 1) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (+ (div (div main_~d~0 2) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (div main_~d~0 2) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (div (div main_~d~0 2) 2) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (div (div main_~d~0 2) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 12:05:15,956 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {7127#true} {7512#(and (or (and (or (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (+ (div main_~d~0 2) 1) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (+ (div main_~d~0 2) 1) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (div main_~d~0 2) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (div main_~d~0 2) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (div main_~d~0 2) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (or (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296)) (div (+ (div main_~d~0 2) 1) 2))) (or (= (div (+ (div main_~d~0 2) 1) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (+ (div (div main_~d~0 2) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (div main_~d~0 2) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (div (div main_~d~0 2) 2) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (div (div main_~d~0 2) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} #84#return; {7512#(and (or (and (or (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (+ (div main_~d~0 2) 1) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (+ (div main_~d~0 2) 1) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (div main_~d~0 2) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (div main_~d~0 2) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (div main_~d~0 2) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (or (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296)) (div (+ (div main_~d~0 2) 1) 2))) (or (= (div (+ (div main_~d~0 2) 1) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (+ (div (div main_~d~0 2) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (div main_~d~0 2) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (div (div main_~d~0 2) 2) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (div (div main_~d~0 2) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 12:05:15,956 INFO L290 TraceCheckUtils]: 60: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:05:15,956 INFO L290 TraceCheckUtils]: 59: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:05:15,957 INFO L290 TraceCheckUtils]: 58: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:05:15,957 INFO L272 TraceCheckUtils]: 57: Hoare triple {7512#(and (or (and (or (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (+ (div main_~d~0 2) 1) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (+ (div main_~d~0 2) 1) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (div main_~d~0 2) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (div main_~d~0 2) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (div main_~d~0 2) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (or (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296)) (div (+ (div main_~d~0 2) 1) 2))) (or (= (div (+ (div main_~d~0 2) 1) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (+ (div (div main_~d~0 2) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (div main_~d~0 2) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (div (div main_~d~0 2) 2) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (div (div main_~d~0 2) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:05:15,957 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {7127#true} {7512#(and (or (and (or (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (+ (div main_~d~0 2) 1) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (+ (div main_~d~0 2) 1) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (div main_~d~0 2) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (div main_~d~0 2) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (div main_~d~0 2) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (or (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296)) (div (+ (div main_~d~0 2) 1) 2))) (or (= (div (+ (div main_~d~0 2) 1) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (+ (div (div main_~d~0 2) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (div main_~d~0 2) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (div (div main_~d~0 2) 2) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (div (div main_~d~0 2) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} #82#return; {7512#(and (or (and (or (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (+ (div main_~d~0 2) 1) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (+ (div main_~d~0 2) 1) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (div main_~d~0 2) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (div main_~d~0 2) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (div main_~d~0 2) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (or (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296)) (div (+ (div main_~d~0 2) 1) 2))) (or (= (div (+ (div main_~d~0 2) 1) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (+ (div (div main_~d~0 2) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (div main_~d~0 2) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (div (div main_~d~0 2) 2) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (div (div main_~d~0 2) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 12:05:15,958 INFO L290 TraceCheckUtils]: 55: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:05:15,958 INFO L290 TraceCheckUtils]: 54: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:05:15,958 INFO L290 TraceCheckUtils]: 53: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:05:15,958 INFO L272 TraceCheckUtils]: 52: Hoare triple {7512#(and (or (and (or (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (+ (div main_~d~0 2) 1) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (+ (div main_~d~0 2) 1) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (div main_~d~0 2) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (div main_~d~0 2) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (div main_~d~0 2) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (or (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296)) (div (+ (div main_~d~0 2) 1) 2))) (or (= (div (+ (div main_~d~0 2) 1) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (+ (div (div main_~d~0 2) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (div main_~d~0 2) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (div (div main_~d~0 2) 2) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (div (div main_~d~0 2) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:05:15,959 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7127#true} {7512#(and (or (and (or (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (+ (div main_~d~0 2) 1) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (+ (div main_~d~0 2) 1) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (div main_~d~0 2) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (div main_~d~0 2) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (div main_~d~0 2) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (or (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296)) (div (+ (div main_~d~0 2) 1) 2))) (or (= (div (+ (div main_~d~0 2) 1) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (+ (div (div main_~d~0 2) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (div main_~d~0 2) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (div (div main_~d~0 2) 2) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (div (div main_~d~0 2) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} #80#return; {7512#(and (or (and (or (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (+ (div main_~d~0 2) 1) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (+ (div main_~d~0 2) 1) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (div main_~d~0 2) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (div main_~d~0 2) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (div main_~d~0 2) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (or (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296)) (div (+ (div main_~d~0 2) 1) 2))) (or (= (div (+ (div main_~d~0 2) 1) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (+ (div (div main_~d~0 2) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (div main_~d~0 2) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (div (div main_~d~0 2) 2) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (div (div main_~d~0 2) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 12:05:15,959 INFO L290 TraceCheckUtils]: 50: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:05:15,959 INFO L290 TraceCheckUtils]: 49: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:05:15,959 INFO L290 TraceCheckUtils]: 48: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:05:15,959 INFO L272 TraceCheckUtils]: 47: Hoare triple {7512#(and (or (and (or (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (+ (div main_~d~0 2) 1) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (+ (div main_~d~0 2) 1) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (div main_~d~0 2) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (div main_~d~0 2) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (div main_~d~0 2) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (or (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296)) (div (+ (div main_~d~0 2) 1) 2))) (or (= (div (+ (div main_~d~0 2) 1) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (+ (div (div main_~d~0 2) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (div main_~d~0 2) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (div (div main_~d~0 2) 2) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (div (div main_~d~0 2) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:05:15,963 INFO L290 TraceCheckUtils]: 46: Hoare triple {7512#(and (or (and (or (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (+ (div main_~d~0 2) 1) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (+ (div main_~d~0 2) 1) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (div main_~d~0 2) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (div main_~d~0 2) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (div main_~d~0 2) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (or (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296)) (div (+ (div main_~d~0 2) 1) 2))) (or (= (div (+ (div main_~d~0 2) 1) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (+ (div (div main_~d~0 2) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (div main_~d~0 2) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (div (div main_~d~0 2) 2) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (div (div main_~d~0 2) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} assume !false; {7512#(and (or (and (or (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (+ (div main_~d~0 2) 1) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (+ (div main_~d~0 2) 1) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (div main_~d~0 2) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (div main_~d~0 2) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (div main_~d~0 2) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (or (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296)) (div (+ (div main_~d~0 2) 1) 2))) (or (= (div (+ (div main_~d~0 2) 1) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (+ (div (div main_~d~0 2) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (div main_~d~0 2) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (div (div main_~d~0 2) 2) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (div (div main_~d~0 2) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 12:05:15,992 INFO L290 TraceCheckUtils]: 45: Hoare triple {7472#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7512#(and (or (and (or (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (+ (div main_~d~0 2) 1) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (+ (div main_~d~0 2) 1) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (div (div main_~d~0 2) 2) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296)))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (div (div main_~d~0 2) 2) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) (* (div (+ (div main_~p~0 2) 1) 2) (mod main_~B~0 4294967296)))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (div (div main_~d~0 2) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) (mod main_~B~0 4294967296))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (or (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296)) (div (+ (div main_~d~0 2) 1) 2))) (or (= (div (+ (div main_~d~0 2) 1) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (+ (div (div main_~d~0 2) 2) 1) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (div (div main_~d~0 2) 2) 1) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (div (div main_~d~0 2) 2) (* (div (div main_~p~0 2) 2) (mod main_~B~0 4294967296))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (div (div main_~d~0 2) 2) (* (mod main_~B~0 4294967296) (+ (div (div main_~p~0 2) 2) 1))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 12:05:15,999 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7264#(not (= |__VERIFIER_assert_#in~cond| 0))} {7603#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))} #84#return; {7472#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-27 12:05:15,999 INFO L290 TraceCheckUtils]: 43: Hoare triple {7264#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7264#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:05:16,000 INFO L290 TraceCheckUtils]: 42: Hoare triple {7613#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7264#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:05:16,000 INFO L290 TraceCheckUtils]: 41: Hoare triple {7127#true} ~cond := #in~cond; {7613#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:05:16,000 INFO L272 TraceCheckUtils]: 40: Hoare triple {7603#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:05:16,001 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7127#true} {7603#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))} #82#return; {7603#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))} is VALID [2022-04-27 12:05:16,001 INFO L290 TraceCheckUtils]: 38: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:05:16,001 INFO L290 TraceCheckUtils]: 37: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:05:16,001 INFO L290 TraceCheckUtils]: 36: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:05:16,001 INFO L272 TraceCheckUtils]: 35: Hoare triple {7603#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:05:16,002 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7127#true} {7603#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))} #80#return; {7603#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))} is VALID [2022-04-27 12:05:16,002 INFO L290 TraceCheckUtils]: 33: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:05:16,002 INFO L290 TraceCheckUtils]: 32: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:05:16,002 INFO L290 TraceCheckUtils]: 31: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:05:16,002 INFO L272 TraceCheckUtils]: 30: Hoare triple {7603#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:05:16,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {7603#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))} assume !false; {7603#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))} is VALID [2022-04-27 12:05:16,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {7127#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7603#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))} is VALID [2022-04-27 12:05:16,452 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7127#true} {7127#true} #84#return; {7127#true} is VALID [2022-04-27 12:05:16,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:05:16,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:05:16,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:05:16,452 INFO L272 TraceCheckUtils]: 23: Hoare triple {7127#true} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:05:16,452 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7127#true} {7127#true} #82#return; {7127#true} is VALID [2022-04-27 12:05:16,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:05:16,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:05:16,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:05:16,453 INFO L272 TraceCheckUtils]: 18: Hoare triple {7127#true} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:05:16,453 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7127#true} {7127#true} #80#return; {7127#true} is VALID [2022-04-27 12:05:16,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:05:16,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:05:16,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:05:16,453 INFO L272 TraceCheckUtils]: 13: Hoare triple {7127#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:05:16,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {7127#true} assume !false; {7127#true} is VALID [2022-04-27 12:05:16,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {7127#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {7127#true} is VALID [2022-04-27 12:05:16,453 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7127#true} {7127#true} #78#return; {7127#true} is VALID [2022-04-27 12:05:16,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:05:16,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {7127#true} assume !(0 == ~cond); {7127#true} is VALID [2022-04-27 12:05:16,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {7127#true} ~cond := #in~cond; {7127#true} is VALID [2022-04-27 12:05:16,453 INFO L272 TraceCheckUtils]: 6: Hoare triple {7127#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {7127#true} is VALID [2022-04-27 12:05:16,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {7127#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {7127#true} is VALID [2022-04-27 12:05:16,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {7127#true} call #t~ret6 := main(); {7127#true} is VALID [2022-04-27 12:05:16,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7127#true} {7127#true} #94#return; {7127#true} is VALID [2022-04-27 12:05:16,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {7127#true} assume true; {7127#true} is VALID [2022-04-27 12:05:16,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {7127#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7127#true} is VALID [2022-04-27 12:05:16,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {7127#true} call ULTIMATE.init(); {7127#true} is VALID [2022-04-27 12:05:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 52 proven. 41 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-04-27 12:05:16,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:05:16,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571179700] [2022-04-27 12:05:16,455 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:05:16,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908672733] [2022-04-27 12:05:16,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908672733] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:05:16,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:05:16,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2022-04-27 12:05:16,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315464466] [2022-04-27 12:05:16,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:05:16,456 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 17 states have internal predecessors, (48), 10 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (31), 11 states have call predecessors, (31), 10 states have call successors, (31) Word has length 99 [2022-04-27 12:05:16,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:05:16,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 17 states have internal predecessors, (48), 10 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (31), 11 states have call predecessors, (31), 10 states have call successors, (31) [2022-04-27 12:05:18,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 111 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:05:18,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 12:05:18,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:05:18,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 12:05:18,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-04-27 12:05:18,848 INFO L87 Difference]: Start difference. First operand 171 states and 212 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 17 states have internal predecessors, (48), 10 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (31), 11 states have call predecessors, (31), 10 states have call successors, (31) [2022-04-27 12:05:49,830 WARN L232 SmtUtils]: Spent 26.70s on a formula simplification. DAG size of input: 132 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 12:06:03,820 WARN L232 SmtUtils]: Spent 10.20s on a formula simplification. DAG size of input: 42 DAG size of output: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 12:06:06,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:06:06,713 INFO L93 Difference]: Finished difference Result 228 states and 286 transitions. [2022-04-27 12:06:06,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 12:06:06,713 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 17 states have internal predecessors, (48), 10 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (31), 11 states have call predecessors, (31), 10 states have call successors, (31) Word has length 99 [2022-04-27 12:06:06,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:06:06,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 17 states have internal predecessors, (48), 10 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (31), 11 states have call predecessors, (31), 10 states have call successors, (31) [2022-04-27 12:06:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 129 transitions. [2022-04-27 12:06:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 17 states have internal predecessors, (48), 10 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (31), 11 states have call predecessors, (31), 10 states have call successors, (31) [2022-04-27 12:06:06,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 129 transitions. [2022-04-27 12:06:06,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 129 transitions. [2022-04-27 12:06:07,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:06:07,462 INFO L225 Difference]: With dead ends: 228 [2022-04-27 12:06:07,462 INFO L226 Difference]: Without dead ends: 198 [2022-04-27 12:06:07,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 177 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 45.9s TimeCoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2022-04-27 12:06:07,463 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 60 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-27 12:06:07,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 219 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-27 12:06:07,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-04-27 12:06:07,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2022-04-27 12:06:07,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:06:07,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand has 197 states, 119 states have (on average 1.1428571428571428) internal successors, (136), 125 states have internal predecessors, (136), 55 states have call successors, (55), 23 states have call predecessors, (55), 22 states have return successors, (53), 48 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 12:06:07,727 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand has 197 states, 119 states have (on average 1.1428571428571428) internal successors, (136), 125 states have internal predecessors, (136), 55 states have call successors, (55), 23 states have call predecessors, (55), 22 states have return successors, (53), 48 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 12:06:07,728 INFO L87 Difference]: Start difference. First operand 198 states. Second operand has 197 states, 119 states have (on average 1.1428571428571428) internal successors, (136), 125 states have internal predecessors, (136), 55 states have call successors, (55), 23 states have call predecessors, (55), 22 states have return successors, (53), 48 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 12:06:07,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:06:07,734 INFO L93 Difference]: Finished difference Result 198 states and 245 transitions. [2022-04-27 12:06:07,734 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 245 transitions. [2022-04-27 12:06:07,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:06:07,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:06:07,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 197 states, 119 states have (on average 1.1428571428571428) internal successors, (136), 125 states have internal predecessors, (136), 55 states have call successors, (55), 23 states have call predecessors, (55), 22 states have return successors, (53), 48 states have call predecessors, (53), 53 states have call successors, (53) Second operand 198 states. [2022-04-27 12:06:07,735 INFO L87 Difference]: Start difference. First operand has 197 states, 119 states have (on average 1.1428571428571428) internal successors, (136), 125 states have internal predecessors, (136), 55 states have call successors, (55), 23 states have call predecessors, (55), 22 states have return successors, (53), 48 states have call predecessors, (53), 53 states have call successors, (53) Second operand 198 states. [2022-04-27 12:06:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:06:07,741 INFO L93 Difference]: Finished difference Result 198 states and 245 transitions. [2022-04-27 12:06:07,741 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 245 transitions. [2022-04-27 12:06:07,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:06:07,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:06:07,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:06:07,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:06:07,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 119 states have (on average 1.1428571428571428) internal successors, (136), 125 states have internal predecessors, (136), 55 states have call successors, (55), 23 states have call predecessors, (55), 22 states have return successors, (53), 48 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 12:06:07,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 244 transitions. [2022-04-27 12:06:07,748 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 244 transitions. Word has length 99 [2022-04-27 12:06:07,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:06:07,748 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 244 transitions. [2022-04-27 12:06:07,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 17 states have internal predecessors, (48), 10 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (31), 11 states have call predecessors, (31), 10 states have call successors, (31) [2022-04-27 12:06:07,748 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 244 transitions. [2022-04-27 12:06:07,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-27 12:06:07,749 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:06:07,749 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:06:07,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 12:06:07,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:06:07,971 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:06:07,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:06:07,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1306280540, now seen corresponding path program 2 times [2022-04-27 12:06:07,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:06:07,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582221179] [2022-04-27 12:06:07,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:06:07,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:06:07,984 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:06:07,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [267736176] [2022-04-27 12:06:07,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:06:07,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:06:07,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:06:07,986 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:06:07,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 12:06:08,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:06:08,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:06:08,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-27 12:06:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:06:08,062 INFO L286 TraceCheckSpWp]: Computing forward predicates...