/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 12:55:25,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 12:55:25,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 12:55:26,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 12:55:26,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 12:55:26,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 12:55:26,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 12:55:26,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 12:55:26,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 12:55:26,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 12:55:26,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 12:55:26,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 12:55:26,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 12:55:26,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 12:55:26,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 12:55:26,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 12:55:26,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 12:55:26,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 12:55:26,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 12:55:26,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 12:55:26,033 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 12:55:26,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 12:55:26,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 12:55:26,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 12:55:26,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 12:55:26,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 12:55:26,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 12:55:26,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 12:55:26,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 12:55:26,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 12:55:26,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 12:55:26,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 12:55:26,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 12:55:26,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 12:55:26,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 12:55:26,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 12:55:26,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 12:55:26,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 12:55:26,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 12:55:26,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 12:55:26,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 12:55:26,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 12:55:26,054 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 12:55:26,062 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 12:55:26,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 12:55:26,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 12:55:26,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 12:55:26,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 12:55:26,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 12:55:26,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 12:55:26,063 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 12:55:26,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 12:55:26,063 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 12:55:26,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 12:55:26,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 12:55:26,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 12:55:26,063 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 12:55:26,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 12:55:26,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:55:26,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 12:55:26,064 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 12:55:26,064 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 12:55:26,064 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 12:55:26,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 12:55:26,064 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 12:55:26,064 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-28 12:55:26,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 12:55:26,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 12:55:26,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 12:55:26,251 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 12:55:26,251 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 12:55:26,252 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound5.c [2022-04-28 12:55:26,288 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b820091c/fbb6163f67594ca9bb8ef3ddb2941947/FLAG185699a3f [2022-04-28 12:55:26,628 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 12:55:26,628 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound5.c [2022-04-28 12:55:26,632 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b820091c/fbb6163f67594ca9bb8ef3ddb2941947/FLAG185699a3f [2022-04-28 12:55:26,640 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b820091c/fbb6163f67594ca9bb8ef3ddb2941947 [2022-04-28 12:55:26,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 12:55:26,642 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 12:55:26,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 12:55:26,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 12:55:26,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 12:55:26,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:55:26" (1/1) ... [2022-04-28 12:55:26,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78412138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:55:26, skipping insertion in model container [2022-04-28 12:55:26,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:55:26" (1/1) ... [2022-04-28 12:55:26,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 12:55:26,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 12:55:26,744 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-scaling/hard-ll_unwindbound5.c[538,551] [2022-04-28 12:55:26,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:55:26,771 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 12:55:26,781 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-scaling/hard-ll_unwindbound5.c[538,551] [2022-04-28 12:55:26,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:55:26,800 INFO L208 MainTranslator]: Completed translation [2022-04-28 12:55:26,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:55:26 WrapperNode [2022-04-28 12:55:26,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 12:55:26,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 12:55:26,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 12:55:26,801 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 12:55:26,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:55:26" (1/1) ... [2022-04-28 12:55:26,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:55:26" (1/1) ... [2022-04-28 12:55:26,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:55:26" (1/1) ... [2022-04-28 12:55:26,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:55:26" (1/1) ... [2022-04-28 12:55:26,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:55:26" (1/1) ... [2022-04-28 12:55:26,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:55:26" (1/1) ... [2022-04-28 12:55:26,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:55:26" (1/1) ... [2022-04-28 12:55:26,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 12:55:26,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 12:55:26,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 12:55:26,838 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 12:55:26,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:55:26" (1/1) ... [2022-04-28 12:55:26,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:55:26,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:55:26,866 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-28 12:55:26,867 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-28 12:55:26,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 12:55:26,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 12:55:26,908 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 12:55:26,908 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 12:55:26,908 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 12:55:26,908 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 12:55:26,908 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 12:55:26,908 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 12:55:26,908 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 12:55:26,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 12:55:26,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 12:55:26,909 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 12:55:26,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 12:55:26,909 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 12:55:26,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 12:55:26,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 12:55:26,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 12:55:26,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 12:55:26,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 12:55:26,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 12:55:26,965 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 12:55:26,966 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 12:55:27,160 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 12:55:27,164 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 12:55:27,165 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 12:55:27,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:55:27 BoogieIcfgContainer [2022-04-28 12:55:27,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 12:55:27,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 12:55:27,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 12:55:27,169 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 12:55:27,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 12:55:26" (1/3) ... [2022-04-28 12:55:27,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232a326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:55:27, skipping insertion in model container [2022-04-28 12:55:27,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:55:26" (2/3) ... [2022-04-28 12:55:27,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232a326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:55:27, skipping insertion in model container [2022-04-28 12:55:27,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:55:27" (3/3) ... [2022-04-28 12:55:27,171 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-ll_unwindbound5.c [2022-04-28 12:55:27,179 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 12:55:27,179 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 12:55:27,208 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 12:55:27,212 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5f3db51c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5850be79 [2022-04-28 12:55:27,213 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 12:55:27,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 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-28 12:55:27,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 12:55:27,225 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:55:27,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:55:27,225 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:55:27,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:55:27,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 1 times [2022-04-28 12:55:27,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:55:27,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [12712459] [2022-04-28 12:55:27,239 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:55:27,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 2 times [2022-04-28 12:55:27,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:55:27,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841871862] [2022-04-28 12:55:27,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:55:27,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:55:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:55:27,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 12:55:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:55:27,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {40#true} is VALID [2022-04-28 12:55:27,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 12:55:27,374 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-28 12:55:27,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 12:55:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:55:27,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 12:55:27,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 12:55:27,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 12:55:27,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-28 12:55:27,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 12:55:27,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {40#true} is VALID [2022-04-28 12:55:27,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 12:55:27,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-28 12:55:27,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret8 := main(); {40#true} is VALID [2022-04-28 12:55:27,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#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; {40#true} is VALID [2022-04-28 12:55:27,387 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-28 12:55:27,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 12:55:27,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 12:55:27,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 12:55:27,389 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-28 12:55:27,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {41#false} is VALID [2022-04-28 12:55:27,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-28 12:55:27,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-28 12:55:27,389 INFO L272 TraceCheckUtils]: 14: Hoare triple {41#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {41#false} is VALID [2022-04-28 12:55:27,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-28 12:55:27,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-28 12:55:27,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-28 12:55:27,390 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-28 12:55:27,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:55:27,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841871862] [2022-04-28 12:55:27,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841871862] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:55:27,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:55:27,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 12:55:27,394 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:55:27,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [12712459] [2022-04-28 12:55:27,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [12712459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:55:27,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:55:27,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 12:55:27,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455298371] [2022-04-28 12:55:27,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:55:27,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 18 [2022-04-28 12:55:27,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:55:27,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-28 12:55:27,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:27,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 12:55:27,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:55:27,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 12:55:27,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 12:55:27,460 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 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 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-28 12:55:27,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:27,640 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2022-04-28 12:55:27,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 12:55:27,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 18 [2022-04-28 12:55:27,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:55:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-28 12:55:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 12:55:27,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-28 12:55:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 12:55:27,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-28 12:55:27,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:27,751 INFO L225 Difference]: With dead ends: 66 [2022-04-28 12:55:27,751 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 12:55:27,753 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-28 12:55:27,755 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:55:27,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:55:27,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 12:55:27,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-28 12:55:27,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:55:27,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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-28 12:55:27,777 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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-28 12:55:27,778 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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-28 12:55:27,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:27,781 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-28 12:55:27,781 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-28 12:55:27,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:55:27,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:55:27,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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 33 states. [2022-04-28 12:55:27,782 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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 33 states. [2022-04-28 12:55:27,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:27,785 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-28 12:55:27,785 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-28 12:55:27,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:55:27,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:55:27,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:55:27,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:55:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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-28 12:55:27,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-28 12:55:27,789 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-28 12:55:27,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:55:27,789 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-28 12:55:27,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-28 12:55:27,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-28 12:55:27,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:27,824 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 12:55:27,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 12:55:27,824 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:55:27,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:55:27,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 12:55:27,825 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:55:27,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:55:27,825 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 1 times [2022-04-28 12:55:27,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:55:27,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1033746597] [2022-04-28 12:55:27,826 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:55:27,826 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 2 times [2022-04-28 12:55:27,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:55:27,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194928749] [2022-04-28 12:55:27,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:55:27,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:55:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:55:27,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 12:55:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:55:27,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {326#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {314#true} is VALID [2022-04-28 12:55:27,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-28 12:55:27,892 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {314#true} {314#true} #96#return; {314#true} is VALID [2022-04-28 12:55:27,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 12:55:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:55:27,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {314#true} ~cond := #in~cond; {314#true} is VALID [2022-04-28 12:55:27,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} assume !(0 == ~cond); {314#true} is VALID [2022-04-28 12:55:27,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-28 12:55:27,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} #80#return; {314#true} is VALID [2022-04-28 12:55:27,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {314#true} call ULTIMATE.init(); {326#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 12:55:27,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {314#true} is VALID [2022-04-28 12:55:27,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-28 12:55:27,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} #96#return; {314#true} is VALID [2022-04-28 12:55:27,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {314#true} call #t~ret8 := main(); {314#true} is VALID [2022-04-28 12:55:27,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {314#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; {314#true} is VALID [2022-04-28 12:55:27,912 INFO L272 TraceCheckUtils]: 6: Hoare triple {314#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {314#true} is VALID [2022-04-28 12:55:27,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {314#true} ~cond := #in~cond; {314#true} is VALID [2022-04-28 12:55:27,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {314#true} assume !(0 == ~cond); {314#true} is VALID [2022-04-28 12:55:27,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-28 12:55:27,912 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {314#true} {314#true} #80#return; {314#true} is VALID [2022-04-28 12:55:27,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {314#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {323#(= main_~q~0 0)} is VALID [2022-04-28 12:55:27,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {323#(= main_~q~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {323#(= main_~q~0 0)} is VALID [2022-04-28 12:55:27,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {323#(= main_~q~0 0)} assume !!(#t~post6 < 5);havoc #t~post6; {323#(= main_~q~0 0)} is VALID [2022-04-28 12:55:27,914 INFO L272 TraceCheckUtils]: 14: Hoare triple {323#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:55:27,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {324#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {325#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:55:27,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {325#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {315#false} is VALID [2022-04-28 12:55:27,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {315#false} assume !false; {315#false} is VALID [2022-04-28 12:55:27,918 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-28 12:55:27,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:55:27,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194928749] [2022-04-28 12:55:27,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194928749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:55:27,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:55:27,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:55:27,920 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:55:27,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1033746597] [2022-04-28 12:55:27,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1033746597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:55:27,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:55:27,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:55:27,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206068206] [2022-04-28 12:55:27,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:55:27,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 18 [2022-04-28 12:55:27,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:55:27,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 12:55:27,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:27,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:55:27,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:55:27,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:55:27,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:55:27,937 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 12:55:28,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:28,248 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-28 12:55:28,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 12:55:28,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 18 [2022-04-28 12:55:28,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:55:28,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 12:55:28,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-28 12:55:28,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 12:55:28,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-28 12:55:28,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-28 12:55:28,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:28,317 INFO L225 Difference]: With dead ends: 47 [2022-04-28 12:55:28,318 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 12:55:28,318 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-28 12:55:28,319 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:55:28,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 90 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:55:28,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 12:55:28,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-04-28 12:55:28,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:55:28,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 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-28 12:55:28,325 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 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-28 12:55:28,325 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 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-28 12:55:28,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:28,327 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-28 12:55:28,327 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-28 12:55:28,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:55:28,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:55:28,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 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 45 states. [2022-04-28 12:55:28,328 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 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 45 states. [2022-04-28 12:55:28,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:28,330 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-28 12:55:28,331 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-28 12:55:28,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:55:28,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:55:28,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:55:28,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:55:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 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-28 12:55:28,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-28 12:55:28,333 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18 [2022-04-28 12:55:28,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:55:28,333 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-28 12:55:28,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 12:55:28,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions. [2022-04-28 12:55:28,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:28,366 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-28 12:55:28,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 12:55:28,366 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:55:28,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:55:28,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 12:55:28,366 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:55:28,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:55:28,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 1 times [2022-04-28 12:55:28,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:55:28,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1540595606] [2022-04-28 12:55:28,367 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:55:28,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 2 times [2022-04-28 12:55:28,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:55:28,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997689114] [2022-04-28 12:55:28,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:55:28,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:55:28,379 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:55:28,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1039421556] [2022-04-28 12:55:28,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:55:28,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:55:28,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:55:28,381 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-28 12:55:28,381 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-28 12:55:28,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:55:28,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:55:28,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 12:55:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:55:28,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:55:28,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {593#true} is VALID [2022-04-28 12:55:28,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#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);~counter~0 := 0; {601#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:28,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#(<= ~counter~0 0)} assume true; {601#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:28,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#(<= ~counter~0 0)} {593#true} #96#return; {601#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:28,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {601#(<= ~counter~0 0)} call #t~ret8 := main(); {601#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:28,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {601#(<= ~counter~0 0)} 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; {601#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:28,576 INFO L272 TraceCheckUtils]: 6: Hoare triple {601#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {601#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:28,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {601#(<= ~counter~0 0)} ~cond := #in~cond; {601#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:28,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {601#(<= ~counter~0 0)} assume !(0 == ~cond); {601#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:28,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {601#(<= ~counter~0 0)} assume true; {601#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:28,577 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {601#(<= ~counter~0 0)} {601#(<= ~counter~0 0)} #80#return; {601#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:28,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {601#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {601#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:28,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {601#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {635#(<= |main_#t~post6| 0)} is VALID [2022-04-28 12:55:28,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {635#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {594#false} is VALID [2022-04-28 12:55:28,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {594#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {594#false} is VALID [2022-04-28 12:55:28,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {594#false} assume !(#t~post7 < 5);havoc #t~post7; {594#false} is VALID [2022-04-28 12:55:28,579 INFO L272 TraceCheckUtils]: 16: Hoare triple {594#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {594#false} is VALID [2022-04-28 12:55:28,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {594#false} ~cond := #in~cond; {594#false} is VALID [2022-04-28 12:55:28,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {594#false} assume 0 == ~cond; {594#false} is VALID [2022-04-28 12:55:28,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {594#false} assume !false; {594#false} is VALID [2022-04-28 12:55:28,580 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-28 12:55:28,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:55:28,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:55:28,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997689114] [2022-04-28 12:55:28,580 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:55:28,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039421556] [2022-04-28 12:55:28,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039421556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:55:28,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:55:28,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:55:28,581 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:55:28,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1540595606] [2022-04-28 12:55:28,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1540595606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:55:28,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:55:28,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:55:28,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007339075] [2022-04-28 12:55:28,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:55:28,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 12:55:28,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:55:28,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:55:28,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:28,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 12:55:28,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:55:28,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 12:55:28,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 12:55:28,597 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:55:28,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:28,668 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-04-28 12:55:28,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 12:55:28,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 12:55:28,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:55:28,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:55:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-28 12:55:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:55:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-28 12:55:28,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-28 12:55:28,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:28,714 INFO L225 Difference]: With dead ends: 52 [2022-04-28 12:55:28,714 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 12:55:28,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 12:55:28,715 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:55:28,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:55:28,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 12:55:28,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 12:55:28,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:55:28,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 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-28 12:55:28,727 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 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-28 12:55:28,727 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 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-28 12:55:28,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:28,729 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-28 12:55:28,729 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-28 12:55:28,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:55:28,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:55:28,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 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 38 states. [2022-04-28 12:55:28,730 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 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 38 states. [2022-04-28 12:55:28,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:28,732 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-28 12:55:28,732 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-28 12:55:28,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:55:28,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:55:28,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:55:28,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:55:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 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-28 12:55:28,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-28 12:55:28,734 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2022-04-28 12:55:28,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:55:28,735 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-28 12:55:28,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:55:28,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 47 transitions. [2022-04-28 12:55:28,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-28 12:55:28,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 12:55:28,772 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:55:28,772 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:55:28,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 12:55:28,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:55:28,980 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:55:28,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:55:28,981 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 1 times [2022-04-28 12:55:28,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:55:28,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [729488829] [2022-04-28 12:55:28,982 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:55:28,982 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 2 times [2022-04-28 12:55:28,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:55:28,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119343342] [2022-04-28 12:55:28,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:55:28,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:55:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:55:29,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 12:55:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:55:29,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {928#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {912#true} is VALID [2022-04-28 12:55:29,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-28 12:55:29,096 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {912#true} {912#true} #96#return; {912#true} is VALID [2022-04-28 12:55:29,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 12:55:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:55:29,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-28 12:55:29,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-28 12:55:29,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-28 12:55:29,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #80#return; {912#true} is VALID [2022-04-28 12:55:29,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-28 12:55:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:55:29,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-28 12:55:29,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-28 12:55:29,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-28 12:55:29,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {921#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} #82#return; {921#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-28 12:55:29,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {928#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 12:55:29,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {928#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {912#true} is VALID [2022-04-28 12:55:29,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-28 12:55:29,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #96#return; {912#true} is VALID [2022-04-28 12:55:29,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret8 := main(); {912#true} is VALID [2022-04-28 12:55:29,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#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; {912#true} is VALID [2022-04-28 12:55:29,115 INFO L272 TraceCheckUtils]: 6: Hoare triple {912#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {912#true} is VALID [2022-04-28 12:55:29,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-28 12:55:29,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-28 12:55:29,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-28 12:55:29,116 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {912#true} {912#true} #80#return; {912#true} is VALID [2022-04-28 12:55:29,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {912#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {921#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-28 12:55:29,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {921#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {921#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-28 12:55:29,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {921#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} assume !!(#t~post6 < 5);havoc #t~post6; {921#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-28 12:55:29,118 INFO L272 TraceCheckUtils]: 14: Hoare triple {921#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {912#true} is VALID [2022-04-28 12:55:29,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-28 12:55:29,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-28 12:55:29,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-28 12:55:29,119 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {912#true} {921#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} #82#return; {921#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-28 12:55:29,119 INFO L272 TraceCheckUtils]: 19: Hoare triple {921#(= 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)); {926#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:55:29,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {926#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {927#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:55:29,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {927#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {913#false} is VALID [2022-04-28 12:55:29,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-04-28 12:55:29,121 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-28 12:55:29,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:55:29,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119343342] [2022-04-28 12:55:29,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119343342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:55:29,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:55:29,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:55:29,121 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:55:29,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [729488829] [2022-04-28 12:55:29,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [729488829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:55:29,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:55:29,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:55:29,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513638043] [2022-04-28 12:55:29,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:55:29,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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 23 [2022-04-28 12:55:29,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:55:29,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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-28 12:55:29,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:29,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:55:29,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:55:29,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:55:29,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:55:29,138 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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-28 12:55:29,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:29,448 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-28 12:55:29,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 12:55:29,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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 23 [2022-04-28 12:55:29,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:55:29,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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-28 12:55:29,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-28 12:55:29,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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-28 12:55:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-28 12:55:29,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-28 12:55:29,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:29,503 INFO L225 Difference]: With dead ends: 52 [2022-04-28 12:55:29,503 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 12:55:29,503 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-28 12:55:29,504 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:55:29,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 83 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:55:29,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 12:55:29,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-04-28 12:55:29,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:55:29,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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-28 12:55:29,516 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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-28 12:55:29,516 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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-28 12:55:29,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:29,518 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-28 12:55:29,518 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 12:55:29,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:55:29,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:55:29,518 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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 50 states. [2022-04-28 12:55:29,519 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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 50 states. [2022-04-28 12:55:29,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:29,521 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-28 12:55:29,521 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 12:55:29,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:55:29,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:55:29,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:55:29,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:55:29,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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-28 12:55:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-28 12:55:29,523 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23 [2022-04-28 12:55:29,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:55:29,523 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-28 12:55:29,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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-28 12:55:29,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 50 transitions. [2022-04-28 12:55:29,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:29,570 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-28 12:55:29,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 12:55:29,570 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:55:29,570 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, 1] [2022-04-28 12:55:29,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 12:55:29,570 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:55:29,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:55:29,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 1 times [2022-04-28 12:55:29,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:55:29,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1936466921] [2022-04-28 12:55:29,571 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:55:29,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 2 times [2022-04-28 12:55:29,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:55:29,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967004294] [2022-04-28 12:55:29,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:55:29,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:55:29,580 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:55:29,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [921534657] [2022-04-28 12:55:29,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:55:29,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:55:29,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:55:29,581 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-28 12:55:29,601 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-28 12:55:29,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:55:29,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:55:29,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:55:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:55:29,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:55:29,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {1227#true} call ULTIMATE.init(); {1227#true} is VALID [2022-04-28 12:55:29,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {1227#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);~counter~0 := 0; {1227#true} is VALID [2022-04-28 12:55:29,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-28 12:55:29,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1227#true} {1227#true} #96#return; {1227#true} is VALID [2022-04-28 12:55:29,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {1227#true} call #t~ret8 := main(); {1227#true} is VALID [2022-04-28 12:55:29,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {1227#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; {1227#true} is VALID [2022-04-28 12:55:29,735 INFO L272 TraceCheckUtils]: 6: Hoare triple {1227#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1227#true} is VALID [2022-04-28 12:55:29,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-28 12:55:29,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-28 12:55:29,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-28 12:55:29,735 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1227#true} {1227#true} #80#return; {1227#true} is VALID [2022-04-28 12:55:29,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {1227#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 12:55:29,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 12:55:29,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 12:55:29,736 INFO L272 TraceCheckUtils]: 14: Hoare triple {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1227#true} is VALID [2022-04-28 12:55:29,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-28 12:55:29,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-28 12:55:29,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-28 12:55:29,737 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1227#true} {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #82#return; {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 12:55:29,737 INFO L272 TraceCheckUtils]: 19: Hoare triple {1265#(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)); {1227#true} is VALID [2022-04-28 12:55:29,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-28 12:55:29,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-28 12:55:29,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-28 12:55:29,738 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1227#true} {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #84#return; {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 12:55:29,739 INFO L272 TraceCheckUtils]: 24: Hoare triple {1265#(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)); {1305#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:55:29,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {1305#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1309#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:55:29,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {1309#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1228#false} is VALID [2022-04-28 12:55:29,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {1228#false} assume !false; {1228#false} is VALID [2022-04-28 12:55:29,740 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-28 12:55:29,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:55:29,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:55:29,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967004294] [2022-04-28 12:55:29,740 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:55:29,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921534657] [2022-04-28 12:55:29,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921534657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:55:29,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:55:29,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:55:29,741 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:55:29,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1936466921] [2022-04-28 12:55:29,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1936466921] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:55:29,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:55:29,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:55:29,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252869504] [2022-04-28 12:55:29,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:55:29,741 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, (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 28 [2022-04-28 12:55:29,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:55:29,742 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, (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-28 12:55:29,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:29,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:55:29,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:55:29,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:55:29,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:55:29,758 INFO L87 Difference]: Start difference. First operand 42 states and 50 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, (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-28 12:55:29,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:29,924 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2022-04-28 12:55:29,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:55:29,924 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, (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 28 [2022-04-28 12:55:29,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:55:29,924 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, (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-28 12:55:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-04-28 12:55:29,926 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, (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-28 12:55:29,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-04-28 12:55:29,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 87 transitions. [2022-04-28 12:55:29,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:29,988 INFO L225 Difference]: With dead ends: 71 [2022-04-28 12:55:29,988 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 12:55:29,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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-28 12:55:29,989 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 10 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 143 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-28 12:55:29,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 143 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:55:29,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 12:55:30,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 12:55:30,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:55:30,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 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-28 12:55:30,005 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 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-28 12:55:30,005 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 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-28 12:55:30,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:30,007 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2022-04-28 12:55:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-28 12:55:30,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:55:30,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:55:30,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 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 56 states. [2022-04-28 12:55:30,008 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 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 56 states. [2022-04-28 12:55:30,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:30,010 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2022-04-28 12:55:30,010 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-28 12:55:30,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:55:30,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:55:30,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:55:30,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:55:30,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 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-28 12:55:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-28 12:55:30,012 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 28 [2022-04-28 12:55:30,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:55:30,012 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-04-28 12:55:30,012 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, (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-28 12:55:30,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 70 transitions. [2022-04-28 12:55:30,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:30,078 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-28 12:55:30,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 12:55:30,079 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:55:30,079 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, 1, 1] [2022-04-28 12:55:30,097 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-28 12:55:30,285 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-28 12:55:30,286 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:55:30,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:55:30,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 1 times [2022-04-28 12:55:30,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:55:30,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [183740498] [2022-04-28 12:55:30,289 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:55:30,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 2 times [2022-04-28 12:55:30,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:55:30,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189266706] [2022-04-28 12:55:30,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:55:30,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:55:30,302 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:55:30,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [798635596] [2022-04-28 12:55:30,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:55:30,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:55:30,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:55:30,303 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-28 12:55:30,354 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-28 12:55:30,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:55:30,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:55:30,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:55:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:55:30,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:55:30,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {1683#true} call ULTIMATE.init(); {1683#true} is VALID [2022-04-28 12:55:30,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {1683#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);~counter~0 := 0; {1691#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:30,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {1691#(<= ~counter~0 0)} assume true; {1691#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:30,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1691#(<= ~counter~0 0)} {1683#true} #96#return; {1691#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:30,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {1691#(<= ~counter~0 0)} call #t~ret8 := main(); {1691#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:30,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {1691#(<= ~counter~0 0)} 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; {1691#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:30,541 INFO L272 TraceCheckUtils]: 6: Hoare triple {1691#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1691#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:30,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {1691#(<= ~counter~0 0)} ~cond := #in~cond; {1691#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:30,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {1691#(<= ~counter~0 0)} assume !(0 == ~cond); {1691#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:30,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {1691#(<= ~counter~0 0)} assume true; {1691#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:30,543 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1691#(<= ~counter~0 0)} {1691#(<= ~counter~0 0)} #80#return; {1691#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:30,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {1691#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {1691#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:30,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {1691#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1725#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:30,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {1725#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1725#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:30,544 INFO L272 TraceCheckUtils]: 14: Hoare triple {1725#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1725#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:30,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {1725#(<= ~counter~0 1)} ~cond := #in~cond; {1725#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:30,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {1725#(<= ~counter~0 1)} assume !(0 == ~cond); {1725#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:30,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {1725#(<= ~counter~0 1)} assume true; {1725#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:30,545 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1725#(<= ~counter~0 1)} {1725#(<= ~counter~0 1)} #82#return; {1725#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:30,545 INFO L272 TraceCheckUtils]: 19: Hoare triple {1725#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {1725#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:30,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {1725#(<= ~counter~0 1)} ~cond := #in~cond; {1725#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:30,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {1725#(<= ~counter~0 1)} assume !(0 == ~cond); {1725#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:30,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {1725#(<= ~counter~0 1)} assume true; {1725#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:30,547 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1725#(<= ~counter~0 1)} {1725#(<= ~counter~0 1)} #84#return; {1725#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:30,547 INFO L272 TraceCheckUtils]: 24: Hoare triple {1725#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {1725#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:30,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {1725#(<= ~counter~0 1)} ~cond := #in~cond; {1725#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:30,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {1725#(<= ~counter~0 1)} assume !(0 == ~cond); {1725#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:30,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {1725#(<= ~counter~0 1)} assume true; {1725#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:30,548 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1725#(<= ~counter~0 1)} {1725#(<= ~counter~0 1)} #86#return; {1725#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:30,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {1725#(<= ~counter~0 1)} assume !(~r~0 >= ~d~0); {1725#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:30,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {1725#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1780#(<= |main_#t~post7| 1)} is VALID [2022-04-28 12:55:30,549 INFO L290 TraceCheckUtils]: 31: Hoare triple {1780#(<= |main_#t~post7| 1)} assume !(#t~post7 < 5);havoc #t~post7; {1684#false} is VALID [2022-04-28 12:55:30,549 INFO L272 TraceCheckUtils]: 32: Hoare triple {1684#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {1684#false} is VALID [2022-04-28 12:55:30,549 INFO L290 TraceCheckUtils]: 33: Hoare triple {1684#false} ~cond := #in~cond; {1684#false} is VALID [2022-04-28 12:55:30,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {1684#false} assume 0 == ~cond; {1684#false} is VALID [2022-04-28 12:55:30,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {1684#false} assume !false; {1684#false} is VALID [2022-04-28 12:55:30,550 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-28 12:55:30,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:55:30,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:55:30,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189266706] [2022-04-28 12:55:30,550 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:55:30,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798635596] [2022-04-28 12:55:30,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798635596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:55:30,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:55:30,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:55:30,550 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:55:30,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [183740498] [2022-04-28 12:55:30,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [183740498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:55:30,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:55:30,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:55:30,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655363511] [2022-04-28 12:55:30,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:55:30,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-28 12:55:30,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:55:30,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 12:55:30,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:30,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:55:30,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:55:30,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:55:30,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:55:30,573 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 12:55:30,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:30,669 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-04-28 12:55:30,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:55:30,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-28 12:55:30,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:55:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 12:55:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 12:55:30,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 12:55:30,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 12:55:30,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 12:55:30,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:30,710 INFO L225 Difference]: With dead ends: 76 [2022-04-28 12:55:30,710 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 12:55:30,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:55:30,711 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:55:30,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 117 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:55:30,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 12:55:30,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-28 12:55:30,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:55:30,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:55:30,738 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:55:30,738 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:55:30,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:30,740 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-04-28 12:55:30,740 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-04-28 12:55:30,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:55:30,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:55:30,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-28 12:55:30,740 INFO L87 Difference]: Start difference. First operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-28 12:55:30,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:30,742 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-04-28 12:55:30,742 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-04-28 12:55:30,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:55:30,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:55:30,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:55:30,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:55:30,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:55:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-04-28 12:55:30,744 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 36 [2022-04-28 12:55:30,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:55:30,744 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-04-28 12:55:30,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 12:55:30,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 78 transitions. [2022-04-28 12:55:30,808 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-28 12:55:30,808 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-04-28 12:55:30,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 12:55:30,808 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:55:30,808 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, 1, 1] [2022-04-28 12:55:30,826 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-28 12:55:31,024 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-28 12:55:31,024 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:55:31,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:55:31,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 1 times [2022-04-28 12:55:31,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:55:31,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [663336682] [2022-04-28 12:55:31,025 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:55:31,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 2 times [2022-04-28 12:55:31,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:55:31,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267142095] [2022-04-28 12:55:31,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:55:31,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:55:31,036 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:55:31,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1749128581] [2022-04-28 12:55:31,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:55:31,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:55:31,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:55:31,041 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-28 12:55:31,061 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-28 12:55:31,083 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:55:31,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:55:31,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:55:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:55:31,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:55:44,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {2221#true} call ULTIMATE.init(); {2221#true} is VALID [2022-04-28 12:55:44,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {2221#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);~counter~0 := 0; {2221#true} is VALID [2022-04-28 12:55:44,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {2221#true} assume true; {2221#true} is VALID [2022-04-28 12:55:44,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2221#true} {2221#true} #96#return; {2221#true} is VALID [2022-04-28 12:55:44,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {2221#true} call #t~ret8 := main(); {2221#true} is VALID [2022-04-28 12:55:44,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {2221#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; {2221#true} is VALID [2022-04-28 12:55:44,060 INFO L272 TraceCheckUtils]: 6: Hoare triple {2221#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2221#true} is VALID [2022-04-28 12:55:44,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {2221#true} ~cond := #in~cond; {2221#true} is VALID [2022-04-28 12:55:44,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {2221#true} assume !(0 == ~cond); {2221#true} is VALID [2022-04-28 12:55:44,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {2221#true} assume true; {2221#true} is VALID [2022-04-28 12:55:44,060 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2221#true} {2221#true} #80#return; {2221#true} is VALID [2022-04-28 12:55:44,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {2221#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 12:55:44,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 12:55:44,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 12:55:44,061 INFO L272 TraceCheckUtils]: 14: Hoare triple {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2221#true} is VALID [2022-04-28 12:55:44,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {2221#true} ~cond := #in~cond; {2221#true} is VALID [2022-04-28 12:55:44,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {2221#true} assume !(0 == ~cond); {2221#true} is VALID [2022-04-28 12:55:44,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {2221#true} assume true; {2221#true} is VALID [2022-04-28 12:55:44,062 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2221#true} {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #82#return; {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 12:55:44,062 INFO L272 TraceCheckUtils]: 19: Hoare triple {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2221#true} is VALID [2022-04-28 12:55:44,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {2221#true} ~cond := #in~cond; {2221#true} is VALID [2022-04-28 12:55:44,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {2221#true} assume !(0 == ~cond); {2221#true} is VALID [2022-04-28 12:55:44,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {2221#true} assume true; {2221#true} is VALID [2022-04-28 12:55:44,063 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2221#true} {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #84#return; {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 12:55:44,063 INFO L272 TraceCheckUtils]: 24: Hoare triple {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2221#true} is VALID [2022-04-28 12:55:44,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {2221#true} ~cond := #in~cond; {2221#true} is VALID [2022-04-28 12:55:44,063 INFO L290 TraceCheckUtils]: 26: Hoare triple {2221#true} assume !(0 == ~cond); {2221#true} is VALID [2022-04-28 12:55:44,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {2221#true} assume true; {2221#true} is VALID [2022-04-28 12:55:44,064 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2221#true} {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #86#return; {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 12:55:44,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 12:55:44,065 INFO L290 TraceCheckUtils]: 30: Hoare triple {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 12:55:44,065 INFO L290 TraceCheckUtils]: 31: Hoare triple {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 12:55:44,066 INFO L272 TraceCheckUtils]: 32: Hoare triple {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {2323#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:55:44,066 INFO L290 TraceCheckUtils]: 33: Hoare triple {2323#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2327#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:55:44,067 INFO L290 TraceCheckUtils]: 34: Hoare triple {2327#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2222#false} is VALID [2022-04-28 12:55:44,067 INFO L290 TraceCheckUtils]: 35: Hoare triple {2222#false} assume !false; {2222#false} is VALID [2022-04-28 12:55:44,067 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-28 12:55:44,067 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:55:44,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:55:44,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267142095] [2022-04-28 12:55:44,067 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:55:44,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749128581] [2022-04-28 12:55:44,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749128581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:55:44,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:55:44,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:55:44,068 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:55:44,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [663336682] [2022-04-28 12:55:44,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [663336682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:55:44,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:55:44,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:55:44,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708461507] [2022-04-28 12:55:44,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:55:44,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 36 [2022-04-28 12:55:44,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:55:44,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-28 12:55:44,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:44,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:55:44,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:55:44,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:55:44,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:55:44,093 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-28 12:55:44,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:44,329 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2022-04-28 12:55:44,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:55:44,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 36 [2022-04-28 12:55:44,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:55:44,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-28 12:55:44,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-28 12:55:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-28 12:55:44,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-28 12:55:44,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2022-04-28 12:55:44,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:44,377 INFO L225 Difference]: With dead ends: 82 [2022-04-28 12:55:44,377 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 12:55:44,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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-28 12:55:44,377 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 11 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 118 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:55:44,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 118 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:55:44,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 12:55:44,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-04-28 12:55:44,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:55:44,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 69 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 12:55:44,416 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 69 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 12:55:44,416 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 69 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 12:55:44,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:44,418 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-28 12:55:44,418 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-28 12:55:44,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:55:44,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:55:44,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 70 states. [2022-04-28 12:55:44,418 INFO L87 Difference]: Start difference. First operand has 69 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 70 states. [2022-04-28 12:55:44,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:44,420 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-28 12:55:44,420 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-28 12:55:44,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:55:44,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:55:44,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:55:44,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:55:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 12:55:44,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2022-04-28 12:55:44,422 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 36 [2022-04-28 12:55:44,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:55:44,422 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2022-04-28 12:55:44,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-28 12:55:44,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 82 transitions. [2022-04-28 12:55:44,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:44,499 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-04-28 12:55:44,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 12:55:44,499 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:55:44,500 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:55:44,517 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-28 12:55:44,700 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-28 12:55:44,700 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:55:44,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:55:44,700 INFO L85 PathProgramCache]: Analyzing trace with hash 817878903, now seen corresponding path program 1 times [2022-04-28 12:55:44,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:55:44,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [730061329] [2022-04-28 12:55:51,373 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 12:55:51,373 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 12:55:51,373 INFO L85 PathProgramCache]: Analyzing trace with hash 817878903, now seen corresponding path program 2 times [2022-04-28 12:55:51,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:55:51,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446924287] [2022-04-28 12:55:51,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:55:51,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:55:51,381 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:55:51,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [576371296] [2022-04-28 12:55:51,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:55:51,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:55:51,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:55:51,382 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-28 12:55:51,450 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-28 12:55:51,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:55:51,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:55:51,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:55:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:55:51,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:55:51,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {2777#true} call ULTIMATE.init(); {2777#true} is VALID [2022-04-28 12:55:51,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {2777#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);~counter~0 := 0; {2785#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:51,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {2785#(<= ~counter~0 0)} assume true; {2785#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:51,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2785#(<= ~counter~0 0)} {2777#true} #96#return; {2785#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:51,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {2785#(<= ~counter~0 0)} call #t~ret8 := main(); {2785#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:51,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {2785#(<= ~counter~0 0)} 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; {2785#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:51,660 INFO L272 TraceCheckUtils]: 6: Hoare triple {2785#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2785#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:51,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {2785#(<= ~counter~0 0)} ~cond := #in~cond; {2785#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:51,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {2785#(<= ~counter~0 0)} assume !(0 == ~cond); {2785#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:51,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {2785#(<= ~counter~0 0)} assume true; {2785#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:51,662 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2785#(<= ~counter~0 0)} {2785#(<= ~counter~0 0)} #80#return; {2785#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:51,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {2785#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {2785#(<= ~counter~0 0)} is VALID [2022-04-28 12:55:51,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {2785#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2819#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:51,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {2819#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {2819#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:51,663 INFO L272 TraceCheckUtils]: 14: Hoare triple {2819#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2819#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:51,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {2819#(<= ~counter~0 1)} ~cond := #in~cond; {2819#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:51,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {2819#(<= ~counter~0 1)} assume !(0 == ~cond); {2819#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:51,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {2819#(<= ~counter~0 1)} assume true; {2819#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:51,665 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2819#(<= ~counter~0 1)} {2819#(<= ~counter~0 1)} #82#return; {2819#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:51,665 INFO L272 TraceCheckUtils]: 19: Hoare triple {2819#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2819#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:51,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {2819#(<= ~counter~0 1)} ~cond := #in~cond; {2819#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:51,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {2819#(<= ~counter~0 1)} assume !(0 == ~cond); {2819#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:51,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {2819#(<= ~counter~0 1)} assume true; {2819#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:51,667 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2819#(<= ~counter~0 1)} {2819#(<= ~counter~0 1)} #84#return; {2819#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:51,667 INFO L272 TraceCheckUtils]: 24: Hoare triple {2819#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2819#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:51,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {2819#(<= ~counter~0 1)} ~cond := #in~cond; {2819#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:51,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {2819#(<= ~counter~0 1)} assume !(0 == ~cond); {2819#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:51,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {2819#(<= ~counter~0 1)} assume true; {2819#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:51,668 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2819#(<= ~counter~0 1)} {2819#(<= ~counter~0 1)} #86#return; {2819#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:51,669 INFO L290 TraceCheckUtils]: 29: Hoare triple {2819#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2819#(<= ~counter~0 1)} is VALID [2022-04-28 12:55:51,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {2819#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2874#(<= |main_#t~post6| 1)} is VALID [2022-04-28 12:55:51,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {2874#(<= |main_#t~post6| 1)} assume !(#t~post6 < 5);havoc #t~post6; {2778#false} is VALID [2022-04-28 12:55:51,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {2778#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2778#false} is VALID [2022-04-28 12:55:51,670 INFO L290 TraceCheckUtils]: 33: Hoare triple {2778#false} assume !(#t~post7 < 5);havoc #t~post7; {2778#false} is VALID [2022-04-28 12:55:51,670 INFO L272 TraceCheckUtils]: 34: Hoare triple {2778#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2778#false} is VALID [2022-04-28 12:55:51,670 INFO L290 TraceCheckUtils]: 35: Hoare triple {2778#false} ~cond := #in~cond; {2778#false} is VALID [2022-04-28 12:55:51,670 INFO L290 TraceCheckUtils]: 36: Hoare triple {2778#false} assume !(0 == ~cond); {2778#false} is VALID [2022-04-28 12:55:51,670 INFO L290 TraceCheckUtils]: 37: Hoare triple {2778#false} assume true; {2778#false} is VALID [2022-04-28 12:55:51,670 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2778#false} {2778#false} #92#return; {2778#false} is VALID [2022-04-28 12:55:51,670 INFO L272 TraceCheckUtils]: 39: Hoare triple {2778#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {2778#false} is VALID [2022-04-28 12:55:51,670 INFO L290 TraceCheckUtils]: 40: Hoare triple {2778#false} ~cond := #in~cond; {2778#false} is VALID [2022-04-28 12:55:51,670 INFO L290 TraceCheckUtils]: 41: Hoare triple {2778#false} assume 0 == ~cond; {2778#false} is VALID [2022-04-28 12:55:51,670 INFO L290 TraceCheckUtils]: 42: Hoare triple {2778#false} assume !false; {2778#false} is VALID [2022-04-28 12:55:51,671 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 12:55:51,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:55:51,852 INFO L290 TraceCheckUtils]: 42: Hoare triple {2778#false} assume !false; {2778#false} is VALID [2022-04-28 12:55:51,852 INFO L290 TraceCheckUtils]: 41: Hoare triple {2778#false} assume 0 == ~cond; {2778#false} is VALID [2022-04-28 12:55:51,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {2778#false} ~cond := #in~cond; {2778#false} is VALID [2022-04-28 12:55:51,852 INFO L272 TraceCheckUtils]: 39: Hoare triple {2778#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {2778#false} is VALID [2022-04-28 12:55:51,852 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2777#true} {2778#false} #92#return; {2778#false} is VALID [2022-04-28 12:55:51,852 INFO L290 TraceCheckUtils]: 37: Hoare triple {2777#true} assume true; {2777#true} is VALID [2022-04-28 12:55:51,852 INFO L290 TraceCheckUtils]: 36: Hoare triple {2777#true} assume !(0 == ~cond); {2777#true} is VALID [2022-04-28 12:55:51,852 INFO L290 TraceCheckUtils]: 35: Hoare triple {2777#true} ~cond := #in~cond; {2777#true} is VALID [2022-04-28 12:55:51,852 INFO L272 TraceCheckUtils]: 34: Hoare triple {2778#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2777#true} is VALID [2022-04-28 12:55:51,853 INFO L290 TraceCheckUtils]: 33: Hoare triple {2778#false} assume !(#t~post7 < 5);havoc #t~post7; {2778#false} is VALID [2022-04-28 12:55:51,853 INFO L290 TraceCheckUtils]: 32: Hoare triple {2778#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2778#false} is VALID [2022-04-28 12:55:51,853 INFO L290 TraceCheckUtils]: 31: Hoare triple {2944#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {2778#false} is VALID [2022-04-28 12:55:51,853 INFO L290 TraceCheckUtils]: 30: Hoare triple {2948#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2944#(< |main_#t~post6| 5)} is VALID [2022-04-28 12:55:51,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {2948#(< ~counter~0 5)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2948#(< ~counter~0 5)} is VALID [2022-04-28 12:55:51,854 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2777#true} {2948#(< ~counter~0 5)} #86#return; {2948#(< ~counter~0 5)} is VALID [2022-04-28 12:55:51,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {2777#true} assume true; {2777#true} is VALID [2022-04-28 12:55:51,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {2777#true} assume !(0 == ~cond); {2777#true} is VALID [2022-04-28 12:55:51,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {2777#true} ~cond := #in~cond; {2777#true} is VALID [2022-04-28 12:55:51,854 INFO L272 TraceCheckUtils]: 24: Hoare triple {2948#(< ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2777#true} is VALID [2022-04-28 12:55:51,855 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2777#true} {2948#(< ~counter~0 5)} #84#return; {2948#(< ~counter~0 5)} is VALID [2022-04-28 12:55:51,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {2777#true} assume true; {2777#true} is VALID [2022-04-28 12:55:51,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {2777#true} assume !(0 == ~cond); {2777#true} is VALID [2022-04-28 12:55:51,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {2777#true} ~cond := #in~cond; {2777#true} is VALID [2022-04-28 12:55:51,855 INFO L272 TraceCheckUtils]: 19: Hoare triple {2948#(< ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2777#true} is VALID [2022-04-28 12:55:51,856 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2777#true} {2948#(< ~counter~0 5)} #82#return; {2948#(< ~counter~0 5)} is VALID [2022-04-28 12:55:51,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {2777#true} assume true; {2777#true} is VALID [2022-04-28 12:55:51,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {2777#true} assume !(0 == ~cond); {2777#true} is VALID [2022-04-28 12:55:51,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {2777#true} ~cond := #in~cond; {2777#true} is VALID [2022-04-28 12:55:51,856 INFO L272 TraceCheckUtils]: 14: Hoare triple {2948#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2777#true} is VALID [2022-04-28 12:55:51,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {2948#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {2948#(< ~counter~0 5)} is VALID [2022-04-28 12:55:51,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {3003#(< ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2948#(< ~counter~0 5)} is VALID [2022-04-28 12:55:51,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {3003#(< ~counter~0 4)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {3003#(< ~counter~0 4)} is VALID [2022-04-28 12:55:51,858 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2777#true} {3003#(< ~counter~0 4)} #80#return; {3003#(< ~counter~0 4)} is VALID [2022-04-28 12:55:51,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {2777#true} assume true; {2777#true} is VALID [2022-04-28 12:55:51,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {2777#true} assume !(0 == ~cond); {2777#true} is VALID [2022-04-28 12:55:51,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {2777#true} ~cond := #in~cond; {2777#true} is VALID [2022-04-28 12:55:51,858 INFO L272 TraceCheckUtils]: 6: Hoare triple {3003#(< ~counter~0 4)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2777#true} is VALID [2022-04-28 12:55:51,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {3003#(< ~counter~0 4)} 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; {3003#(< ~counter~0 4)} is VALID [2022-04-28 12:55:51,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {3003#(< ~counter~0 4)} call #t~ret8 := main(); {3003#(< ~counter~0 4)} is VALID [2022-04-28 12:55:51,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3003#(< ~counter~0 4)} {2777#true} #96#return; {3003#(< ~counter~0 4)} is VALID [2022-04-28 12:55:51,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {3003#(< ~counter~0 4)} assume true; {3003#(< ~counter~0 4)} is VALID [2022-04-28 12:55:51,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {2777#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);~counter~0 := 0; {3003#(< ~counter~0 4)} is VALID [2022-04-28 12:55:51,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {2777#true} call ULTIMATE.init(); {2777#true} is VALID [2022-04-28 12:55:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 12:55:51,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:55:51,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446924287] [2022-04-28 12:55:51,860 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:55:51,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576371296] [2022-04-28 12:55:51,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576371296] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:55:51,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:55:51,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 12:55:51,861 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:55:51,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [730061329] [2022-04-28 12:55:51,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [730061329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:55:51,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:55:51,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:55:51,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031193899] [2022-04-28 12:55:51,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:55:51,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2022-04-28 12:55:51,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:55:51,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 12:55:51,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:51,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:55:51,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:55:51,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:55:51,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 12:55:51,909 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 12:55:52,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:52,056 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2022-04-28 12:55:52,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:55:52,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2022-04-28 12:55:52,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:55:52,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 12:55:52,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-04-28 12:55:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 12:55:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-04-28 12:55:52,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 76 transitions. [2022-04-28 12:55:52,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:52,109 INFO L225 Difference]: With dead ends: 96 [2022-04-28 12:55:52,109 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 12:55:52,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:55:52,110 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:55:52,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 117 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:55:52,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 12:55:52,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-28 12:55:52,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:55:52,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 45 states have (on average 1.2) internal successors, (54), 47 states have internal predecessors, (54), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 12:55:52,148 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 45 states have (on average 1.2) internal successors, (54), 47 states have internal predecessors, (54), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 12:55:52,148 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 45 states have (on average 1.2) internal successors, (54), 47 states have internal predecessors, (54), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 12:55:52,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:52,150 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2022-04-28 12:55:52,150 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-04-28 12:55:52,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:55:52,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:55:52,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 45 states have (on average 1.2) internal successors, (54), 47 states have internal predecessors, (54), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 71 states. [2022-04-28 12:55:52,151 INFO L87 Difference]: Start difference. First operand has 71 states, 45 states have (on average 1.2) internal successors, (54), 47 states have internal predecessors, (54), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 71 states. [2022-04-28 12:55:52,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:55:52,152 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2022-04-28 12:55:52,152 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-04-28 12:55:52,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:55:52,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:55:52,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:55:52,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:55:52,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 45 states have (on average 1.2) internal successors, (54), 47 states have internal predecessors, (54), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 12:55:52,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2022-04-28 12:55:52,155 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 43 [2022-04-28 12:55:52,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:55:52,155 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2022-04-28 12:55:52,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 12:55:52,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 84 transitions. [2022-04-28 12:55:52,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:55:52,229 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-04-28 12:55:52,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 12:55:52,230 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:55:52,230 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:55:52,247 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-28 12:55:52,432 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-28 12:55:52,433 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:55:52,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:55:52,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1861890039, now seen corresponding path program 1 times [2022-04-28 12:55:52,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:55:52,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [202115039] [2022-04-28 12:55:58,472 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 12:55:58,473 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 12:55:58,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1861890039, now seen corresponding path program 2 times [2022-04-28 12:55:58,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:55:58,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857808772] [2022-04-28 12:55:58,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:55:58,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:55:58,484 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:55:58,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1723924951] [2022-04-28 12:55:58,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:55:58,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:55:58,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:55:58,486 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-28 12:55:58,494 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-28 12:55:58,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:55:58,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:55:58,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 12:55:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:55:58,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:55:59,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {3520#true} call ULTIMATE.init(); {3520#true} is VALID [2022-04-28 12:55:59,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {3520#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);~counter~0 := 0; {3520#true} is VALID [2022-04-28 12:55:59,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-28 12:55:59,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3520#true} {3520#true} #96#return; {3520#true} is VALID [2022-04-28 12:55:59,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {3520#true} call #t~ret8 := main(); {3520#true} is VALID [2022-04-28 12:55:59,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {3520#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; {3520#true} is VALID [2022-04-28 12:55:59,208 INFO L272 TraceCheckUtils]: 6: Hoare triple {3520#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3520#true} is VALID [2022-04-28 12:55:59,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {3520#true} ~cond := #in~cond; {3546#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:55:59,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {3546#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3550#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:55:59,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {3550#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3550#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:55:59,209 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3550#(not (= |assume_abort_if_not_#in~cond| 0))} {3520#true} #80#return; {3557#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-28 12:55:59,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {3557#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 12:55:59,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 12:55:59,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 12:55:59,211 INFO L272 TraceCheckUtils]: 14: Hoare triple {3561#(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)); {3520#true} is VALID [2022-04-28 12:55:59,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-28 12:55:59,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-28 12:55:59,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-28 12:55:59,212 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3520#true} {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #82#return; {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 12:55:59,212 INFO L272 TraceCheckUtils]: 19: Hoare triple {3561#(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)); {3520#true} is VALID [2022-04-28 12:55:59,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-28 12:55:59,212 INFO L290 TraceCheckUtils]: 21: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-28 12:55:59,212 INFO L290 TraceCheckUtils]: 22: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-28 12:55:59,212 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3520#true} {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #84#return; {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 12:55:59,213 INFO L272 TraceCheckUtils]: 24: Hoare triple {3561#(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)); {3520#true} is VALID [2022-04-28 12:55:59,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-28 12:55:59,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-28 12:55:59,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-28 12:55:59,213 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3520#true} {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #86#return; {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 12:55:59,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {3561#(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; {3616#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 12:55:59,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {3616#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3616#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 12:55:59,215 INFO L290 TraceCheckUtils]: 31: Hoare triple {3616#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 5);havoc #t~post6; {3616#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 12:55:59,215 INFO L272 TraceCheckUtils]: 32: Hoare triple {3616#(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)); {3520#true} is VALID [2022-04-28 12:55:59,215 INFO L290 TraceCheckUtils]: 33: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-28 12:55:59,215 INFO L290 TraceCheckUtils]: 34: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-28 12:55:59,215 INFO L290 TraceCheckUtils]: 35: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-28 12:55:59,215 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3520#true} {3616#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #82#return; {3616#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 12:55:59,216 INFO L272 TraceCheckUtils]: 37: Hoare triple {3616#(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)); {3520#true} is VALID [2022-04-28 12:55:59,216 INFO L290 TraceCheckUtils]: 38: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-28 12:55:59,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-28 12:55:59,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-28 12:55:59,216 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3520#true} {3616#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #84#return; {3616#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 12:55:59,217 INFO L272 TraceCheckUtils]: 42: Hoare triple {3616#(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)); {3656#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:55:59,217 INFO L290 TraceCheckUtils]: 43: Hoare triple {3656#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3660#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:55:59,218 INFO L290 TraceCheckUtils]: 44: Hoare triple {3660#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3521#false} is VALID [2022-04-28 12:55:59,218 INFO L290 TraceCheckUtils]: 45: Hoare triple {3521#false} assume !false; {3521#false} is VALID [2022-04-28 12:55:59,218 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 12:55:59,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:55:59,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {3521#false} assume !false; {3521#false} is VALID [2022-04-28 12:55:59,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {3660#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3521#false} is VALID [2022-04-28 12:55:59,518 INFO L290 TraceCheckUtils]: 43: Hoare triple {3656#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3660#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:55:59,518 INFO L272 TraceCheckUtils]: 42: Hoare triple {3676#(= 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)); {3656#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:55:59,519 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3520#true} {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #84#return; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 12:55:59,519 INFO L290 TraceCheckUtils]: 40: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-28 12:55:59,519 INFO L290 TraceCheckUtils]: 39: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-28 12:55:59,519 INFO L290 TraceCheckUtils]: 38: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-28 12:55:59,519 INFO L272 TraceCheckUtils]: 37: Hoare triple {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3520#true} is VALID [2022-04-28 12:55:59,519 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3520#true} {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #82#return; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 12:55:59,519 INFO L290 TraceCheckUtils]: 35: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-28 12:55:59,520 INFO L290 TraceCheckUtils]: 34: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-28 12:55:59,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-28 12:55:59,520 INFO L272 TraceCheckUtils]: 32: Hoare triple {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3520#true} is VALID [2022-04-28 12:55:59,520 INFO L290 TraceCheckUtils]: 31: Hoare triple {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 5);havoc #t~post6; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 12:55:59,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 12:55:59,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {3676#(= 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; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 12:55:59,522 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3520#true} {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #86#return; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 12:55:59,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-28 12:55:59,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-28 12:55:59,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-28 12:55:59,522 INFO L272 TraceCheckUtils]: 24: Hoare triple {3676#(= 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)); {3520#true} is VALID [2022-04-28 12:55:59,522 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3520#true} {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #84#return; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 12:55:59,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-28 12:55:59,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-28 12:55:59,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-28 12:55:59,526 INFO L272 TraceCheckUtils]: 19: Hoare triple {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3520#true} is VALID [2022-04-28 12:55:59,527 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3520#true} {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #82#return; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 12:55:59,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-28 12:55:59,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-28 12:55:59,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-28 12:55:59,527 INFO L272 TraceCheckUtils]: 14: Hoare triple {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3520#true} is VALID [2022-04-28 12:55:59,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 5);havoc #t~post6; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 12:55:59,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 12:55:59,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {3520#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 12:55:59,528 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3520#true} {3520#true} #80#return; {3520#true} is VALID [2022-04-28 12:55:59,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-28 12:55:59,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-28 12:55:59,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-28 12:55:59,529 INFO L272 TraceCheckUtils]: 6: Hoare triple {3520#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3520#true} is VALID [2022-04-28 12:55:59,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {3520#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; {3520#true} is VALID [2022-04-28 12:55:59,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {3520#true} call #t~ret8 := main(); {3520#true} is VALID [2022-04-28 12:55:59,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3520#true} {3520#true} #96#return; {3520#true} is VALID [2022-04-28 12:55:59,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-28 12:55:59,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {3520#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);~counter~0 := 0; {3520#true} is VALID [2022-04-28 12:55:59,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {3520#true} call ULTIMATE.init(); {3520#true} is VALID [2022-04-28 12:55:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 12:55:59,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:55:59,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857808772] [2022-04-28 12:55:59,532 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:55:59,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723924951] [2022-04-28 12:55:59,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723924951] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 12:55:59,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:55:59,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-28 12:55:59,532 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:55:59,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [202115039] [2022-04-28 12:55:59,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [202115039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:55:59,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:55:59,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:55:59,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510882105] [2022-04-28 12:55:59,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:55:59,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 46 [2022-04-28 12:55:59,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:55:59,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-28 12:55:59,551 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-28 12:55:59,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:55:59,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:55:59,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:55:59,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:55:59,552 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-28 12:56:01,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:56:01,824 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2022-04-28 12:56:01,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:56:01,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 46 [2022-04-28 12:56:01,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:56:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-28 12:56:01,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-28 12:56:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-28 12:56:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-28 12:56:01,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-28 12:56:01,885 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-28 12:56:01,886 INFO L225 Difference]: With dead ends: 84 [2022-04-28 12:56:01,886 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 12:56:01,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 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-28 12:56:01,887 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 125 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:56:01,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 125 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:56:01,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 12:56:01,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2022-04-28 12:56:01,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:56:01,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 79 states, 50 states have (on average 1.2) internal successors, (60), 53 states have internal predecessors, (60), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 12:56:01,927 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 79 states, 50 states have (on average 1.2) internal successors, (60), 53 states have internal predecessors, (60), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 12:56:01,927 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 79 states, 50 states have (on average 1.2) internal successors, (60), 53 states have internal predecessors, (60), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 12:56:01,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:56:01,935 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-28 12:56:01,935 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-28 12:56:01,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:56:01,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:56:01,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 50 states have (on average 1.2) internal successors, (60), 53 states have internal predecessors, (60), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 82 states. [2022-04-28 12:56:01,935 INFO L87 Difference]: Start difference. First operand has 79 states, 50 states have (on average 1.2) internal successors, (60), 53 states have internal predecessors, (60), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 82 states. [2022-04-28 12:56:01,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:56:01,937 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-28 12:56:01,937 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-28 12:56:01,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:56:01,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:56:01,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:56:01,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:56:01,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.2) internal successors, (60), 53 states have internal predecessors, (60), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 12:56:01,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2022-04-28 12:56:01,939 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 46 [2022-04-28 12:56:01,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:56:01,940 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2022-04-28 12:56:01,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-28 12:56:01,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 94 transitions. [2022-04-28 12:56:02,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:56:02,039 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-28 12:56:02,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 12:56:02,040 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:56:02,040 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 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-28 12:56:02,056 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-28 12:56:02,255 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-28 12:56:02,255 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:56:02,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:56:02,256 INFO L85 PathProgramCache]: Analyzing trace with hash 967982746, now seen corresponding path program 1 times [2022-04-28 12:56:02,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:56:02,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [529799353] [2022-04-28 12:56:08,873 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 12:56:08,873 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 12:56:08,873 INFO L85 PathProgramCache]: Analyzing trace with hash 967982746, now seen corresponding path program 2 times [2022-04-28 12:56:08,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:56:08,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232197597] [2022-04-28 12:56:08,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:56:08,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:56:08,884 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:56:08,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1873058451] [2022-04-28 12:56:08,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:56:08,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:56:08,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:56:08,886 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-28 12:56:08,887 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-28 12:56:08,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:56:08,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:56:08,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 12:56:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:56:08,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:56:09,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {4297#true} call ULTIMATE.init(); {4297#true} is VALID [2022-04-28 12:56:09,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {4297#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);~counter~0 := 0; {4305#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:09,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {4305#(<= ~counter~0 0)} assume true; {4305#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:09,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4305#(<= ~counter~0 0)} {4297#true} #96#return; {4305#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:09,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {4305#(<= ~counter~0 0)} call #t~ret8 := main(); {4305#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:09,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {4305#(<= ~counter~0 0)} 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; {4305#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:09,167 INFO L272 TraceCheckUtils]: 6: Hoare triple {4305#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4305#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:09,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {4305#(<= ~counter~0 0)} ~cond := #in~cond; {4305#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:09,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {4305#(<= ~counter~0 0)} assume !(0 == ~cond); {4305#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:09,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {4305#(<= ~counter~0 0)} assume true; {4305#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:09,169 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4305#(<= ~counter~0 0)} {4305#(<= ~counter~0 0)} #80#return; {4305#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:09,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {4305#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {4305#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:09,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {4305#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4339#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:09,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {4339#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {4339#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:09,170 INFO L272 TraceCheckUtils]: 14: Hoare triple {4339#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4339#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:09,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {4339#(<= ~counter~0 1)} ~cond := #in~cond; {4339#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:09,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {4339#(<= ~counter~0 1)} assume !(0 == ~cond); {4339#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:09,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {4339#(<= ~counter~0 1)} assume true; {4339#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:09,172 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4339#(<= ~counter~0 1)} {4339#(<= ~counter~0 1)} #82#return; {4339#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:09,172 INFO L272 TraceCheckUtils]: 19: Hoare triple {4339#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {4339#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:09,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {4339#(<= ~counter~0 1)} ~cond := #in~cond; {4339#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:09,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {4339#(<= ~counter~0 1)} assume !(0 == ~cond); {4339#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:09,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {4339#(<= ~counter~0 1)} assume true; {4339#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:09,173 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4339#(<= ~counter~0 1)} {4339#(<= ~counter~0 1)} #84#return; {4339#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:09,174 INFO L272 TraceCheckUtils]: 24: Hoare triple {4339#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4339#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:09,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {4339#(<= ~counter~0 1)} ~cond := #in~cond; {4339#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:09,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {4339#(<= ~counter~0 1)} assume !(0 == ~cond); {4339#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:09,175 INFO L290 TraceCheckUtils]: 27: Hoare triple {4339#(<= ~counter~0 1)} assume true; {4339#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:09,175 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4339#(<= ~counter~0 1)} {4339#(<= ~counter~0 1)} #86#return; {4339#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:09,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {4339#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4339#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:09,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {4339#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {4394#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,177 INFO L272 TraceCheckUtils]: 32: Hoare triple {4394#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {4394#(<= ~counter~0 2)} ~cond := #in~cond; {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,177 INFO L290 TraceCheckUtils]: 34: Hoare triple {4394#(<= ~counter~0 2)} assume !(0 == ~cond); {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,177 INFO L290 TraceCheckUtils]: 35: Hoare triple {4394#(<= ~counter~0 2)} assume true; {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,178 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4394#(<= ~counter~0 2)} {4394#(<= ~counter~0 2)} #82#return; {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,178 INFO L272 TraceCheckUtils]: 37: Hoare triple {4394#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {4394#(<= ~counter~0 2)} ~cond := #in~cond; {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,179 INFO L290 TraceCheckUtils]: 39: Hoare triple {4394#(<= ~counter~0 2)} assume !(0 == ~cond); {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,179 INFO L290 TraceCheckUtils]: 40: Hoare triple {4394#(<= ~counter~0 2)} assume true; {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,179 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4394#(<= ~counter~0 2)} {4394#(<= ~counter~0 2)} #84#return; {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,180 INFO L272 TraceCheckUtils]: 42: Hoare triple {4394#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,180 INFO L290 TraceCheckUtils]: 43: Hoare triple {4394#(<= ~counter~0 2)} ~cond := #in~cond; {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {4394#(<= ~counter~0 2)} assume !(0 == ~cond); {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,181 INFO L290 TraceCheckUtils]: 45: Hoare triple {4394#(<= ~counter~0 2)} assume true; {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,181 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4394#(<= ~counter~0 2)} {4394#(<= ~counter~0 2)} #86#return; {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,181 INFO L290 TraceCheckUtils]: 47: Hoare triple {4394#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,182 INFO L290 TraceCheckUtils]: 48: Hoare triple {4394#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4449#(<= |main_#t~post7| 2)} is VALID [2022-04-28 12:56:09,182 INFO L290 TraceCheckUtils]: 49: Hoare triple {4449#(<= |main_#t~post7| 2)} assume !(#t~post7 < 5);havoc #t~post7; {4298#false} is VALID [2022-04-28 12:56:09,182 INFO L272 TraceCheckUtils]: 50: Hoare triple {4298#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4298#false} is VALID [2022-04-28 12:56:09,182 INFO L290 TraceCheckUtils]: 51: Hoare triple {4298#false} ~cond := #in~cond; {4298#false} is VALID [2022-04-28 12:56:09,182 INFO L290 TraceCheckUtils]: 52: Hoare triple {4298#false} assume !(0 == ~cond); {4298#false} is VALID [2022-04-28 12:56:09,182 INFO L290 TraceCheckUtils]: 53: Hoare triple {4298#false} assume true; {4298#false} is VALID [2022-04-28 12:56:09,182 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {4298#false} {4298#false} #92#return; {4298#false} is VALID [2022-04-28 12:56:09,183 INFO L272 TraceCheckUtils]: 55: Hoare triple {4298#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {4298#false} is VALID [2022-04-28 12:56:09,183 INFO L290 TraceCheckUtils]: 56: Hoare triple {4298#false} ~cond := #in~cond; {4298#false} is VALID [2022-04-28 12:56:09,183 INFO L290 TraceCheckUtils]: 57: Hoare triple {4298#false} assume 0 == ~cond; {4298#false} is VALID [2022-04-28 12:56:09,183 INFO L290 TraceCheckUtils]: 58: Hoare triple {4298#false} assume !false; {4298#false} is VALID [2022-04-28 12:56:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-28 12:56:09,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:56:09,430 INFO L290 TraceCheckUtils]: 58: Hoare triple {4298#false} assume !false; {4298#false} is VALID [2022-04-28 12:56:09,430 INFO L290 TraceCheckUtils]: 57: Hoare triple {4298#false} assume 0 == ~cond; {4298#false} is VALID [2022-04-28 12:56:09,430 INFO L290 TraceCheckUtils]: 56: Hoare triple {4298#false} ~cond := #in~cond; {4298#false} is VALID [2022-04-28 12:56:09,430 INFO L272 TraceCheckUtils]: 55: Hoare triple {4298#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {4298#false} is VALID [2022-04-28 12:56:09,430 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {4297#true} {4298#false} #92#return; {4298#false} is VALID [2022-04-28 12:56:09,430 INFO L290 TraceCheckUtils]: 53: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-28 12:56:09,430 INFO L290 TraceCheckUtils]: 52: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-28 12:56:09,430 INFO L290 TraceCheckUtils]: 51: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-28 12:56:09,430 INFO L272 TraceCheckUtils]: 50: Hoare triple {4298#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4297#true} is VALID [2022-04-28 12:56:09,430 INFO L290 TraceCheckUtils]: 49: Hoare triple {4507#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {4298#false} is VALID [2022-04-28 12:56:09,431 INFO L290 TraceCheckUtils]: 48: Hoare triple {4511#(< ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4507#(< |main_#t~post7| 5)} is VALID [2022-04-28 12:56:09,431 INFO L290 TraceCheckUtils]: 47: Hoare triple {4511#(< ~counter~0 5)} assume !(~r~0 >= ~d~0); {4511#(< ~counter~0 5)} is VALID [2022-04-28 12:56:09,432 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4297#true} {4511#(< ~counter~0 5)} #86#return; {4511#(< ~counter~0 5)} is VALID [2022-04-28 12:56:09,432 INFO L290 TraceCheckUtils]: 45: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-28 12:56:09,432 INFO L290 TraceCheckUtils]: 44: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-28 12:56:09,432 INFO L290 TraceCheckUtils]: 43: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-28 12:56:09,432 INFO L272 TraceCheckUtils]: 42: Hoare triple {4511#(< ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4297#true} is VALID [2022-04-28 12:56:09,433 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4297#true} {4511#(< ~counter~0 5)} #84#return; {4511#(< ~counter~0 5)} is VALID [2022-04-28 12:56:09,433 INFO L290 TraceCheckUtils]: 40: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-28 12:56:09,433 INFO L290 TraceCheckUtils]: 39: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-28 12:56:09,433 INFO L290 TraceCheckUtils]: 38: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-28 12:56:09,433 INFO L272 TraceCheckUtils]: 37: Hoare triple {4511#(< ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {4297#true} is VALID [2022-04-28 12:56:09,433 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4297#true} {4511#(< ~counter~0 5)} #82#return; {4511#(< ~counter~0 5)} is VALID [2022-04-28 12:56:09,433 INFO L290 TraceCheckUtils]: 35: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-28 12:56:09,433 INFO L290 TraceCheckUtils]: 34: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-28 12:56:09,433 INFO L290 TraceCheckUtils]: 33: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-28 12:56:09,433 INFO L272 TraceCheckUtils]: 32: Hoare triple {4511#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4297#true} is VALID [2022-04-28 12:56:09,434 INFO L290 TraceCheckUtils]: 31: Hoare triple {4511#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {4511#(< ~counter~0 5)} is VALID [2022-04-28 12:56:09,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {4566#(< ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4511#(< ~counter~0 5)} is VALID [2022-04-28 12:56:09,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {4566#(< ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4566#(< ~counter~0 4)} is VALID [2022-04-28 12:56:09,435 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4297#true} {4566#(< ~counter~0 4)} #86#return; {4566#(< ~counter~0 4)} is VALID [2022-04-28 12:56:09,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-28 12:56:09,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-28 12:56:09,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-28 12:56:09,435 INFO L272 TraceCheckUtils]: 24: Hoare triple {4566#(< ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4297#true} is VALID [2022-04-28 12:56:09,436 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4297#true} {4566#(< ~counter~0 4)} #84#return; {4566#(< ~counter~0 4)} is VALID [2022-04-28 12:56:09,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-28 12:56:09,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-28 12:56:09,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-28 12:56:09,436 INFO L272 TraceCheckUtils]: 19: Hoare triple {4566#(< ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {4297#true} is VALID [2022-04-28 12:56:09,436 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4297#true} {4566#(< ~counter~0 4)} #82#return; {4566#(< ~counter~0 4)} is VALID [2022-04-28 12:56:09,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-28 12:56:09,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-28 12:56:09,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-28 12:56:09,437 INFO L272 TraceCheckUtils]: 14: Hoare triple {4566#(< ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4297#true} is VALID [2022-04-28 12:56:09,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {4566#(< ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {4566#(< ~counter~0 4)} is VALID [2022-04-28 12:56:09,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {4394#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4566#(< ~counter~0 4)} is VALID [2022-04-28 12:56:09,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {4394#(<= ~counter~0 2)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,438 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4297#true} {4394#(<= ~counter~0 2)} #80#return; {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-28 12:56:09,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-28 12:56:09,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-28 12:56:09,438 INFO L272 TraceCheckUtils]: 6: Hoare triple {4394#(<= ~counter~0 2)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4297#true} is VALID [2022-04-28 12:56:09,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {4394#(<= ~counter~0 2)} 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; {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {4394#(<= ~counter~0 2)} call #t~ret8 := main(); {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4394#(<= ~counter~0 2)} {4297#true} #96#return; {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {4394#(<= ~counter~0 2)} assume true; {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {4297#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);~counter~0 := 0; {4394#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:09,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {4297#true} call ULTIMATE.init(); {4297#true} is VALID [2022-04-28 12:56:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 12:56:09,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:56:09,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232197597] [2022-04-28 12:56:09,440 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:56:09,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873058451] [2022-04-28 12:56:09,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873058451] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:56:09,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:56:09,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-28 12:56:09,441 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:56:09,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [529799353] [2022-04-28 12:56:09,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [529799353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:56:09,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:56:09,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:56:09,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833230569] [2022-04-28 12:56:09,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:56:09,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 59 [2022-04-28 12:56:09,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:56:09,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-28 12:56:09,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:56:09,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:56:09,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:56:09,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:56:09,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:56:09,475 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-28 12:56:09,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:56:09,639 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2022-04-28 12:56:09,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:56:09,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 59 [2022-04-28 12:56:09,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:56:09,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-28 12:56:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-04-28 12:56:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-28 12:56:09,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-04-28 12:56:09,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2022-04-28 12:56:09,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:56:09,693 INFO L225 Difference]: With dead ends: 110 [2022-04-28 12:56:09,693 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 12:56:09,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:56:09,694 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 14 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:56:09,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 129 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:56:09,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 12:56:09,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2022-04-28 12:56:09,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:56:09,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 97 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 65 states have internal predecessors, (73), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 12:56:09,770 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 97 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 65 states have internal predecessors, (73), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 12:56:09,770 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 97 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 65 states have internal predecessors, (73), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 12:56:09,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:56:09,771 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2022-04-28 12:56:09,772 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2022-04-28 12:56:09,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:56:09,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:56:09,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 65 states have internal predecessors, (73), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 98 states. [2022-04-28 12:56:09,772 INFO L87 Difference]: Start difference. First operand has 97 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 65 states have internal predecessors, (73), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 98 states. [2022-04-28 12:56:09,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:56:09,774 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2022-04-28 12:56:09,774 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2022-04-28 12:56:09,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:56:09,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:56:09,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:56:09,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:56:09,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 65 states have internal predecessors, (73), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 12:56:09,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2022-04-28 12:56:09,776 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 59 [2022-04-28 12:56:09,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:56:09,776 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2022-04-28 12:56:09,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-28 12:56:09,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 113 transitions. [2022-04-28 12:56:09,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:56:09,879 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2022-04-28 12:56:09,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 12:56:09,880 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:56:09,880 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 3, 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-28 12:56:09,897 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-28 12:56:10,080 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-28 12:56:10,080 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:56:10,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:56:10,080 INFO L85 PathProgramCache]: Analyzing trace with hash 940283669, now seen corresponding path program 3 times [2022-04-28 12:56:10,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:56:10,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1189965231] [2022-04-28 12:56:18,272 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 12:56:18,272 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 12:56:18,273 INFO L85 PathProgramCache]: Analyzing trace with hash 940283669, now seen corresponding path program 4 times [2022-04-28 12:56:18,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:56:18,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688880273] [2022-04-28 12:56:18,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:56:18,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:56:18,280 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:56:18,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [472088855] [2022-04-28 12:56:18,280 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:56:18,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:56:18,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:56:18,281 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-28 12:56:18,309 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-28 12:56:18,336 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:56:18,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:56:18,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 12:56:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:56:18,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:56:18,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {5269#true} call ULTIMATE.init(); {5269#true} is VALID [2022-04-28 12:56:18,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {5269#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);~counter~0 := 0; {5277#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:18,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {5277#(<= ~counter~0 0)} assume true; {5277#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:18,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5277#(<= ~counter~0 0)} {5269#true} #96#return; {5277#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:18,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {5277#(<= ~counter~0 0)} call #t~ret8 := main(); {5277#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:18,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {5277#(<= ~counter~0 0)} 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; {5277#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:18,590 INFO L272 TraceCheckUtils]: 6: Hoare triple {5277#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {5277#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:18,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {5277#(<= ~counter~0 0)} ~cond := #in~cond; {5277#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:18,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {5277#(<= ~counter~0 0)} assume !(0 == ~cond); {5277#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:18,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {5277#(<= ~counter~0 0)} assume true; {5277#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:18,592 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5277#(<= ~counter~0 0)} {5277#(<= ~counter~0 0)} #80#return; {5277#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:18,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {5277#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {5277#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:18,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {5277#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5311#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:18,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {5311#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {5311#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:18,593 INFO L272 TraceCheckUtils]: 14: Hoare triple {5311#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5311#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:18,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {5311#(<= ~counter~0 1)} ~cond := #in~cond; {5311#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:18,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {5311#(<= ~counter~0 1)} assume !(0 == ~cond); {5311#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:18,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {5311#(<= ~counter~0 1)} assume true; {5311#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:18,595 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5311#(<= ~counter~0 1)} {5311#(<= ~counter~0 1)} #82#return; {5311#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:18,595 INFO L272 TraceCheckUtils]: 19: Hoare triple {5311#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5311#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:18,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {5311#(<= ~counter~0 1)} ~cond := #in~cond; {5311#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:18,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {5311#(<= ~counter~0 1)} assume !(0 == ~cond); {5311#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:18,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {5311#(<= ~counter~0 1)} assume true; {5311#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:18,596 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5311#(<= ~counter~0 1)} {5311#(<= ~counter~0 1)} #84#return; {5311#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:18,597 INFO L272 TraceCheckUtils]: 24: Hoare triple {5311#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5311#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:18,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {5311#(<= ~counter~0 1)} ~cond := #in~cond; {5311#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:18,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {5311#(<= ~counter~0 1)} assume !(0 == ~cond); {5311#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:18,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {5311#(<= ~counter~0 1)} assume true; {5311#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:18,598 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5311#(<= ~counter~0 1)} {5311#(<= ~counter~0 1)} #86#return; {5311#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:18,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {5311#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5311#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:18,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {5311#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {5366#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,599 INFO L272 TraceCheckUtils]: 32: Hoare triple {5366#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {5366#(<= ~counter~0 2)} ~cond := #in~cond; {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {5366#(<= ~counter~0 2)} assume !(0 == ~cond); {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {5366#(<= ~counter~0 2)} assume true; {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,601 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5366#(<= ~counter~0 2)} {5366#(<= ~counter~0 2)} #82#return; {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,601 INFO L272 TraceCheckUtils]: 37: Hoare triple {5366#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,601 INFO L290 TraceCheckUtils]: 38: Hoare triple {5366#(<= ~counter~0 2)} ~cond := #in~cond; {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,602 INFO L290 TraceCheckUtils]: 39: Hoare triple {5366#(<= ~counter~0 2)} assume !(0 == ~cond); {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,602 INFO L290 TraceCheckUtils]: 40: Hoare triple {5366#(<= ~counter~0 2)} assume true; {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,602 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5366#(<= ~counter~0 2)} {5366#(<= ~counter~0 2)} #84#return; {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,603 INFO L272 TraceCheckUtils]: 42: Hoare triple {5366#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,603 INFO L290 TraceCheckUtils]: 43: Hoare triple {5366#(<= ~counter~0 2)} ~cond := #in~cond; {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,603 INFO L290 TraceCheckUtils]: 44: Hoare triple {5366#(<= ~counter~0 2)} assume !(0 == ~cond); {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,604 INFO L290 TraceCheckUtils]: 45: Hoare triple {5366#(<= ~counter~0 2)} assume true; {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,604 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5366#(<= ~counter~0 2)} {5366#(<= ~counter~0 2)} #86#return; {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,604 INFO L290 TraceCheckUtils]: 47: Hoare triple {5366#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,605 INFO L290 TraceCheckUtils]: 48: Hoare triple {5366#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5421#(<= |main_#t~post6| 2)} is VALID [2022-04-28 12:56:18,605 INFO L290 TraceCheckUtils]: 49: Hoare triple {5421#(<= |main_#t~post6| 2)} assume !(#t~post6 < 5);havoc #t~post6; {5270#false} is VALID [2022-04-28 12:56:18,605 INFO L290 TraceCheckUtils]: 50: Hoare triple {5270#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5270#false} is VALID [2022-04-28 12:56:18,605 INFO L290 TraceCheckUtils]: 51: Hoare triple {5270#false} assume !(#t~post7 < 5);havoc #t~post7; {5270#false} is VALID [2022-04-28 12:56:18,605 INFO L272 TraceCheckUtils]: 52: Hoare triple {5270#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {5270#false} is VALID [2022-04-28 12:56:18,605 INFO L290 TraceCheckUtils]: 53: Hoare triple {5270#false} ~cond := #in~cond; {5270#false} is VALID [2022-04-28 12:56:18,606 INFO L290 TraceCheckUtils]: 54: Hoare triple {5270#false} assume !(0 == ~cond); {5270#false} is VALID [2022-04-28 12:56:18,606 INFO L290 TraceCheckUtils]: 55: Hoare triple {5270#false} assume true; {5270#false} is VALID [2022-04-28 12:56:18,606 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5270#false} {5270#false} #92#return; {5270#false} is VALID [2022-04-28 12:56:18,606 INFO L272 TraceCheckUtils]: 57: Hoare triple {5270#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {5270#false} is VALID [2022-04-28 12:56:18,606 INFO L290 TraceCheckUtils]: 58: Hoare triple {5270#false} ~cond := #in~cond; {5270#false} is VALID [2022-04-28 12:56:18,606 INFO L290 TraceCheckUtils]: 59: Hoare triple {5270#false} assume 0 == ~cond; {5270#false} is VALID [2022-04-28 12:56:18,606 INFO L290 TraceCheckUtils]: 60: Hoare triple {5270#false} assume !false; {5270#false} is VALID [2022-04-28 12:56:18,606 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 36 proven. 46 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-28 12:56:18,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:56:18,892 INFO L290 TraceCheckUtils]: 60: Hoare triple {5270#false} assume !false; {5270#false} is VALID [2022-04-28 12:56:18,892 INFO L290 TraceCheckUtils]: 59: Hoare triple {5270#false} assume 0 == ~cond; {5270#false} is VALID [2022-04-28 12:56:18,892 INFO L290 TraceCheckUtils]: 58: Hoare triple {5270#false} ~cond := #in~cond; {5270#false} is VALID [2022-04-28 12:56:18,892 INFO L272 TraceCheckUtils]: 57: Hoare triple {5270#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {5270#false} is VALID [2022-04-28 12:56:18,893 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5269#true} {5270#false} #92#return; {5270#false} is VALID [2022-04-28 12:56:18,893 INFO L290 TraceCheckUtils]: 55: Hoare triple {5269#true} assume true; {5269#true} is VALID [2022-04-28 12:56:18,893 INFO L290 TraceCheckUtils]: 54: Hoare triple {5269#true} assume !(0 == ~cond); {5269#true} is VALID [2022-04-28 12:56:18,893 INFO L290 TraceCheckUtils]: 53: Hoare triple {5269#true} ~cond := #in~cond; {5269#true} is VALID [2022-04-28 12:56:18,893 INFO L272 TraceCheckUtils]: 52: Hoare triple {5270#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {5269#true} is VALID [2022-04-28 12:56:18,893 INFO L290 TraceCheckUtils]: 51: Hoare triple {5270#false} assume !(#t~post7 < 5);havoc #t~post7; {5270#false} is VALID [2022-04-28 12:56:18,893 INFO L290 TraceCheckUtils]: 50: Hoare triple {5270#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5270#false} is VALID [2022-04-28 12:56:18,893 INFO L290 TraceCheckUtils]: 49: Hoare triple {5491#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {5270#false} is VALID [2022-04-28 12:56:18,894 INFO L290 TraceCheckUtils]: 48: Hoare triple {5495#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5491#(< |main_#t~post6| 5)} is VALID [2022-04-28 12:56:18,894 INFO L290 TraceCheckUtils]: 47: Hoare triple {5495#(< ~counter~0 5)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5495#(< ~counter~0 5)} is VALID [2022-04-28 12:56:18,894 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5269#true} {5495#(< ~counter~0 5)} #86#return; {5495#(< ~counter~0 5)} is VALID [2022-04-28 12:56:18,895 INFO L290 TraceCheckUtils]: 45: Hoare triple {5269#true} assume true; {5269#true} is VALID [2022-04-28 12:56:18,895 INFO L290 TraceCheckUtils]: 44: Hoare triple {5269#true} assume !(0 == ~cond); {5269#true} is VALID [2022-04-28 12:56:18,895 INFO L290 TraceCheckUtils]: 43: Hoare triple {5269#true} ~cond := #in~cond; {5269#true} is VALID [2022-04-28 12:56:18,895 INFO L272 TraceCheckUtils]: 42: Hoare triple {5495#(< ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5269#true} is VALID [2022-04-28 12:56:18,895 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5269#true} {5495#(< ~counter~0 5)} #84#return; {5495#(< ~counter~0 5)} is VALID [2022-04-28 12:56:18,895 INFO L290 TraceCheckUtils]: 40: Hoare triple {5269#true} assume true; {5269#true} is VALID [2022-04-28 12:56:18,895 INFO L290 TraceCheckUtils]: 39: Hoare triple {5269#true} assume !(0 == ~cond); {5269#true} is VALID [2022-04-28 12:56:18,895 INFO L290 TraceCheckUtils]: 38: Hoare triple {5269#true} ~cond := #in~cond; {5269#true} is VALID [2022-04-28 12:56:18,895 INFO L272 TraceCheckUtils]: 37: Hoare triple {5495#(< ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5269#true} is VALID [2022-04-28 12:56:18,896 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5269#true} {5495#(< ~counter~0 5)} #82#return; {5495#(< ~counter~0 5)} is VALID [2022-04-28 12:56:18,896 INFO L290 TraceCheckUtils]: 35: Hoare triple {5269#true} assume true; {5269#true} is VALID [2022-04-28 12:56:18,896 INFO L290 TraceCheckUtils]: 34: Hoare triple {5269#true} assume !(0 == ~cond); {5269#true} is VALID [2022-04-28 12:56:18,896 INFO L290 TraceCheckUtils]: 33: Hoare triple {5269#true} ~cond := #in~cond; {5269#true} is VALID [2022-04-28 12:56:18,896 INFO L272 TraceCheckUtils]: 32: Hoare triple {5495#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5269#true} is VALID [2022-04-28 12:56:18,896 INFO L290 TraceCheckUtils]: 31: Hoare triple {5495#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {5495#(< ~counter~0 5)} is VALID [2022-04-28 12:56:18,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {5550#(< ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5495#(< ~counter~0 5)} is VALID [2022-04-28 12:56:18,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {5550#(< ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5550#(< ~counter~0 4)} is VALID [2022-04-28 12:56:18,898 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5269#true} {5550#(< ~counter~0 4)} #86#return; {5550#(< ~counter~0 4)} is VALID [2022-04-28 12:56:18,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {5269#true} assume true; {5269#true} is VALID [2022-04-28 12:56:18,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {5269#true} assume !(0 == ~cond); {5269#true} is VALID [2022-04-28 12:56:18,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {5269#true} ~cond := #in~cond; {5269#true} is VALID [2022-04-28 12:56:18,898 INFO L272 TraceCheckUtils]: 24: Hoare triple {5550#(< ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5269#true} is VALID [2022-04-28 12:56:18,898 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5269#true} {5550#(< ~counter~0 4)} #84#return; {5550#(< ~counter~0 4)} is VALID [2022-04-28 12:56:18,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {5269#true} assume true; {5269#true} is VALID [2022-04-28 12:56:18,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {5269#true} assume !(0 == ~cond); {5269#true} is VALID [2022-04-28 12:56:18,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {5269#true} ~cond := #in~cond; {5269#true} is VALID [2022-04-28 12:56:18,898 INFO L272 TraceCheckUtils]: 19: Hoare triple {5550#(< ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5269#true} is VALID [2022-04-28 12:56:18,899 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5269#true} {5550#(< ~counter~0 4)} #82#return; {5550#(< ~counter~0 4)} is VALID [2022-04-28 12:56:18,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {5269#true} assume true; {5269#true} is VALID [2022-04-28 12:56:18,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {5269#true} assume !(0 == ~cond); {5269#true} is VALID [2022-04-28 12:56:18,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {5269#true} ~cond := #in~cond; {5269#true} is VALID [2022-04-28 12:56:18,899 INFO L272 TraceCheckUtils]: 14: Hoare triple {5550#(< ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5269#true} is VALID [2022-04-28 12:56:18,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {5550#(< ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {5550#(< ~counter~0 4)} is VALID [2022-04-28 12:56:18,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {5366#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5550#(< ~counter~0 4)} is VALID [2022-04-28 12:56:18,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {5366#(<= ~counter~0 2)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,900 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5269#true} {5366#(<= ~counter~0 2)} #80#return; {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {5269#true} assume true; {5269#true} is VALID [2022-04-28 12:56:18,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {5269#true} assume !(0 == ~cond); {5269#true} is VALID [2022-04-28 12:56:18,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {5269#true} ~cond := #in~cond; {5269#true} is VALID [2022-04-28 12:56:18,901 INFO L272 TraceCheckUtils]: 6: Hoare triple {5366#(<= ~counter~0 2)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {5269#true} is VALID [2022-04-28 12:56:18,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {5366#(<= ~counter~0 2)} 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; {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {5366#(<= ~counter~0 2)} call #t~ret8 := main(); {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5366#(<= ~counter~0 2)} {5269#true} #96#return; {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {5366#(<= ~counter~0 2)} assume true; {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {5269#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);~counter~0 := 0; {5366#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:18,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {5269#true} call ULTIMATE.init(); {5269#true} is VALID [2022-04-28 12:56:18,903 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 12:56:18,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:56:18,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688880273] [2022-04-28 12:56:18,903 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:56:18,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472088855] [2022-04-28 12:56:18,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472088855] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:56:18,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:56:18,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-28 12:56:18,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:56:18,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1189965231] [2022-04-28 12:56:18,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1189965231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:56:18,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:56:18,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:56:18,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436907582] [2022-04-28 12:56:18,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:56:18,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 61 [2022-04-28 12:56:18,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:56:18,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-28 12:56:18,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:56:18,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:56:18,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:56:18,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:56:18,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:56:18,942 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-28 12:56:19,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:56:19,166 INFO L93 Difference]: Finished difference Result 132 states and 161 transitions. [2022-04-28 12:56:19,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 12:56:19,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 61 [2022-04-28 12:56:19,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:56:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-28 12:56:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-28 12:56:19,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-28 12:56:19,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-28 12:56:19,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 90 transitions. [2022-04-28 12:56:19,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:56:19,222 INFO L225 Difference]: With dead ends: 132 [2022-04-28 12:56:19,222 INFO L226 Difference]: Without dead ends: 99 [2022-04-28 12:56:19,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-28 12:56:19,222 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 13 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:56:19,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 126 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:56:19,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-28 12:56:19,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-04-28 12:56:19,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:56:19,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 99 states, 64 states have (on average 1.171875) internal successors, (75), 67 states have internal predecessors, (75), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 12:56:19,274 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 99 states, 64 states have (on average 1.171875) internal successors, (75), 67 states have internal predecessors, (75), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 12:56:19,275 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 99 states, 64 states have (on average 1.171875) internal successors, (75), 67 states have internal predecessors, (75), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 12:56:19,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:56:19,276 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2022-04-28 12:56:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2022-04-28 12:56:19,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:56:19,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:56:19,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 64 states have (on average 1.171875) internal successors, (75), 67 states have internal predecessors, (75), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 99 states. [2022-04-28 12:56:19,277 INFO L87 Difference]: Start difference. First operand has 99 states, 64 states have (on average 1.171875) internal successors, (75), 67 states have internal predecessors, (75), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 99 states. [2022-04-28 12:56:19,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:56:19,278 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2022-04-28 12:56:19,278 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2022-04-28 12:56:19,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:56:19,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:56:19,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:56:19,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:56:19,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.171875) internal successors, (75), 67 states have internal predecessors, (75), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 12:56:19,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2022-04-28 12:56:19,280 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 61 [2022-04-28 12:56:19,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:56:19,281 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2022-04-28 12:56:19,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-28 12:56:19,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 115 transitions. [2022-04-28 12:56:19,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:56:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2022-04-28 12:56:19,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 12:56:19,390 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:56:19,390 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, 1, 1, 1, 1] [2022-04-28 12:56:19,410 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-28 12:56:19,590 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-28 12:56:19,590 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:56:19,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:56:19,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1140868055, now seen corresponding path program 1 times [2022-04-28 12:56:19,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:56:19,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1282305080] [2022-04-28 12:56:26,945 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 12:56:26,945 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 12:56:26,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1140868055, now seen corresponding path program 2 times [2022-04-28 12:56:26,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:56:26,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135655226] [2022-04-28 12:56:26,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:56:26,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:56:26,953 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:56:26,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [868573511] [2022-04-28 12:56:26,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:56:26,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:56:26,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:56:26,963 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-28 12:56:26,965 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-28 12:56:27,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:56:27,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:56:27,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 12:56:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:56:27,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:56:27,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {6307#true} call ULTIMATE.init(); {6307#true} is VALID [2022-04-28 12:56:27,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {6307#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);~counter~0 := 0; {6315#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:27,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {6315#(<= ~counter~0 0)} assume true; {6315#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:27,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6315#(<= ~counter~0 0)} {6307#true} #96#return; {6315#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:27,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {6315#(<= ~counter~0 0)} call #t~ret8 := main(); {6315#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:27,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {6315#(<= ~counter~0 0)} 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; {6315#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:27,312 INFO L272 TraceCheckUtils]: 6: Hoare triple {6315#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {6315#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:27,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {6315#(<= ~counter~0 0)} ~cond := #in~cond; {6315#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:27,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {6315#(<= ~counter~0 0)} assume !(0 == ~cond); {6315#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:27,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {6315#(<= ~counter~0 0)} assume true; {6315#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:27,313 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6315#(<= ~counter~0 0)} {6315#(<= ~counter~0 0)} #80#return; {6315#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:27,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {6315#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {6315#(<= ~counter~0 0)} is VALID [2022-04-28 12:56:27,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {6315#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {6349#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,323 INFO L272 TraceCheckUtils]: 14: Hoare triple {6349#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {6349#(<= ~counter~0 1)} ~cond := #in~cond; {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {6349#(<= ~counter~0 1)} assume !(0 == ~cond); {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {6349#(<= ~counter~0 1)} assume true; {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,324 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6349#(<= ~counter~0 1)} {6349#(<= ~counter~0 1)} #82#return; {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,324 INFO L272 TraceCheckUtils]: 19: Hoare triple {6349#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {6349#(<= ~counter~0 1)} ~cond := #in~cond; {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {6349#(<= ~counter~0 1)} assume !(0 == ~cond); {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {6349#(<= ~counter~0 1)} assume true; {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,326 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6349#(<= ~counter~0 1)} {6349#(<= ~counter~0 1)} #84#return; {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,326 INFO L272 TraceCheckUtils]: 24: Hoare triple {6349#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {6349#(<= ~counter~0 1)} ~cond := #in~cond; {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {6349#(<= ~counter~0 1)} assume !(0 == ~cond); {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {6349#(<= ~counter~0 1)} assume true; {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,327 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6349#(<= ~counter~0 1)} {6349#(<= ~counter~0 1)} #86#return; {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {6349#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {6349#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {6404#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,328 INFO L272 TraceCheckUtils]: 32: Hoare triple {6404#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,329 INFO L290 TraceCheckUtils]: 33: Hoare triple {6404#(<= ~counter~0 2)} ~cond := #in~cond; {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,329 INFO L290 TraceCheckUtils]: 34: Hoare triple {6404#(<= ~counter~0 2)} assume !(0 == ~cond); {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,329 INFO L290 TraceCheckUtils]: 35: Hoare triple {6404#(<= ~counter~0 2)} assume true; {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,329 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6404#(<= ~counter~0 2)} {6404#(<= ~counter~0 2)} #82#return; {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,330 INFO L272 TraceCheckUtils]: 37: Hoare triple {6404#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,330 INFO L290 TraceCheckUtils]: 38: Hoare triple {6404#(<= ~counter~0 2)} ~cond := #in~cond; {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,330 INFO L290 TraceCheckUtils]: 39: Hoare triple {6404#(<= ~counter~0 2)} assume !(0 == ~cond); {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,330 INFO L290 TraceCheckUtils]: 40: Hoare triple {6404#(<= ~counter~0 2)} assume true; {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,331 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6404#(<= ~counter~0 2)} {6404#(<= ~counter~0 2)} #84#return; {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,331 INFO L272 TraceCheckUtils]: 42: Hoare triple {6404#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,331 INFO L290 TraceCheckUtils]: 43: Hoare triple {6404#(<= ~counter~0 2)} ~cond := #in~cond; {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,331 INFO L290 TraceCheckUtils]: 44: Hoare triple {6404#(<= ~counter~0 2)} assume !(0 == ~cond); {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,332 INFO L290 TraceCheckUtils]: 45: Hoare triple {6404#(<= ~counter~0 2)} assume true; {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,332 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6404#(<= ~counter~0 2)} {6404#(<= ~counter~0 2)} #86#return; {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,332 INFO L290 TraceCheckUtils]: 47: Hoare triple {6404#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,332 INFO L290 TraceCheckUtils]: 48: Hoare triple {6404#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6459#(<= ~counter~0 3)} is VALID [2022-04-28 12:56:27,333 INFO L290 TraceCheckUtils]: 49: Hoare triple {6459#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {6459#(<= ~counter~0 3)} is VALID [2022-04-28 12:56:27,333 INFO L272 TraceCheckUtils]: 50: Hoare triple {6459#(<= ~counter~0 3)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {6459#(<= ~counter~0 3)} is VALID [2022-04-28 12:56:27,333 INFO L290 TraceCheckUtils]: 51: Hoare triple {6459#(<= ~counter~0 3)} ~cond := #in~cond; {6459#(<= ~counter~0 3)} is VALID [2022-04-28 12:56:27,333 INFO L290 TraceCheckUtils]: 52: Hoare triple {6459#(<= ~counter~0 3)} assume !(0 == ~cond); {6459#(<= ~counter~0 3)} is VALID [2022-04-28 12:56:27,334 INFO L290 TraceCheckUtils]: 53: Hoare triple {6459#(<= ~counter~0 3)} assume true; {6459#(<= ~counter~0 3)} is VALID [2022-04-28 12:56:27,334 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6459#(<= ~counter~0 3)} {6459#(<= ~counter~0 3)} #88#return; {6459#(<= ~counter~0 3)} is VALID [2022-04-28 12:56:27,334 INFO L272 TraceCheckUtils]: 55: Hoare triple {6459#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6459#(<= ~counter~0 3)} is VALID [2022-04-28 12:56:27,335 INFO L290 TraceCheckUtils]: 56: Hoare triple {6459#(<= ~counter~0 3)} ~cond := #in~cond; {6459#(<= ~counter~0 3)} is VALID [2022-04-28 12:56:27,335 INFO L290 TraceCheckUtils]: 57: Hoare triple {6459#(<= ~counter~0 3)} assume !(0 == ~cond); {6459#(<= ~counter~0 3)} is VALID [2022-04-28 12:56:27,335 INFO L290 TraceCheckUtils]: 58: Hoare triple {6459#(<= ~counter~0 3)} assume true; {6459#(<= ~counter~0 3)} is VALID [2022-04-28 12:56:27,335 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6459#(<= ~counter~0 3)} {6459#(<= ~counter~0 3)} #90#return; {6459#(<= ~counter~0 3)} is VALID [2022-04-28 12:56:27,336 INFO L290 TraceCheckUtils]: 60: Hoare triple {6459#(<= ~counter~0 3)} 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); {6459#(<= ~counter~0 3)} is VALID [2022-04-28 12:56:27,336 INFO L290 TraceCheckUtils]: 61: Hoare triple {6459#(<= ~counter~0 3)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {6459#(<= ~counter~0 3)} is VALID [2022-04-28 12:56:27,336 INFO L290 TraceCheckUtils]: 62: Hoare triple {6459#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6502#(<= |main_#t~post7| 3)} is VALID [2022-04-28 12:56:27,336 INFO L290 TraceCheckUtils]: 63: Hoare triple {6502#(<= |main_#t~post7| 3)} assume !(#t~post7 < 5);havoc #t~post7; {6308#false} is VALID [2022-04-28 12:56:27,336 INFO L272 TraceCheckUtils]: 64: Hoare triple {6308#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {6308#false} is VALID [2022-04-28 12:56:27,337 INFO L290 TraceCheckUtils]: 65: Hoare triple {6308#false} ~cond := #in~cond; {6308#false} is VALID [2022-04-28 12:56:27,337 INFO L290 TraceCheckUtils]: 66: Hoare triple {6308#false} assume 0 == ~cond; {6308#false} is VALID [2022-04-28 12:56:27,337 INFO L290 TraceCheckUtils]: 67: Hoare triple {6308#false} assume !false; {6308#false} is VALID [2022-04-28 12:56:27,337 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 92 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 12:56:27,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:56:27,595 INFO L290 TraceCheckUtils]: 67: Hoare triple {6308#false} assume !false; {6308#false} is VALID [2022-04-28 12:56:27,596 INFO L290 TraceCheckUtils]: 66: Hoare triple {6308#false} assume 0 == ~cond; {6308#false} is VALID [2022-04-28 12:56:27,596 INFO L290 TraceCheckUtils]: 65: Hoare triple {6308#false} ~cond := #in~cond; {6308#false} is VALID [2022-04-28 12:56:27,596 INFO L272 TraceCheckUtils]: 64: Hoare triple {6308#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {6308#false} is VALID [2022-04-28 12:56:27,596 INFO L290 TraceCheckUtils]: 63: Hoare triple {6530#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {6308#false} is VALID [2022-04-28 12:56:27,596 INFO L290 TraceCheckUtils]: 62: Hoare triple {6534#(< ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6530#(< |main_#t~post7| 5)} is VALID [2022-04-28 12:56:27,597 INFO L290 TraceCheckUtils]: 61: Hoare triple {6534#(< ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {6534#(< ~counter~0 5)} is VALID [2022-04-28 12:56:27,597 INFO L290 TraceCheckUtils]: 60: Hoare triple {6534#(< ~counter~0 5)} 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); {6534#(< ~counter~0 5)} is VALID [2022-04-28 12:56:27,598 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6307#true} {6534#(< ~counter~0 5)} #90#return; {6534#(< ~counter~0 5)} is VALID [2022-04-28 12:56:27,598 INFO L290 TraceCheckUtils]: 58: Hoare triple {6307#true} assume true; {6307#true} is VALID [2022-04-28 12:56:27,598 INFO L290 TraceCheckUtils]: 57: Hoare triple {6307#true} assume !(0 == ~cond); {6307#true} is VALID [2022-04-28 12:56:27,598 INFO L290 TraceCheckUtils]: 56: Hoare triple {6307#true} ~cond := #in~cond; {6307#true} is VALID [2022-04-28 12:56:27,598 INFO L272 TraceCheckUtils]: 55: Hoare triple {6534#(< ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6307#true} is VALID [2022-04-28 12:56:27,598 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6307#true} {6534#(< ~counter~0 5)} #88#return; {6534#(< ~counter~0 5)} is VALID [2022-04-28 12:56:27,598 INFO L290 TraceCheckUtils]: 53: Hoare triple {6307#true} assume true; {6307#true} is VALID [2022-04-28 12:56:27,598 INFO L290 TraceCheckUtils]: 52: Hoare triple {6307#true} assume !(0 == ~cond); {6307#true} is VALID [2022-04-28 12:56:27,599 INFO L290 TraceCheckUtils]: 51: Hoare triple {6307#true} ~cond := #in~cond; {6307#true} is VALID [2022-04-28 12:56:27,599 INFO L272 TraceCheckUtils]: 50: Hoare triple {6534#(< ~counter~0 5)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {6307#true} is VALID [2022-04-28 12:56:27,599 INFO L290 TraceCheckUtils]: 49: Hoare triple {6534#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {6534#(< ~counter~0 5)} is VALID [2022-04-28 12:56:27,599 INFO L290 TraceCheckUtils]: 48: Hoare triple {6459#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6534#(< ~counter~0 5)} is VALID [2022-04-28 12:56:27,600 INFO L290 TraceCheckUtils]: 47: Hoare triple {6459#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {6459#(<= ~counter~0 3)} is VALID [2022-04-28 12:56:27,600 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6307#true} {6459#(<= ~counter~0 3)} #86#return; {6459#(<= ~counter~0 3)} is VALID [2022-04-28 12:56:27,600 INFO L290 TraceCheckUtils]: 45: Hoare triple {6307#true} assume true; {6307#true} is VALID [2022-04-28 12:56:27,600 INFO L290 TraceCheckUtils]: 44: Hoare triple {6307#true} assume !(0 == ~cond); {6307#true} is VALID [2022-04-28 12:56:27,600 INFO L290 TraceCheckUtils]: 43: Hoare triple {6307#true} ~cond := #in~cond; {6307#true} is VALID [2022-04-28 12:56:27,600 INFO L272 TraceCheckUtils]: 42: Hoare triple {6459#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6307#true} is VALID [2022-04-28 12:56:27,601 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6307#true} {6459#(<= ~counter~0 3)} #84#return; {6459#(<= ~counter~0 3)} is VALID [2022-04-28 12:56:27,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {6307#true} assume true; {6307#true} is VALID [2022-04-28 12:56:27,601 INFO L290 TraceCheckUtils]: 39: Hoare triple {6307#true} assume !(0 == ~cond); {6307#true} is VALID [2022-04-28 12:56:27,601 INFO L290 TraceCheckUtils]: 38: Hoare triple {6307#true} ~cond := #in~cond; {6307#true} is VALID [2022-04-28 12:56:27,601 INFO L272 TraceCheckUtils]: 37: Hoare triple {6459#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {6307#true} is VALID [2022-04-28 12:56:27,602 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6307#true} {6459#(<= ~counter~0 3)} #82#return; {6459#(<= ~counter~0 3)} is VALID [2022-04-28 12:56:27,602 INFO L290 TraceCheckUtils]: 35: Hoare triple {6307#true} assume true; {6307#true} is VALID [2022-04-28 12:56:27,602 INFO L290 TraceCheckUtils]: 34: Hoare triple {6307#true} assume !(0 == ~cond); {6307#true} is VALID [2022-04-28 12:56:27,602 INFO L290 TraceCheckUtils]: 33: Hoare triple {6307#true} ~cond := #in~cond; {6307#true} is VALID [2022-04-28 12:56:27,602 INFO L272 TraceCheckUtils]: 32: Hoare triple {6459#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6307#true} is VALID [2022-04-28 12:56:27,602 INFO L290 TraceCheckUtils]: 31: Hoare triple {6459#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {6459#(<= ~counter~0 3)} is VALID [2022-04-28 12:56:27,603 INFO L290 TraceCheckUtils]: 30: Hoare triple {6404#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6459#(<= ~counter~0 3)} is VALID [2022-04-28 12:56:27,603 INFO L290 TraceCheckUtils]: 29: Hoare triple {6404#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,603 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6307#true} {6404#(<= ~counter~0 2)} #86#return; {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {6307#true} assume true; {6307#true} is VALID [2022-04-28 12:56:27,604 INFO L290 TraceCheckUtils]: 26: Hoare triple {6307#true} assume !(0 == ~cond); {6307#true} is VALID [2022-04-28 12:56:27,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {6307#true} ~cond := #in~cond; {6307#true} is VALID [2022-04-28 12:56:27,604 INFO L272 TraceCheckUtils]: 24: Hoare triple {6404#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6307#true} is VALID [2022-04-28 12:56:27,604 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6307#true} {6404#(<= ~counter~0 2)} #84#return; {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {6307#true} assume true; {6307#true} is VALID [2022-04-28 12:56:27,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {6307#true} assume !(0 == ~cond); {6307#true} is VALID [2022-04-28 12:56:27,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {6307#true} ~cond := #in~cond; {6307#true} is VALID [2022-04-28 12:56:27,604 INFO L272 TraceCheckUtils]: 19: Hoare triple {6404#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {6307#true} is VALID [2022-04-28 12:56:27,605 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6307#true} {6404#(<= ~counter~0 2)} #82#return; {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {6307#true} assume true; {6307#true} is VALID [2022-04-28 12:56:27,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {6307#true} assume !(0 == ~cond); {6307#true} is VALID [2022-04-28 12:56:27,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {6307#true} ~cond := #in~cond; {6307#true} is VALID [2022-04-28 12:56:27,605 INFO L272 TraceCheckUtils]: 14: Hoare triple {6404#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6307#true} is VALID [2022-04-28 12:56:27,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {6404#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {6349#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6404#(<= ~counter~0 2)} is VALID [2022-04-28 12:56:27,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {6349#(<= ~counter~0 1)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,606 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6307#true} {6349#(<= ~counter~0 1)} #80#return; {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {6307#true} assume true; {6307#true} is VALID [2022-04-28 12:56:27,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {6307#true} assume !(0 == ~cond); {6307#true} is VALID [2022-04-28 12:56:27,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {6307#true} ~cond := #in~cond; {6307#true} is VALID [2022-04-28 12:56:27,607 INFO L272 TraceCheckUtils]: 6: Hoare triple {6349#(<= ~counter~0 1)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {6307#true} is VALID [2022-04-28 12:56:27,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {6349#(<= ~counter~0 1)} 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; {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {6349#(<= ~counter~0 1)} call #t~ret8 := main(); {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6349#(<= ~counter~0 1)} {6307#true} #96#return; {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {6349#(<= ~counter~0 1)} assume true; {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {6307#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);~counter~0 := 0; {6349#(<= ~counter~0 1)} is VALID [2022-04-28 12:56:27,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {6307#true} call ULTIMATE.init(); {6307#true} is VALID [2022-04-28 12:56:27,608 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 12:56:27,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:56:27,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135655226] [2022-04-28 12:56:27,609 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:56:27,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868573511] [2022-04-28 12:56:27,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868573511] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:56:27,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:56:27,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 12:56:27,609 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:56:27,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1282305080] [2022-04-28 12:56:27,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1282305080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:56:27,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:56:27,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 12:56:27,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971277467] [2022-04-28 12:56:27,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:56:27,610 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 6 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 68 [2022-04-28 12:56:27,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:56:27,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 6 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 12:56:27,650 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-28 12:56:27,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 12:56:27,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:56:27,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 12:56:27,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:56:27,651 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 6 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 12:56:27,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:56:27,980 INFO L93 Difference]: Finished difference Result 151 states and 174 transitions. [2022-04-28 12:56:27,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 12:56:27,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 6 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 68 [2022-04-28 12:56:27,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:56:27,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 6 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 12:56:27,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-28 12:56:27,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 6 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 12:56:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-28 12:56:27,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 107 transitions. [2022-04-28 12:56:28,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:56:28,057 INFO L225 Difference]: With dead ends: 151 [2022-04-28 12:56:28,057 INFO L226 Difference]: Without dead ends: 136 [2022-04-28 12:56:28,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:56:28,057 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 29 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:56:28,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 173 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:56:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-04-28 12:56:28,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2022-04-28 12:56:28,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:56:28,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 133 states, 87 states have (on average 1.160919540229885) internal successors, (101), 90 states have internal predecessors, (101), 28 states have call successors, (28), 19 states have call predecessors, (28), 17 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 12:56:28,148 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 133 states, 87 states have (on average 1.160919540229885) internal successors, (101), 90 states have internal predecessors, (101), 28 states have call successors, (28), 19 states have call predecessors, (28), 17 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 12:56:28,149 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 133 states, 87 states have (on average 1.160919540229885) internal successors, (101), 90 states have internal predecessors, (101), 28 states have call successors, (28), 19 states have call predecessors, (28), 17 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 12:56:28,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:56:28,151 INFO L93 Difference]: Finished difference Result 136 states and 156 transitions. [2022-04-28 12:56:28,151 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2022-04-28 12:56:28,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:56:28,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:56:28,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 87 states have (on average 1.160919540229885) internal successors, (101), 90 states have internal predecessors, (101), 28 states have call successors, (28), 19 states have call predecessors, (28), 17 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 136 states. [2022-04-28 12:56:28,151 INFO L87 Difference]: Start difference. First operand has 133 states, 87 states have (on average 1.160919540229885) internal successors, (101), 90 states have internal predecessors, (101), 28 states have call successors, (28), 19 states have call predecessors, (28), 17 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 136 states. [2022-04-28 12:56:28,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:56:28,153 INFO L93 Difference]: Finished difference Result 136 states and 156 transitions. [2022-04-28 12:56:28,153 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2022-04-28 12:56:28,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:56:28,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:56:28,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:56:28,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:56:28,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 87 states have (on average 1.160919540229885) internal successors, (101), 90 states have internal predecessors, (101), 28 states have call successors, (28), 19 states have call predecessors, (28), 17 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 12:56:28,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2022-04-28 12:56:28,156 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 68 [2022-04-28 12:56:28,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:56:28,156 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2022-04-28 12:56:28,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 6 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 12:56:28,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 154 transitions. [2022-04-28 12:56:28,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:56:28,313 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2022-04-28 12:56:28,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 12:56:28,313 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:56:28,313 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 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, 1] [2022-04-28 12:56:28,336 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-28 12:56:28,514 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-28 12:56:28,514 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:56:28,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:56:28,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1142595933, now seen corresponding path program 1 times [2022-04-28 12:56:28,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:56:28,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [13681224] [2022-04-28 12:56:35,004 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 12:56:35,004 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 12:56:35,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1142595933, now seen corresponding path program 2 times [2022-04-28 12:56:35,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:56:35,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123073327] [2022-04-28 12:56:35,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:56:35,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:56:35,019 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:56:35,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [655928507] [2022-04-28 12:56:35,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:56:35,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:56:35,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:56:35,020 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-28 12:56:35,052 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-28 12:56:35,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:56:35,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:56:35,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 12:56:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:56:35,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:56:38,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {7565#true} call ULTIMATE.init(); {7565#true} is VALID [2022-04-28 12:56:38,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {7565#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);~counter~0 := 0; {7565#true} is VALID [2022-04-28 12:56:38,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {7565#true} assume true; {7565#true} is VALID [2022-04-28 12:56:38,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7565#true} {7565#true} #96#return; {7565#true} is VALID [2022-04-28 12:56:38,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {7565#true} call #t~ret8 := main(); {7565#true} is VALID [2022-04-28 12:56:38,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {7565#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; {7565#true} is VALID [2022-04-28 12:56:38,255 INFO L272 TraceCheckUtils]: 6: Hoare triple {7565#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {7565#true} is VALID [2022-04-28 12:56:38,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {7565#true} ~cond := #in~cond; {7565#true} is VALID [2022-04-28 12:56:38,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {7565#true} assume !(0 == ~cond); {7565#true} is VALID [2022-04-28 12:56:38,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {7565#true} assume true; {7565#true} is VALID [2022-04-28 12:56:38,255 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7565#true} {7565#true} #80#return; {7565#true} is VALID [2022-04-28 12:56:38,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {7565#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {7603#(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-28 12:56:38,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {7603#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7603#(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-28 12:56:38,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {7603#(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 !!(#t~post6 < 5);havoc #t~post6; {7603#(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-28 12:56:38,256 INFO L272 TraceCheckUtils]: 14: Hoare triple {7603#(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)); {7565#true} is VALID [2022-04-28 12:56:38,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {7565#true} ~cond := #in~cond; {7565#true} is VALID [2022-04-28 12:56:38,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {7565#true} assume !(0 == ~cond); {7565#true} is VALID [2022-04-28 12:56:38,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {7565#true} assume true; {7565#true} is VALID [2022-04-28 12:56:38,257 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7565#true} {7603#(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; {7603#(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-28 12:56:38,257 INFO L272 TraceCheckUtils]: 19: Hoare triple {7603#(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)); {7565#true} is VALID [2022-04-28 12:56:38,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {7565#true} ~cond := #in~cond; {7565#true} is VALID [2022-04-28 12:56:38,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {7565#true} assume !(0 == ~cond); {7565#true} is VALID [2022-04-28 12:56:38,257 INFO L290 TraceCheckUtils]: 22: Hoare triple {7565#true} assume true; {7565#true} is VALID [2022-04-28 12:56:38,257 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7565#true} {7603#(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; {7603#(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-28 12:56:38,257 INFO L272 TraceCheckUtils]: 24: Hoare triple {7603#(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)); {7565#true} is VALID [2022-04-28 12:56:38,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {7565#true} ~cond := #in~cond; {7565#true} is VALID [2022-04-28 12:56:38,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {7565#true} assume !(0 == ~cond); {7565#true} is VALID [2022-04-28 12:56:38,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {7565#true} assume true; {7565#true} is VALID [2022-04-28 12:56:38,258 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7565#true} {7603#(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))} #86#return; {7603#(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-28 12:56:38,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {7603#(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; {7658#(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) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:56:38,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {7658#(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) (<= (mod main_~B~0 4294967296) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7658#(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) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:56:38,259 INFO L290 TraceCheckUtils]: 31: Hoare triple {7658#(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) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !!(#t~post6 < 5);havoc #t~post6; {7658#(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) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:56:38,259 INFO L272 TraceCheckUtils]: 32: Hoare triple {7658#(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) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7565#true} is VALID [2022-04-28 12:56:38,259 INFO L290 TraceCheckUtils]: 33: Hoare triple {7565#true} ~cond := #in~cond; {7565#true} is VALID [2022-04-28 12:56:38,259 INFO L290 TraceCheckUtils]: 34: Hoare triple {7565#true} assume !(0 == ~cond); {7565#true} is VALID [2022-04-28 12:56:38,259 INFO L290 TraceCheckUtils]: 35: Hoare triple {7565#true} assume true; {7565#true} is VALID [2022-04-28 12:56:38,260 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7565#true} {7658#(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) (<= (mod main_~B~0 4294967296) main_~r~0))} #82#return; {7658#(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) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:56:38,260 INFO L272 TraceCheckUtils]: 37: Hoare triple {7658#(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) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {7565#true} is VALID [2022-04-28 12:56:38,260 INFO L290 TraceCheckUtils]: 38: Hoare triple {7565#true} ~cond := #in~cond; {7565#true} is VALID [2022-04-28 12:56:38,260 INFO L290 TraceCheckUtils]: 39: Hoare triple {7565#true} assume !(0 == ~cond); {7565#true} is VALID [2022-04-28 12:56:38,260 INFO L290 TraceCheckUtils]: 40: Hoare triple {7565#true} assume true; {7565#true} is VALID [2022-04-28 12:56:38,260 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7565#true} {7658#(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) (<= (mod main_~B~0 4294967296) main_~r~0))} #84#return; {7658#(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) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:56:38,260 INFO L272 TraceCheckUtils]: 42: Hoare triple {7658#(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) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {7565#true} is VALID [2022-04-28 12:56:38,260 INFO L290 TraceCheckUtils]: 43: Hoare triple {7565#true} ~cond := #in~cond; {7565#true} is VALID [2022-04-28 12:56:38,261 INFO L290 TraceCheckUtils]: 44: Hoare triple {7565#true} assume !(0 == ~cond); {7565#true} is VALID [2022-04-28 12:56:38,261 INFO L290 TraceCheckUtils]: 45: Hoare triple {7565#true} assume true; {7565#true} is VALID [2022-04-28 12:56:38,261 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7565#true} {7658#(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) (<= (mod main_~B~0 4294967296) main_~r~0))} #86#return; {7658#(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) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:56:38,261 INFO L290 TraceCheckUtils]: 47: Hoare triple {7658#(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) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !(~r~0 >= ~d~0); {7713#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:56:38,262 INFO L290 TraceCheckUtils]: 48: Hoare triple {7713#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7713#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:56:38,262 INFO L290 TraceCheckUtils]: 49: Hoare triple {7713#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !!(#t~post7 < 5);havoc #t~post7; {7713#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:56:38,262 INFO L272 TraceCheckUtils]: 50: Hoare triple {7713#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= 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)); {7565#true} is VALID [2022-04-28 12:56:38,262 INFO L290 TraceCheckUtils]: 51: Hoare triple {7565#true} ~cond := #in~cond; {7565#true} is VALID [2022-04-28 12:56:38,262 INFO L290 TraceCheckUtils]: 52: Hoare triple {7565#true} assume !(0 == ~cond); {7565#true} is VALID [2022-04-28 12:56:38,262 INFO L290 TraceCheckUtils]: 53: Hoare triple {7565#true} assume true; {7565#true} is VALID [2022-04-28 12:56:38,262 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7565#true} {7713#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} #88#return; {7713#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:56:38,263 INFO L272 TraceCheckUtils]: 55: Hoare triple {7713#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= 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)); {7565#true} is VALID [2022-04-28 12:56:38,263 INFO L290 TraceCheckUtils]: 56: Hoare triple {7565#true} ~cond := #in~cond; {7565#true} is VALID [2022-04-28 12:56:38,263 INFO L290 TraceCheckUtils]: 57: Hoare triple {7565#true} assume !(0 == ~cond); {7565#true} is VALID [2022-04-28 12:56:38,263 INFO L290 TraceCheckUtils]: 58: Hoare triple {7565#true} assume true; {7565#true} is VALID [2022-04-28 12:56:38,263 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7565#true} {7713#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} #90#return; {7713#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:56:38,264 INFO L290 TraceCheckUtils]: 60: Hoare triple {7713#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= 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); {7753#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (not (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0)) (<= (mod main_~B~0 4294967296) main_~r~0) (= main_~p~0 1))} is VALID [2022-04-28 12:56:38,265 INFO L290 TraceCheckUtils]: 61: Hoare triple {7753#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (not (<= (* 2 (mod main_~B~0 4294967296)) main_~r~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; {7757#(and (not (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296))) (<= (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))} is VALID [2022-04-28 12:56:38,265 INFO L290 TraceCheckUtils]: 62: Hoare triple {7757#(and (not (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296))) (<= (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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7757#(and (not (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296))) (<= (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))} is VALID [2022-04-28 12:56:38,265 INFO L290 TraceCheckUtils]: 63: Hoare triple {7757#(and (not (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296))) (<= (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))} assume !!(#t~post7 < 5);havoc #t~post7; {7757#(and (not (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296))) (<= (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))} is VALID [2022-04-28 12:56:38,266 INFO L272 TraceCheckUtils]: 64: Hoare triple {7757#(and (not (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296))) (<= (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))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {7767#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:56:38,266 INFO L290 TraceCheckUtils]: 65: Hoare triple {7767#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7771#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:56:38,266 INFO L290 TraceCheckUtils]: 66: Hoare triple {7771#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7566#false} is VALID [2022-04-28 12:56:38,266 INFO L290 TraceCheckUtils]: 67: Hoare triple {7566#false} assume !false; {7566#false} is VALID [2022-04-28 12:56:38,267 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 12:56:38,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:56:45,870 INFO L290 TraceCheckUtils]: 67: Hoare triple {7566#false} assume !false; {7566#false} is VALID [2022-04-28 12:56:45,870 INFO L290 TraceCheckUtils]: 66: Hoare triple {7771#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7566#false} is VALID [2022-04-28 12:56:45,871 INFO L290 TraceCheckUtils]: 65: Hoare triple {7767#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7771#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:56:45,871 INFO L272 TraceCheckUtils]: 64: Hoare triple {7787#(= (+ 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)); {7767#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:56:45,872 INFO L290 TraceCheckUtils]: 63: Hoare triple {7787#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} assume !!(#t~post7 < 5);havoc #t~post7; {7787#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-28 12:56:45,872 INFO L290 TraceCheckUtils]: 62: Hoare triple {7787#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7787#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-28 12:56:45,874 INFO L290 TraceCheckUtils]: 61: Hoare triple {7797#(= (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; {7787#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-28 12:56:45,884 INFO L290 TraceCheckUtils]: 60: Hoare triple {7801#(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); {7797#(= (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-28 12:56:45,885 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7565#true} {7801#(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)))))} #90#return; {7801#(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-28 12:56:45,885 INFO L290 TraceCheckUtils]: 58: Hoare triple {7565#true} assume true; {7565#true} is VALID [2022-04-28 12:56:45,885 INFO L290 TraceCheckUtils]: 57: Hoare triple {7565#true} assume !(0 == ~cond); {7565#true} is VALID [2022-04-28 12:56:45,885 INFO L290 TraceCheckUtils]: 56: Hoare triple {7565#true} ~cond := #in~cond; {7565#true} is VALID [2022-04-28 12:56:45,885 INFO L272 TraceCheckUtils]: 55: Hoare triple {7801#(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)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {7565#true} is VALID [2022-04-28 12:56:45,886 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7565#true} {7801#(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)))))} #88#return; {7801#(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-28 12:56:45,886 INFO L290 TraceCheckUtils]: 53: Hoare triple {7565#true} assume true; {7565#true} is VALID [2022-04-28 12:56:45,886 INFO L290 TraceCheckUtils]: 52: Hoare triple {7565#true} assume !(0 == ~cond); {7565#true} is VALID [2022-04-28 12:56:45,886 INFO L290 TraceCheckUtils]: 51: Hoare triple {7565#true} ~cond := #in~cond; {7565#true} is VALID [2022-04-28 12:56:45,886 INFO L272 TraceCheckUtils]: 50: Hoare triple {7801#(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)))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {7565#true} is VALID [2022-04-28 12:56:45,887 INFO L290 TraceCheckUtils]: 49: Hoare triple {7801#(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 !!(#t~post7 < 5);havoc #t~post7; {7801#(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-28 12:56:45,888 INFO L290 TraceCheckUtils]: 48: Hoare triple {7801#(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)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7801#(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-28 12:56:45,889 INFO L290 TraceCheckUtils]: 47: Hoare triple {7841#(or (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))))) (<= main_~d~0 main_~r~0))} assume !(~r~0 >= ~d~0); {7801#(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-28 12:56:45,889 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7565#true} {7841#(or (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))))) (<= main_~d~0 main_~r~0))} #86#return; {7841#(or (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))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 12:56:45,889 INFO L290 TraceCheckUtils]: 45: Hoare triple {7565#true} assume true; {7565#true} is VALID [2022-04-28 12:56:45,889 INFO L290 TraceCheckUtils]: 44: Hoare triple {7565#true} assume !(0 == ~cond); {7565#true} is VALID [2022-04-28 12:56:45,889 INFO L290 TraceCheckUtils]: 43: Hoare triple {7565#true} ~cond := #in~cond; {7565#true} is VALID [2022-04-28 12:56:45,889 INFO L272 TraceCheckUtils]: 42: Hoare triple {7841#(or (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))))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {7565#true} is VALID [2022-04-28 12:56:45,890 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7565#true} {7841#(or (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))))) (<= main_~d~0 main_~r~0))} #84#return; {7841#(or (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))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 12:56:45,890 INFO L290 TraceCheckUtils]: 40: Hoare triple {7565#true} assume true; {7565#true} is VALID [2022-04-28 12:56:45,890 INFO L290 TraceCheckUtils]: 39: Hoare triple {7565#true} assume !(0 == ~cond); {7565#true} is VALID [2022-04-28 12:56:45,890 INFO L290 TraceCheckUtils]: 38: Hoare triple {7565#true} ~cond := #in~cond; {7565#true} is VALID [2022-04-28 12:56:45,890 INFO L272 TraceCheckUtils]: 37: Hoare triple {7841#(or (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))))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {7565#true} is VALID [2022-04-28 12:56:45,891 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7565#true} {7841#(or (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))))) (<= main_~d~0 main_~r~0))} #82#return; {7841#(or (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))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 12:56:45,891 INFO L290 TraceCheckUtils]: 35: Hoare triple {7565#true} assume true; {7565#true} is VALID [2022-04-28 12:56:45,891 INFO L290 TraceCheckUtils]: 34: Hoare triple {7565#true} assume !(0 == ~cond); {7565#true} is VALID [2022-04-28 12:56:45,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {7565#true} ~cond := #in~cond; {7565#true} is VALID [2022-04-28 12:56:45,891 INFO L272 TraceCheckUtils]: 32: Hoare triple {7841#(or (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))))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7565#true} is VALID [2022-04-28 12:56:45,892 INFO L290 TraceCheckUtils]: 31: Hoare triple {7841#(or (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))))) (<= main_~d~0 main_~r~0))} assume !!(#t~post6 < 5);havoc #t~post6; {7841#(or (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))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 12:56:45,893 INFO L290 TraceCheckUtils]: 30: Hoare triple {7841#(or (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))))) (<= main_~d~0 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7841#(or (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))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 12:56:45,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {7896#(or (not (<= main_~d~0 main_~r~0)) (= (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; {7841#(or (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))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 12:56:45,896 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7565#true} {7896#(or (not (<= main_~d~0 main_~r~0)) (= (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))} #86#return; {7896#(or (not (<= main_~d~0 main_~r~0)) (= (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-28 12:56:45,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {7565#true} assume true; {7565#true} is VALID [2022-04-28 12:56:45,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {7565#true} assume !(0 == ~cond); {7565#true} is VALID [2022-04-28 12:56:45,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {7565#true} ~cond := #in~cond; {7565#true} is VALID [2022-04-28 12:56:45,896 INFO L272 TraceCheckUtils]: 24: Hoare triple {7896#(or (not (<= main_~d~0 main_~r~0)) (= (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)); {7565#true} is VALID [2022-04-28 12:56:45,897 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7565#true} {7896#(or (not (<= main_~d~0 main_~r~0)) (= (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; {7896#(or (not (<= main_~d~0 main_~r~0)) (= (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-28 12:56:45,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {7565#true} assume true; {7565#true} is VALID [2022-04-28 12:56:45,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {7565#true} assume !(0 == ~cond); {7565#true} is VALID [2022-04-28 12:56:45,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {7565#true} ~cond := #in~cond; {7565#true} is VALID [2022-04-28 12:56:45,897 INFO L272 TraceCheckUtils]: 19: Hoare triple {7896#(or (not (<= main_~d~0 main_~r~0)) (= (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)); {7565#true} is VALID [2022-04-28 12:56:45,898 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7565#true} {7896#(or (not (<= main_~d~0 main_~r~0)) (= (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; {7896#(or (not (<= main_~d~0 main_~r~0)) (= (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-28 12:56:45,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {7565#true} assume true; {7565#true} is VALID [2022-04-28 12:56:45,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {7565#true} assume !(0 == ~cond); {7565#true} is VALID [2022-04-28 12:56:45,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {7565#true} ~cond := #in~cond; {7565#true} is VALID [2022-04-28 12:56:45,898 INFO L272 TraceCheckUtils]: 14: Hoare triple {7896#(or (not (<= main_~d~0 main_~r~0)) (= (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)); {7565#true} is VALID [2022-04-28 12:56:45,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {7896#(or (not (<= main_~d~0 main_~r~0)) (= (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 !!(#t~post6 < 5);havoc #t~post6; {7896#(or (not (<= main_~d~0 main_~r~0)) (= (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-28 12:56:45,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {7896#(or (not (<= main_~d~0 main_~r~0)) (= (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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7896#(or (not (<= main_~d~0 main_~r~0)) (= (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-28 12:56:45,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {7565#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {7896#(or (not (<= main_~d~0 main_~r~0)) (= (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-28 12:56:45,900 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7565#true} {7565#true} #80#return; {7565#true} is VALID [2022-04-28 12:56:45,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {7565#true} assume true; {7565#true} is VALID [2022-04-28 12:56:45,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {7565#true} assume !(0 == ~cond); {7565#true} is VALID [2022-04-28 12:56:45,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {7565#true} ~cond := #in~cond; {7565#true} is VALID [2022-04-28 12:56:45,900 INFO L272 TraceCheckUtils]: 6: Hoare triple {7565#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {7565#true} is VALID [2022-04-28 12:56:45,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {7565#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; {7565#true} is VALID [2022-04-28 12:56:45,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {7565#true} call #t~ret8 := main(); {7565#true} is VALID [2022-04-28 12:56:45,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7565#true} {7565#true} #96#return; {7565#true} is VALID [2022-04-28 12:56:45,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {7565#true} assume true; {7565#true} is VALID [2022-04-28 12:56:45,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {7565#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);~counter~0 := 0; {7565#true} is VALID [2022-04-28 12:56:45,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {7565#true} call ULTIMATE.init(); {7565#true} is VALID [2022-04-28 12:56:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 12:56:45,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:56:45,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123073327] [2022-04-28 12:56:45,901 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:56:45,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655928507] [2022-04-28 12:56:45,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655928507] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:56:45,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:56:45,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 12:56:45,901 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:56:45,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [13681224] [2022-04-28 12:56:45,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [13681224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:56:45,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:56:45,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 12:56:45,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584736662] [2022-04-28 12:56:45,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:56:45,902 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 68 [2022-04-28 12:56:45,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:56:45,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 12:56:45,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:56:45,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 12:56:45,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:56:45,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 12:56:45,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:56:45,946 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 12:56:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:56:46,959 INFO L93 Difference]: Finished difference Result 178 states and 213 transitions. [2022-04-28 12:56:46,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 12:56:46,960 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 68 [2022-04-28 12:56:46,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:56:46,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 12:56:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-28 12:56:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 12:56:46,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-28 12:56:46,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2022-04-28 12:56:47,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:56:47,073 INFO L225 Difference]: With dead ends: 178 [2022-04-28 12:56:47,073 INFO L226 Difference]: Without dead ends: 143 [2022-04-28 12:56:47,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-28 12:56:47,077 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 12 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 12:56:47,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 207 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 12:56:47,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-28 12:56:47,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2022-04-28 12:56:47,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:56:47,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 141 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 96 states have internal predecessors, (108), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 12:56:47,210 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 141 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 96 states have internal predecessors, (108), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 12:56:47,211 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 141 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 96 states have internal predecessors, (108), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 12:56:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:56:47,214 INFO L93 Difference]: Finished difference Result 143 states and 165 transitions. [2022-04-28 12:56:47,214 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 165 transitions. [2022-04-28 12:56:47,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:56:47,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:56:47,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 96 states have internal predecessors, (108), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 143 states. [2022-04-28 12:56:47,215 INFO L87 Difference]: Start difference. First operand has 141 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 96 states have internal predecessors, (108), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 143 states. [2022-04-28 12:56:47,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:56:47,218 INFO L93 Difference]: Finished difference Result 143 states and 165 transitions. [2022-04-28 12:56:47,218 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 165 transitions. [2022-04-28 12:56:47,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:56:47,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:56:47,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:56:47,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:56:47,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 96 states have internal predecessors, (108), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 12:56:47,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 162 transitions. [2022-04-28 12:56:47,221 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 162 transitions. Word has length 68 [2022-04-28 12:56:47,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:56:47,221 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 162 transitions. [2022-04-28 12:56:47,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 12:56:47,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 141 states and 162 transitions. [2022-04-28 12:56:47,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:56:47,395 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 162 transitions. [2022-04-28 12:56:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 12:56:47,395 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:56:47,395 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 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] [2022-04-28 12:56:47,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 12:56:47,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 12:56:47,596 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:56:47,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:56:47,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1390565976, now seen corresponding path program 3 times [2022-04-28 12:56:47,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:56:47,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [355329677] [2022-04-28 12:56:53,754 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 12:56:53,754 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 12:56:53,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1390565976, now seen corresponding path program 4 times [2022-04-28 12:56:53,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:56:53,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059761376] [2022-04-28 12:56:53,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:56:53,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:56:53,774 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:56:53,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [406927692] [2022-04-28 12:56:53,775 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:56:53,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:56:53,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:56:53,778 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:56:53,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 12:56:53,825 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:56:53,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:56:53,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 12:56:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:56:53,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:56:54,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {8912#true} call ULTIMATE.init(); {8912#true} is VALID [2022-04-28 12:56:54,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {8912#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);~counter~0 := 0; {8912#true} is VALID [2022-04-28 12:56:54,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 12:56:54,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8912#true} {8912#true} #96#return; {8912#true} is VALID [2022-04-28 12:56:54,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {8912#true} call #t~ret8 := main(); {8912#true} is VALID [2022-04-28 12:56:54,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {8912#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; {8912#true} is VALID [2022-04-28 12:56:54,553 INFO L272 TraceCheckUtils]: 6: Hoare triple {8912#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {8912#true} is VALID [2022-04-28 12:56:54,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 12:56:54,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 12:56:54,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 12:56:54,553 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8912#true} {8912#true} #80#return; {8912#true} is VALID [2022-04-28 12:56:54,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {8912#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {8950#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 12:56:54,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {8950#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8950#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 12:56:54,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {8950#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {8950#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 12:56:54,554 INFO L272 TraceCheckUtils]: 14: Hoare triple {8950#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8912#true} is VALID [2022-04-28 12:56:54,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 12:56:54,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 12:56:54,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 12:56:54,555 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8912#true} {8950#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #82#return; {8950#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 12:56:54,555 INFO L272 TraceCheckUtils]: 19: Hoare triple {8950#(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)); {8912#true} is VALID [2022-04-28 12:56:54,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 12:56:54,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 12:56:54,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 12:56:54,555 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8912#true} {8950#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #84#return; {8950#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 12:56:54,556 INFO L272 TraceCheckUtils]: 24: Hoare triple {8950#(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)); {8912#true} is VALID [2022-04-28 12:56:54,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 12:56:54,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 12:56:54,556 INFO L290 TraceCheckUtils]: 27: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 12:56:54,556 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8912#true} {8950#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #86#return; {8950#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 12:56:54,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {8950#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9005#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:56:54,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {9005#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9005#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:56:54,558 INFO L290 TraceCheckUtils]: 31: Hoare triple {9005#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !!(#t~post6 < 5);havoc #t~post6; {9005#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:56:54,558 INFO L272 TraceCheckUtils]: 32: Hoare triple {9005#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8912#true} is VALID [2022-04-28 12:56:54,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 12:56:54,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 12:56:54,558 INFO L290 TraceCheckUtils]: 35: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 12:56:54,558 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8912#true} {9005#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} #82#return; {9005#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:56:54,558 INFO L272 TraceCheckUtils]: 37: Hoare triple {9005#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {8912#true} is VALID [2022-04-28 12:56:54,558 INFO L290 TraceCheckUtils]: 38: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 12:56:54,558 INFO L290 TraceCheckUtils]: 39: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 12:56:54,558 INFO L290 TraceCheckUtils]: 40: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 12:56:54,559 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8912#true} {9005#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} #84#return; {9005#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:56:54,559 INFO L272 TraceCheckUtils]: 42: Hoare triple {9005#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8912#true} is VALID [2022-04-28 12:56:54,559 INFO L290 TraceCheckUtils]: 43: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 12:56:54,559 INFO L290 TraceCheckUtils]: 44: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 12:56:54,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 12:56:54,560 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8912#true} {9005#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} #86#return; {9005#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:56:54,560 INFO L290 TraceCheckUtils]: 47: Hoare triple {9005#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !(~r~0 >= ~d~0); {9060#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-28 12:56:54,561 INFO L290 TraceCheckUtils]: 48: Hoare triple {9060#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (< (mod main_~B~0 4294967296) main_~d~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9060#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-28 12:56:54,561 INFO L290 TraceCheckUtils]: 49: Hoare triple {9060#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (< (mod main_~B~0 4294967296) main_~d~0))} assume !!(#t~post7 < 5);havoc #t~post7; {9060#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-28 12:56:54,561 INFO L272 TraceCheckUtils]: 50: Hoare triple {9060#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (< (mod main_~B~0 4294967296) main_~d~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {8912#true} is VALID [2022-04-28 12:56:54,561 INFO L290 TraceCheckUtils]: 51: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 12:56:54,561 INFO L290 TraceCheckUtils]: 52: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 12:56:54,561 INFO L290 TraceCheckUtils]: 53: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 12:56:54,562 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8912#true} {9060#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (< (mod main_~B~0 4294967296) main_~d~0))} #88#return; {9060#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-28 12:56:54,562 INFO L272 TraceCheckUtils]: 55: Hoare triple {9060#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (< (mod main_~B~0 4294967296) main_~d~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8912#true} is VALID [2022-04-28 12:56:54,562 INFO L290 TraceCheckUtils]: 56: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 12:56:54,562 INFO L290 TraceCheckUtils]: 57: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 12:56:54,562 INFO L290 TraceCheckUtils]: 58: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 12:56:54,562 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8912#true} {9060#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (< (mod main_~B~0 4294967296) main_~d~0))} #90#return; {9060#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-28 12:56:54,563 INFO L290 TraceCheckUtils]: 60: Hoare triple {9060#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (< (mod main_~B~0 4294967296) main_~d~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); {9100#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 12:56:54,564 INFO L290 TraceCheckUtils]: 61: Hoare triple {9100#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (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; {9100#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 12:56:54,564 INFO L290 TraceCheckUtils]: 62: Hoare triple {9100#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9100#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 12:56:54,564 INFO L290 TraceCheckUtils]: 63: Hoare triple {9100#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {9100#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 12:56:54,565 INFO L272 TraceCheckUtils]: 64: Hoare triple {9100#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (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)); {8912#true} is VALID [2022-04-28 12:56:54,565 INFO L290 TraceCheckUtils]: 65: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 12:56:54,565 INFO L290 TraceCheckUtils]: 66: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 12:56:54,565 INFO L290 TraceCheckUtils]: 67: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 12:56:54,565 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8912#true} {9100#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #88#return; {9100#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 12:56:54,566 INFO L272 TraceCheckUtils]: 69: Hoare triple {9100#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 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)); {9128#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:56:54,566 INFO L290 TraceCheckUtils]: 70: Hoare triple {9128#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9132#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:56:54,566 INFO L290 TraceCheckUtils]: 71: Hoare triple {9132#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8913#false} is VALID [2022-04-28 12:56:54,566 INFO L290 TraceCheckUtils]: 72: Hoare triple {8913#false} assume !false; {8913#false} is VALID [2022-04-28 12:56:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 12:56:54,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:57:05,572 INFO L290 TraceCheckUtils]: 72: Hoare triple {8913#false} assume !false; {8913#false} is VALID [2022-04-28 12:57:05,573 INFO L290 TraceCheckUtils]: 71: Hoare triple {9132#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8913#false} is VALID [2022-04-28 12:57:05,573 INFO L290 TraceCheckUtils]: 70: Hoare triple {9128#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9132#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:57:05,574 INFO L272 TraceCheckUtils]: 69: Hoare triple {9148#(= 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)); {9128#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:57:05,574 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8912#true} {9148#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #88#return; {9148#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 12:57:05,574 INFO L290 TraceCheckUtils]: 67: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 12:57:05,574 INFO L290 TraceCheckUtils]: 66: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 12:57:05,574 INFO L290 TraceCheckUtils]: 65: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 12:57:05,574 INFO L272 TraceCheckUtils]: 64: Hoare triple {9148#(= 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)); {8912#true} is VALID [2022-04-28 12:57:05,575 INFO L290 TraceCheckUtils]: 63: Hoare triple {9148#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(#t~post7 < 5);havoc #t~post7; {9148#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 12:57:05,575 INFO L290 TraceCheckUtils]: 62: Hoare triple {9148#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9148#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 12:57:05,575 INFO L290 TraceCheckUtils]: 61: Hoare triple {9148#(= 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; {9148#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 12:57:05,589 INFO L290 TraceCheckUtils]: 60: Hoare triple {9176#(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); {9148#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 12:57:05,590 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8912#true} {9176#(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)))))} #90#return; {9176#(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-28 12:57:05,590 INFO L290 TraceCheckUtils]: 58: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 12:57:05,590 INFO L290 TraceCheckUtils]: 57: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 12:57:05,590 INFO L290 TraceCheckUtils]: 56: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 12:57:05,590 INFO L272 TraceCheckUtils]: 55: Hoare triple {9176#(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)); {8912#true} is VALID [2022-04-28 12:57:05,590 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8912#true} {9176#(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; {9176#(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-28 12:57:05,590 INFO L290 TraceCheckUtils]: 53: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 12:57:05,590 INFO L290 TraceCheckUtils]: 52: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 12:57:05,590 INFO L290 TraceCheckUtils]: 51: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 12:57:05,591 INFO L272 TraceCheckUtils]: 50: Hoare triple {9176#(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)); {8912#true} is VALID [2022-04-28 12:57:05,591 INFO L290 TraceCheckUtils]: 49: Hoare triple {9176#(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 !!(#t~post7 < 5);havoc #t~post7; {9176#(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-28 12:57:05,592 INFO L290 TraceCheckUtils]: 48: Hoare triple {9176#(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)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9176#(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-28 12:57:05,593 INFO L290 TraceCheckUtils]: 47: Hoare triple {9216#(or (<= main_~d~0 main_~r~0) (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); {9176#(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-28 12:57:05,594 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8912#true} {9216#(or (<= main_~d~0 main_~r~0) (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; {9216#(or (<= main_~d~0 main_~r~0) (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-28 12:57:05,594 INFO L290 TraceCheckUtils]: 45: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 12:57:05,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 12:57:05,594 INFO L290 TraceCheckUtils]: 43: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 12:57:05,594 INFO L272 TraceCheckUtils]: 42: Hoare triple {9216#(or (<= main_~d~0 main_~r~0) (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)); {8912#true} is VALID [2022-04-28 12:57:05,594 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8912#true} {9216#(or (<= main_~d~0 main_~r~0) (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))))))} #84#return; {9216#(or (<= main_~d~0 main_~r~0) (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-28 12:57:05,594 INFO L290 TraceCheckUtils]: 40: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 12:57:05,594 INFO L290 TraceCheckUtils]: 39: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 12:57:05,595 INFO L290 TraceCheckUtils]: 38: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 12:57:05,595 INFO L272 TraceCheckUtils]: 37: Hoare triple {9216#(or (<= main_~d~0 main_~r~0) (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 ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {8912#true} is VALID [2022-04-28 12:57:05,595 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8912#true} {9216#(or (<= main_~d~0 main_~r~0) (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))))))} #82#return; {9216#(or (<= main_~d~0 main_~r~0) (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-28 12:57:05,595 INFO L290 TraceCheckUtils]: 35: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 12:57:05,595 INFO L290 TraceCheckUtils]: 34: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 12:57:05,595 INFO L290 TraceCheckUtils]: 33: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 12:57:05,595 INFO L272 TraceCheckUtils]: 32: Hoare triple {9216#(or (<= main_~d~0 main_~r~0) (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 0 == ~q~0 then 1 else 0)); {8912#true} is VALID [2022-04-28 12:57:05,596 INFO L290 TraceCheckUtils]: 31: Hoare triple {9216#(or (<= main_~d~0 main_~r~0) (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 !!(#t~post6 < 5);havoc #t~post6; {9216#(or (<= main_~d~0 main_~r~0) (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-28 12:57:05,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {9216#(or (<= main_~d~0 main_~r~0) (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))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9216#(or (<= main_~d~0 main_~r~0) (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-28 12:57:05,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {9271#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9216#(or (<= main_~d~0 main_~r~0) (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-28 12:57:05,600 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8912#true} {9271#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #86#return; {9271#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-28 12:57:05,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 12:57:05,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 12:57:05,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 12:57:05,600 INFO L272 TraceCheckUtils]: 24: Hoare triple {9271#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8912#true} is VALID [2022-04-28 12:57:05,601 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8912#true} {9271#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #84#return; {9271#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-28 12:57:05,601 INFO L290 TraceCheckUtils]: 22: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 12:57:05,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 12:57:05,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 12:57:05,601 INFO L272 TraceCheckUtils]: 19: Hoare triple {9271#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {8912#true} is VALID [2022-04-28 12:57:05,602 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8912#true} {9271#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #82#return; {9271#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-28 12:57:05,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 12:57:05,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 12:57:05,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 12:57:05,602 INFO L272 TraceCheckUtils]: 14: Hoare triple {9271#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8912#true} is VALID [2022-04-28 12:57:05,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {9271#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} assume !!(#t~post6 < 5);havoc #t~post6; {9271#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-28 12:57:05,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {9271#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9271#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-28 12:57:05,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {8912#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {9271#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-28 12:57:05,603 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8912#true} {8912#true} #80#return; {8912#true} is VALID [2022-04-28 12:57:05,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 12:57:05,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {8912#true} assume !(0 == ~cond); {8912#true} is VALID [2022-04-28 12:57:05,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {8912#true} ~cond := #in~cond; {8912#true} is VALID [2022-04-28 12:57:05,603 INFO L272 TraceCheckUtils]: 6: Hoare triple {8912#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {8912#true} is VALID [2022-04-28 12:57:05,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {8912#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; {8912#true} is VALID [2022-04-28 12:57:05,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {8912#true} call #t~ret8 := main(); {8912#true} is VALID [2022-04-28 12:57:05,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8912#true} {8912#true} #96#return; {8912#true} is VALID [2022-04-28 12:57:05,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {8912#true} assume true; {8912#true} is VALID [2022-04-28 12:57:05,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {8912#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);~counter~0 := 0; {8912#true} is VALID [2022-04-28 12:57:05,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {8912#true} call ULTIMATE.init(); {8912#true} is VALID [2022-04-28 12:57:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 12:57:05,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:57:05,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059761376] [2022-04-28 12:57:05,604 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:57:05,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406927692] [2022-04-28 12:57:05,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406927692] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:57:05,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:57:05,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-28 12:57:05,605 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:57:05,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [355329677] [2022-04-28 12:57:05,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [355329677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:57:05,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:57:05,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:57:05,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104960616] [2022-04-28 12:57:05,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:57:05,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 73 [2022-04-28 12:57:05,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:57:05,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 12:57:05,649 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-28 12:57:05,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:57:05,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:57:05,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:57:05,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 12:57:05,650 INFO L87 Difference]: Start difference. First operand 141 states and 162 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 12:57:06,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:57:06,582 INFO L93 Difference]: Finished difference Result 168 states and 197 transitions. [2022-04-28 12:57:06,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 12:57:06,583 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 73 [2022-04-28 12:57:06,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:57:06,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 12:57:06,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-04-28 12:57:06,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 12:57:06,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-04-28 12:57:06,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 103 transitions. [2022-04-28 12:57:06,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:57:06,690 INFO L225 Difference]: With dead ends: 168 [2022-04-28 12:57:06,690 INFO L226 Difference]: Without dead ends: 143 [2022-04-28 12:57:06,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:57:06,690 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 12 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 12:57:06,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 260 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 12:57:06,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-28 12:57:06,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-04-28 12:57:06,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:57:06,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 143 states, 93 states have (on average 1.1290322580645162) internal successors, (105), 97 states have internal predecessors, (105), 29 states have call successors, (29), 21 states have call predecessors, (29), 20 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 12:57:06,800 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 143 states, 93 states have (on average 1.1290322580645162) internal successors, (105), 97 states have internal predecessors, (105), 29 states have call successors, (29), 21 states have call predecessors, (29), 20 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 12:57:06,801 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 143 states, 93 states have (on average 1.1290322580645162) internal successors, (105), 97 states have internal predecessors, (105), 29 states have call successors, (29), 21 states have call predecessors, (29), 20 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 12:57:06,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:57:06,802 INFO L93 Difference]: Finished difference Result 143 states and 160 transitions. [2022-04-28 12:57:06,803 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 160 transitions. [2022-04-28 12:57:06,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:57:06,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:57:06,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 93 states have (on average 1.1290322580645162) internal successors, (105), 97 states have internal predecessors, (105), 29 states have call successors, (29), 21 states have call predecessors, (29), 20 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 143 states. [2022-04-28 12:57:06,803 INFO L87 Difference]: Start difference. First operand has 143 states, 93 states have (on average 1.1290322580645162) internal successors, (105), 97 states have internal predecessors, (105), 29 states have call successors, (29), 21 states have call predecessors, (29), 20 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 143 states. [2022-04-28 12:57:06,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:57:06,805 INFO L93 Difference]: Finished difference Result 143 states and 160 transitions. [2022-04-28 12:57:06,805 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 160 transitions. [2022-04-28 12:57:06,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:57:06,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:57:06,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:57:06,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:57:06,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 93 states have (on average 1.1290322580645162) internal successors, (105), 97 states have internal predecessors, (105), 29 states have call successors, (29), 21 states have call predecessors, (29), 20 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 12:57:06,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 160 transitions. [2022-04-28 12:57:06,810 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 160 transitions. Word has length 73 [2022-04-28 12:57:06,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:57:06,811 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 160 transitions. [2022-04-28 12:57:06,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 12:57:06,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 160 transitions. [2022-04-28 12:57:06,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:57:06,987 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 160 transitions. [2022-04-28 12:57:06,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 12:57:06,988 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:57:06,988 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 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-28 12:57:07,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 12:57:07,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 12:57:07,204 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:57:07,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:57:07,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1792978632, now seen corresponding path program 1 times [2022-04-28 12:57:07,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:57:07,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [949573337] [2022-04-28 12:57:15,072 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 12:57:15,072 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 12:57:15,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1792978632, now seen corresponding path program 2 times [2022-04-28 12:57:15,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:57:15,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399923890] [2022-04-28 12:57:15,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:57:15,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:57:15,080 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:57:15,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1156383813] [2022-04-28 12:57:15,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:57:15,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:57:15,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:57:15,082 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:57:15,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 12:57:15,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:57:15,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:57:15,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 12:57:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:57:15,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:57:52,549 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:57:57,193 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:58:08,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {10273#true} call ULTIMATE.init(); {10273#true} is VALID [2022-04-28 12:58:08,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {10273#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);~counter~0 := 0; {10273#true} is VALID [2022-04-28 12:58:08,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {10273#true} assume true; {10273#true} is VALID [2022-04-28 12:58:08,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10273#true} {10273#true} #96#return; {10273#true} is VALID [2022-04-28 12:58:08,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {10273#true} call #t~ret8 := main(); {10273#true} is VALID [2022-04-28 12:58:08,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {10273#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; {10273#true} is VALID [2022-04-28 12:58:08,626 INFO L272 TraceCheckUtils]: 6: Hoare triple {10273#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {10273#true} is VALID [2022-04-28 12:58:08,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {10273#true} ~cond := #in~cond; {10273#true} is VALID [2022-04-28 12:58:08,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {10273#true} assume !(0 == ~cond); {10273#true} is VALID [2022-04-28 12:58:08,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {10273#true} assume true; {10273#true} is VALID [2022-04-28 12:58:08,626 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10273#true} {10273#true} #80#return; {10273#true} is VALID [2022-04-28 12:58:08,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {10273#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:58:08,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:58:08,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} assume !!(#t~post6 < 5);havoc #t~post6; {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:58:08,628 INFO L272 TraceCheckUtils]: 14: Hoare triple {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10273#true} is VALID [2022-04-28 12:58:08,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {10273#true} ~cond := #in~cond; {10273#true} is VALID [2022-04-28 12:58:08,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {10273#true} assume !(0 == ~cond); {10273#true} is VALID [2022-04-28 12:58:08,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {10273#true} assume true; {10273#true} is VALID [2022-04-28 12:58:08,628 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10273#true} {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} #82#return; {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:58:08,628 INFO L272 TraceCheckUtils]: 19: Hoare triple {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {10273#true} is VALID [2022-04-28 12:58:08,628 INFO L290 TraceCheckUtils]: 20: Hoare triple {10273#true} ~cond := #in~cond; {10273#true} is VALID [2022-04-28 12:58:08,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {10273#true} assume !(0 == ~cond); {10273#true} is VALID [2022-04-28 12:58:08,628 INFO L290 TraceCheckUtils]: 22: Hoare triple {10273#true} assume true; {10273#true} is VALID [2022-04-28 12:58:08,629 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10273#true} {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} #84#return; {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:58:08,629 INFO L272 TraceCheckUtils]: 24: Hoare triple {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10273#true} is VALID [2022-04-28 12:58:08,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {10273#true} ~cond := #in~cond; {10273#true} is VALID [2022-04-28 12:58:08,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {10273#true} assume !(0 == ~cond); {10273#true} is VALID [2022-04-28 12:58:08,629 INFO L290 TraceCheckUtils]: 27: Hoare triple {10273#true} assume true; {10273#true} is VALID [2022-04-28 12:58:08,630 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10273#true} {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} #86#return; {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:58:08,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:58:08,630 INFO L290 TraceCheckUtils]: 30: Hoare triple {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:58:08,631 INFO L290 TraceCheckUtils]: 31: Hoare triple {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} assume !!(#t~post6 < 5);havoc #t~post6; {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:58:08,631 INFO L272 TraceCheckUtils]: 32: Hoare triple {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10273#true} is VALID [2022-04-28 12:58:08,631 INFO L290 TraceCheckUtils]: 33: Hoare triple {10273#true} ~cond := #in~cond; {10273#true} is VALID [2022-04-28 12:58:08,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {10273#true} assume !(0 == ~cond); {10273#true} is VALID [2022-04-28 12:58:08,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {10273#true} assume true; {10273#true} is VALID [2022-04-28 12:58:08,631 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10273#true} {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} #82#return; {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:58:08,631 INFO L272 TraceCheckUtils]: 37: Hoare triple {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {10273#true} is VALID [2022-04-28 12:58:08,631 INFO L290 TraceCheckUtils]: 38: Hoare triple {10273#true} ~cond := #in~cond; {10273#true} is VALID [2022-04-28 12:58:08,631 INFO L290 TraceCheckUtils]: 39: Hoare triple {10273#true} assume !(0 == ~cond); {10273#true} is VALID [2022-04-28 12:58:08,632 INFO L290 TraceCheckUtils]: 40: Hoare triple {10273#true} assume true; {10273#true} is VALID [2022-04-28 12:58:08,632 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10273#true} {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} #84#return; {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:58:08,632 INFO L272 TraceCheckUtils]: 42: Hoare triple {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10273#true} is VALID [2022-04-28 12:58:08,632 INFO L290 TraceCheckUtils]: 43: Hoare triple {10273#true} ~cond := #in~cond; {10273#true} is VALID [2022-04-28 12:58:08,632 INFO L290 TraceCheckUtils]: 44: Hoare triple {10273#true} assume !(0 == ~cond); {10273#true} is VALID [2022-04-28 12:58:08,632 INFO L290 TraceCheckUtils]: 45: Hoare triple {10273#true} assume true; {10273#true} is VALID [2022-04-28 12:58:08,633 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10273#true} {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} #86#return; {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:58:08,633 INFO L290 TraceCheckUtils]: 47: Hoare triple {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} assume !(~r~0 >= ~d~0); {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:58:08,633 INFO L290 TraceCheckUtils]: 48: Hoare triple {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:58:08,634 INFO L290 TraceCheckUtils]: 49: Hoare triple {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} assume !!(#t~post7 < 5);havoc #t~post7; {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:58:08,634 INFO L272 TraceCheckUtils]: 50: Hoare triple {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {10273#true} is VALID [2022-04-28 12:58:08,634 INFO L290 TraceCheckUtils]: 51: Hoare triple {10273#true} ~cond := #in~cond; {10273#true} is VALID [2022-04-28 12:58:08,634 INFO L290 TraceCheckUtils]: 52: Hoare triple {10273#true} assume !(0 == ~cond); {10273#true} is VALID [2022-04-28 12:58:08,634 INFO L290 TraceCheckUtils]: 53: Hoare triple {10273#true} assume true; {10273#true} is VALID [2022-04-28 12:58:08,634 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10273#true} {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} #88#return; {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:58:08,635 INFO L272 TraceCheckUtils]: 55: Hoare triple {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10273#true} is VALID [2022-04-28 12:58:08,635 INFO L290 TraceCheckUtils]: 56: Hoare triple {10273#true} ~cond := #in~cond; {10273#true} is VALID [2022-04-28 12:58:08,635 INFO L290 TraceCheckUtils]: 57: Hoare triple {10273#true} assume !(0 == ~cond); {10273#true} is VALID [2022-04-28 12:58:08,635 INFO L290 TraceCheckUtils]: 58: Hoare triple {10273#true} assume true; {10273#true} is VALID [2022-04-28 12:58:08,635 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10273#true} {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} #90#return; {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:58:08,636 INFO L290 TraceCheckUtils]: 60: Hoare triple {10311#(and (= main_~q~0 0) (<= (mod main_~A~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); {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-28 12:58:08,637 INFO L290 TraceCheckUtils]: 61: Hoare triple {10311#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10462#(and (= main_~q~0 main_~p~0) (<= (mod main_~A~0 4294967296) (+ main_~d~0 main_~r~0)))} is VALID [2022-04-28 12:58:08,637 INFO L290 TraceCheckUtils]: 62: Hoare triple {10462#(and (= main_~q~0 main_~p~0) (<= (mod main_~A~0 4294967296) (+ main_~d~0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10462#(and (= main_~q~0 main_~p~0) (<= (mod main_~A~0 4294967296) (+ main_~d~0 main_~r~0)))} is VALID [2022-04-28 12:58:08,638 INFO L290 TraceCheckUtils]: 63: Hoare triple {10462#(and (= main_~q~0 main_~p~0) (<= (mod main_~A~0 4294967296) (+ main_~d~0 main_~r~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {10462#(and (= main_~q~0 main_~p~0) (<= (mod main_~A~0 4294967296) (+ main_~d~0 main_~r~0)))} is VALID [2022-04-28 12:58:08,638 INFO L272 TraceCheckUtils]: 64: Hoare triple {10462#(and (= main_~q~0 main_~p~0) (<= (mod main_~A~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)); {10273#true} is VALID [2022-04-28 12:58:08,638 INFO L290 TraceCheckUtils]: 65: Hoare triple {10273#true} ~cond := #in~cond; {10475#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:58:08,638 INFO L290 TraceCheckUtils]: 66: Hoare triple {10475#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10479#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:58:08,639 INFO L290 TraceCheckUtils]: 67: Hoare triple {10479#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10479#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:58:08,639 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10479#(not (= |__VERIFIER_assert_#in~cond| 0))} {10462#(and (= main_~q~0 main_~p~0) (<= (mod main_~A~0 4294967296) (+ main_~d~0 main_~r~0)))} #88#return; {10486#(and (= main_~q~0 main_~p~0) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (mod main_~A~0 4294967296) (+ main_~d~0 main_~r~0)))} is VALID [2022-04-28 12:58:08,639 INFO L272 TraceCheckUtils]: 69: Hoare triple {10486#(and (= main_~q~0 main_~p~0) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~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)); {10273#true} is VALID [2022-04-28 12:58:08,640 INFO L290 TraceCheckUtils]: 70: Hoare triple {10273#true} ~cond := #in~cond; {10475#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:58:08,640 INFO L290 TraceCheckUtils]: 71: Hoare triple {10475#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10479#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:58:08,640 INFO L290 TraceCheckUtils]: 72: Hoare triple {10479#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10479#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:58:10,644 WARN L284 TraceCheckUtils]: 73: Hoare quadruple {10479#(not (= |__VERIFIER_assert_#in~cond| 0))} {10486#(and (= main_~q~0 main_~p~0) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (mod main_~A~0 4294967296) (+ main_~d~0 main_~r~0)))} #90#return; {10502#(and (or (and (= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 0) (= main_~q~0 0) (exists ((aux_div_aux_mod_main_~B~0_26_37 Int) (aux_mod_aux_mod_main_~B~0_26_37 Int)) (and (< (+ (* 4294967296 aux_div_aux_mod_main_~B~0_26_37) aux_mod_aux_mod_main_~B~0_26_37) 4294967296) (<= 0 aux_mod_aux_mod_main_~B~0_26_37) (<= 0 (+ (* 4294967296 aux_div_aux_mod_main_~B~0_26_37) aux_mod_aux_mod_main_~B~0_26_37)) (< aux_mod_aux_mod_main_~B~0_26_37 4294967296) (= (* main_~p~0 (+ (* 4294967296 aux_div_aux_mod_main_~B~0_26_37) aux_mod_aux_mod_main_~B~0_26_37)) main_~d~0)))) (and (<= 0 (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0)) (= (mod (div (+ main_~d~0 (* (- 1) (* (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~p~0))) 4294967296) main_~p~0) 0) (<= 0 (+ (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) (* 4294967296 (div (div (+ (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~p~0) main_~d~0) 4294967296) main_~p~0)))) (< (+ (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) (* 4294967296 (div (div (+ (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~p~0) main_~d~0) 4294967296) main_~p~0))) 4294967296) (not (= main_~q~0 0)) (< (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) 4294967296) (= (mod (+ (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~p~0) main_~d~0) 4294967296) 0))) (= main_~q~0 main_~p~0) (<= (mod main_~A~0 4294967296) (+ main_~d~0 main_~r~0)))} is UNKNOWN [2022-04-28 12:58:10,645 INFO L290 TraceCheckUtils]: 74: Hoare triple {10502#(and (or (and (= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 0) (= main_~q~0 0) (exists ((aux_div_aux_mod_main_~B~0_26_37 Int) (aux_mod_aux_mod_main_~B~0_26_37 Int)) (and (< (+ (* 4294967296 aux_div_aux_mod_main_~B~0_26_37) aux_mod_aux_mod_main_~B~0_26_37) 4294967296) (<= 0 aux_mod_aux_mod_main_~B~0_26_37) (<= 0 (+ (* 4294967296 aux_div_aux_mod_main_~B~0_26_37) aux_mod_aux_mod_main_~B~0_26_37)) (< aux_mod_aux_mod_main_~B~0_26_37 4294967296) (= (* main_~p~0 (+ (* 4294967296 aux_div_aux_mod_main_~B~0_26_37) aux_mod_aux_mod_main_~B~0_26_37)) main_~d~0)))) (and (<= 0 (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0)) (= (mod (div (+ main_~d~0 (* (- 1) (* (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~p~0))) 4294967296) main_~p~0) 0) (<= 0 (+ (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) (* 4294967296 (div (div (+ (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~p~0) main_~d~0) 4294967296) main_~p~0)))) (< (+ (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) (* 4294967296 (div (div (+ (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~p~0) main_~d~0) 4294967296) main_~p~0))) 4294967296) (not (= main_~q~0 0)) (< (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) 4294967296) (= (mod (+ (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~p~0) main_~d~0) 4294967296) 0))) (= main_~q~0 main_~p~0) (<= (mod main_~A~0 4294967296) (+ main_~d~0 main_~r~0)))} assume !(1 != ~p~0); {10506#(and (< (+ (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) (* 4294967296 (div (div (+ main_~d~0 (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~q~0)) 4294967296) main_~q~0))) 4294967296) (= (mod (+ main_~d~0 (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~q~0)) 4294967296) 0) (<= 0 (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0)) (= main_~q~0 1) (< (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) 4294967296) (<= 0 (+ (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) (* 4294967296 (div (div (+ main_~d~0 (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~q~0)) 4294967296) main_~q~0)))))} is VALID [2022-04-28 12:58:10,648 INFO L272 TraceCheckUtils]: 75: Hoare triple {10506#(and (< (+ (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) (* 4294967296 (div (div (+ main_~d~0 (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~q~0)) 4294967296) main_~q~0))) 4294967296) (= (mod (+ main_~d~0 (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~q~0)) 4294967296) 0) (<= 0 (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0)) (= main_~q~0 1) (< (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) 4294967296) (<= 0 (+ (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) (* 4294967296 (div (div (+ main_~d~0 (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~q~0)) 4294967296) main_~q~0)))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {10510#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:58:10,648 INFO L290 TraceCheckUtils]: 76: Hoare triple {10510#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10514#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:58:10,648 INFO L290 TraceCheckUtils]: 77: Hoare triple {10514#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10274#false} is VALID [2022-04-28 12:58:10,648 INFO L290 TraceCheckUtils]: 78: Hoare triple {10274#false} assume !false; {10274#false} is VALID [2022-04-28 12:58:10,649 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 66 proven. 7 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-04-28 12:58:10,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:58:58,154 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:59:03,943 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:59:27,025 INFO L290 TraceCheckUtils]: 78: Hoare triple {10274#false} assume !false; {10274#false} is VALID [2022-04-28 12:59:27,026 INFO L290 TraceCheckUtils]: 77: Hoare triple {10514#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10274#false} is VALID [2022-04-28 12:59:27,026 INFO L290 TraceCheckUtils]: 76: Hoare triple {10510#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10514#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:59:27,027 INFO L272 TraceCheckUtils]: 75: Hoare triple {10530#(= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {10510#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:59:27,027 INFO L290 TraceCheckUtils]: 74: Hoare triple {10534#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~p~0 1)))} assume !(1 != ~p~0); {10530#(= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0))} is VALID [2022-04-28 12:59:27,028 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10479#(not (= |__VERIFIER_assert_#in~cond| 0))} {10538#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (not (= main_~p~0 1)))} #90#return; {10534#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~p~0 1)))} is VALID [2022-04-28 12:59:27,028 INFO L290 TraceCheckUtils]: 72: Hoare triple {10479#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10479#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:59:27,028 INFO L290 TraceCheckUtils]: 71: Hoare triple {10548#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10479#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:59:27,028 INFO L290 TraceCheckUtils]: 70: Hoare triple {10273#true} ~cond := #in~cond; {10548#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:59:27,029 INFO L272 TraceCheckUtils]: 69: Hoare triple {10538#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (not (= main_~p~0 1)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10273#true} is VALID [2022-04-28 12:59:27,031 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10479#(not (= |__VERIFIER_assert_#in~cond| 0))} {10273#true} #88#return; {10538#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (not (= main_~p~0 1)))} is VALID [2022-04-28 12:59:27,031 INFO L290 TraceCheckUtils]: 67: Hoare triple {10479#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10479#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:59:27,031 INFO L290 TraceCheckUtils]: 66: Hoare triple {10548#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10479#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:59:27,031 INFO L290 TraceCheckUtils]: 65: Hoare triple {10273#true} ~cond := #in~cond; {10548#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:59:27,032 INFO L272 TraceCheckUtils]: 64: Hoare triple {10273#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {10273#true} is VALID [2022-04-28 12:59:27,032 INFO L290 TraceCheckUtils]: 63: Hoare triple {10273#true} assume !!(#t~post7 < 5);havoc #t~post7; {10273#true} is VALID [2022-04-28 12:59:27,032 INFO L290 TraceCheckUtils]: 62: Hoare triple {10273#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10273#true} is VALID [2022-04-28 12:59:27,032 INFO L290 TraceCheckUtils]: 61: Hoare triple {10273#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10273#true} is VALID [2022-04-28 12:59:27,032 INFO L290 TraceCheckUtils]: 60: Hoare triple {10273#true} 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); {10273#true} is VALID [2022-04-28 12:59:27,032 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10273#true} {10273#true} #90#return; {10273#true} is VALID [2022-04-28 12:59:27,032 INFO L290 TraceCheckUtils]: 58: Hoare triple {10273#true} assume true; {10273#true} is VALID [2022-04-28 12:59:27,032 INFO L290 TraceCheckUtils]: 57: Hoare triple {10273#true} assume !(0 == ~cond); {10273#true} is VALID [2022-04-28 12:59:27,032 INFO L290 TraceCheckUtils]: 56: Hoare triple {10273#true} ~cond := #in~cond; {10273#true} is VALID [2022-04-28 12:59:27,032 INFO L272 TraceCheckUtils]: 55: Hoare triple {10273#true} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10273#true} is VALID [2022-04-28 12:59:27,032 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10273#true} {10273#true} #88#return; {10273#true} is VALID [2022-04-28 12:59:27,032 INFO L290 TraceCheckUtils]: 53: Hoare triple {10273#true} assume true; {10273#true} is VALID [2022-04-28 12:59:27,032 INFO L290 TraceCheckUtils]: 52: Hoare triple {10273#true} assume !(0 == ~cond); {10273#true} is VALID [2022-04-28 12:59:27,032 INFO L290 TraceCheckUtils]: 51: Hoare triple {10273#true} ~cond := #in~cond; {10273#true} is VALID [2022-04-28 12:59:27,032 INFO L272 TraceCheckUtils]: 50: Hoare triple {10273#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {10273#true} is VALID [2022-04-28 12:59:27,032 INFO L290 TraceCheckUtils]: 49: Hoare triple {10273#true} assume !!(#t~post7 < 5);havoc #t~post7; {10273#true} is VALID [2022-04-28 12:59:27,032 INFO L290 TraceCheckUtils]: 48: Hoare triple {10273#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10273#true} is VALID [2022-04-28 12:59:27,032 INFO L290 TraceCheckUtils]: 47: Hoare triple {10273#true} assume !(~r~0 >= ~d~0); {10273#true} is VALID [2022-04-28 12:59:27,033 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10273#true} {10273#true} #86#return; {10273#true} is VALID [2022-04-28 12:59:27,033 INFO L290 TraceCheckUtils]: 45: Hoare triple {10273#true} assume true; {10273#true} is VALID [2022-04-28 12:59:27,033 INFO L290 TraceCheckUtils]: 44: Hoare triple {10273#true} assume !(0 == ~cond); {10273#true} is VALID [2022-04-28 12:59:27,033 INFO L290 TraceCheckUtils]: 43: Hoare triple {10273#true} ~cond := #in~cond; {10273#true} is VALID [2022-04-28 12:59:27,033 INFO L272 TraceCheckUtils]: 42: Hoare triple {10273#true} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10273#true} is VALID [2022-04-28 12:59:27,033 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10273#true} {10273#true} #84#return; {10273#true} is VALID [2022-04-28 12:59:27,033 INFO L290 TraceCheckUtils]: 40: Hoare triple {10273#true} assume true; {10273#true} is VALID [2022-04-28 12:59:27,033 INFO L290 TraceCheckUtils]: 39: Hoare triple {10273#true} assume !(0 == ~cond); {10273#true} is VALID [2022-04-28 12:59:27,033 INFO L290 TraceCheckUtils]: 38: Hoare triple {10273#true} ~cond := #in~cond; {10273#true} is VALID [2022-04-28 12:59:27,033 INFO L272 TraceCheckUtils]: 37: Hoare triple {10273#true} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {10273#true} is VALID [2022-04-28 12:59:27,033 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10273#true} {10273#true} #82#return; {10273#true} is VALID [2022-04-28 12:59:27,033 INFO L290 TraceCheckUtils]: 35: Hoare triple {10273#true} assume true; {10273#true} is VALID [2022-04-28 12:59:27,033 INFO L290 TraceCheckUtils]: 34: Hoare triple {10273#true} assume !(0 == ~cond); {10273#true} is VALID [2022-04-28 12:59:27,033 INFO L290 TraceCheckUtils]: 33: Hoare triple {10273#true} ~cond := #in~cond; {10273#true} is VALID [2022-04-28 12:59:27,033 INFO L272 TraceCheckUtils]: 32: Hoare triple {10273#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10273#true} is VALID [2022-04-28 12:59:27,033 INFO L290 TraceCheckUtils]: 31: Hoare triple {10273#true} assume !!(#t~post6 < 5);havoc #t~post6; {10273#true} is VALID [2022-04-28 12:59:27,033 INFO L290 TraceCheckUtils]: 30: Hoare triple {10273#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10273#true} is VALID [2022-04-28 12:59:27,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {10273#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10273#true} is VALID [2022-04-28 12:59:27,033 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10273#true} {10273#true} #86#return; {10273#true} is VALID [2022-04-28 12:59:27,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {10273#true} assume true; {10273#true} is VALID [2022-04-28 12:59:27,034 INFO L290 TraceCheckUtils]: 26: Hoare triple {10273#true} assume !(0 == ~cond); {10273#true} is VALID [2022-04-28 12:59:27,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {10273#true} ~cond := #in~cond; {10273#true} is VALID [2022-04-28 12:59:27,034 INFO L272 TraceCheckUtils]: 24: Hoare triple {10273#true} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10273#true} is VALID [2022-04-28 12:59:27,034 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10273#true} {10273#true} #84#return; {10273#true} is VALID [2022-04-28 12:59:27,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {10273#true} assume true; {10273#true} is VALID [2022-04-28 12:59:27,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {10273#true} assume !(0 == ~cond); {10273#true} is VALID [2022-04-28 12:59:27,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {10273#true} ~cond := #in~cond; {10273#true} is VALID [2022-04-28 12:59:27,034 INFO L272 TraceCheckUtils]: 19: Hoare triple {10273#true} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {10273#true} is VALID [2022-04-28 12:59:27,034 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10273#true} {10273#true} #82#return; {10273#true} is VALID [2022-04-28 12:59:27,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {10273#true} assume true; {10273#true} is VALID [2022-04-28 12:59:27,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {10273#true} assume !(0 == ~cond); {10273#true} is VALID [2022-04-28 12:59:27,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {10273#true} ~cond := #in~cond; {10273#true} is VALID [2022-04-28 12:59:27,034 INFO L272 TraceCheckUtils]: 14: Hoare triple {10273#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10273#true} is VALID [2022-04-28 12:59:27,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {10273#true} assume !!(#t~post6 < 5);havoc #t~post6; {10273#true} is VALID [2022-04-28 12:59:27,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {10273#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10273#true} is VALID [2022-04-28 12:59:27,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {10273#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {10273#true} is VALID [2022-04-28 12:59:27,034 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10273#true} {10273#true} #80#return; {10273#true} is VALID [2022-04-28 12:59:27,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {10273#true} assume true; {10273#true} is VALID [2022-04-28 12:59:27,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {10273#true} assume !(0 == ~cond); {10273#true} is VALID [2022-04-28 12:59:27,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {10273#true} ~cond := #in~cond; {10273#true} is VALID [2022-04-28 12:59:27,035 INFO L272 TraceCheckUtils]: 6: Hoare triple {10273#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {10273#true} is VALID [2022-04-28 12:59:27,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {10273#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; {10273#true} is VALID [2022-04-28 12:59:27,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {10273#true} call #t~ret8 := main(); {10273#true} is VALID [2022-04-28 12:59:27,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10273#true} {10273#true} #96#return; {10273#true} is VALID [2022-04-28 12:59:27,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {10273#true} assume true; {10273#true} is VALID [2022-04-28 12:59:27,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {10273#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);~counter~0 := 0; {10273#true} is VALID [2022-04-28 12:59:27,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {10273#true} call ULTIMATE.init(); {10273#true} is VALID [2022-04-28 12:59:27,035 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2022-04-28 12:59:27,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:59:27,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399923890] [2022-04-28 12:59:27,035 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:59:27,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156383813] [2022-04-28 12:59:27,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156383813] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:59:27,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:59:27,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2022-04-28 12:59:27,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:59:27,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [949573337] [2022-04-28 12:59:27,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [949573337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:59:27,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:59:27,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 12:59:27,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643190641] [2022-04-28 12:59:27,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:59:27,037 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 79 [2022-04-28 12:59:27,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:59:27,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 12:59:29,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 46 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:29,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 12:59:29,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:59:29,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 12:59:29,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-28 12:59:29,090 INFO L87 Difference]: Start difference. First operand 143 states and 160 transitions. Second operand has 11 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 12:59:32,222 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-28 12:59:37,909 WARN L232 SmtUtils]: Spent 5.61s on a formula simplification. DAG size of input: 57 DAG size of output: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 12:59:38,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:38,752 INFO L93 Difference]: Finished difference Result 159 states and 181 transitions. [2022-04-28 12:59:38,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 12:59:38,752 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 79 [2022-04-28 12:59:38,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:59:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 12:59:38,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2022-04-28 12:59:38,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 12:59:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2022-04-28 12:59:38,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 76 transitions. [2022-04-28 12:59:40,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 75 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:40,837 INFO L225 Difference]: With dead ends: 159 [2022-04-28 12:59:40,837 INFO L226 Difference]: Without dead ends: 129 [2022-04-28 12:59:40,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-28 12:59:40,837 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 17 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 12:59:40,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 197 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 238 Invalid, 1 Unknown, 5 Unchecked, 2.8s Time] [2022-04-28 12:59:40,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-28 12:59:40,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2022-04-28 12:59:40,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:59:40,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 125 states, 80 states have (on average 1.1625) internal successors, (93), 84 states have internal predecessors, (93), 27 states have call successors, (27), 18 states have call predecessors, (27), 17 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 12:59:40,940 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 125 states, 80 states have (on average 1.1625) internal successors, (93), 84 states have internal predecessors, (93), 27 states have call successors, (27), 18 states have call predecessors, (27), 17 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 12:59:40,940 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 125 states, 80 states have (on average 1.1625) internal successors, (93), 84 states have internal predecessors, (93), 27 states have call successors, (27), 18 states have call predecessors, (27), 17 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 12:59:40,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:40,942 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2022-04-28 12:59:40,942 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2022-04-28 12:59:40,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:59:40,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:59:40,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 80 states have (on average 1.1625) internal successors, (93), 84 states have internal predecessors, (93), 27 states have call successors, (27), 18 states have call predecessors, (27), 17 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) Second operand 129 states. [2022-04-28 12:59:40,943 INFO L87 Difference]: Start difference. First operand has 125 states, 80 states have (on average 1.1625) internal successors, (93), 84 states have internal predecessors, (93), 27 states have call successors, (27), 18 states have call predecessors, (27), 17 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) Second operand 129 states. [2022-04-28 12:59:40,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:40,945 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2022-04-28 12:59:40,945 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2022-04-28 12:59:40,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:59:40,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:59:40,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:59:40,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:59:40,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 80 states have (on average 1.1625) internal successors, (93), 84 states have internal predecessors, (93), 27 states have call successors, (27), 18 states have call predecessors, (27), 17 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 12:59:40,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2022-04-28 12:59:40,949 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 79 [2022-04-28 12:59:40,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:59:40,952 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2022-04-28 12:59:40,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 12:59:40,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 145 transitions. [2022-04-28 12:59:43,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 144 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:43,122 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2022-04-28 12:59:43,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 12:59:43,123 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:59:43,123 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:59:43,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 12:59:43,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 12:59:43,323 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:59:43,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:59:43,324 INFO L85 PathProgramCache]: Analyzing trace with hash 816704307, now seen corresponding path program 5 times [2022-04-28 12:59:43,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:59:43,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1442003233] [2022-04-28 12:59:50,107 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 12:59:50,108 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 12:59:50,108 INFO L85 PathProgramCache]: Analyzing trace with hash 816704307, now seen corresponding path program 6 times [2022-04-28 12:59:50,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:59:50,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452983062] [2022-04-28 12:59:50,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:59:50,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:59:50,115 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:59:50,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [764947067] [2022-04-28 12:59:50,116 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:59:50,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:59:50,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:59:50,116 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:59:50,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 12:59:50,163 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 12:59:50,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:59:50,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 12:59:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:59:50,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:59:50,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {11593#true} call ULTIMATE.init(); {11593#true} is VALID [2022-04-28 12:59:50,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {11593#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);~counter~0 := 0; {11601#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:50,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {11601#(<= ~counter~0 0)} assume true; {11601#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:50,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11601#(<= ~counter~0 0)} {11593#true} #96#return; {11601#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:50,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {11601#(<= ~counter~0 0)} call #t~ret8 := main(); {11601#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:50,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {11601#(<= ~counter~0 0)} 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; {11601#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:50,466 INFO L272 TraceCheckUtils]: 6: Hoare triple {11601#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {11601#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:50,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {11601#(<= ~counter~0 0)} ~cond := #in~cond; {11601#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:50,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {11601#(<= ~counter~0 0)} assume !(0 == ~cond); {11601#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:50,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {11601#(<= ~counter~0 0)} assume true; {11601#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:50,467 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11601#(<= ~counter~0 0)} {11601#(<= ~counter~0 0)} #80#return; {11601#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:50,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {11601#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {11601#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:50,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {11601#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {11635#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,469 INFO L272 TraceCheckUtils]: 14: Hoare triple {11635#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {11635#(<= ~counter~0 1)} ~cond := #in~cond; {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {11635#(<= ~counter~0 1)} assume !(0 == ~cond); {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {11635#(<= ~counter~0 1)} assume true; {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,470 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11635#(<= ~counter~0 1)} {11635#(<= ~counter~0 1)} #82#return; {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,471 INFO L272 TraceCheckUtils]: 19: Hoare triple {11635#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {11635#(<= ~counter~0 1)} ~cond := #in~cond; {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {11635#(<= ~counter~0 1)} assume !(0 == ~cond); {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {11635#(<= ~counter~0 1)} assume true; {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,472 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11635#(<= ~counter~0 1)} {11635#(<= ~counter~0 1)} #84#return; {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,472 INFO L272 TraceCheckUtils]: 24: Hoare triple {11635#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {11635#(<= ~counter~0 1)} ~cond := #in~cond; {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {11635#(<= ~counter~0 1)} assume !(0 == ~cond); {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {11635#(<= ~counter~0 1)} assume true; {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,473 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {11635#(<= ~counter~0 1)} {11635#(<= ~counter~0 1)} #86#return; {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {11635#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {11635#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {11690#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,475 INFO L272 TraceCheckUtils]: 32: Hoare triple {11690#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {11690#(<= ~counter~0 2)} ~cond := #in~cond; {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,475 INFO L290 TraceCheckUtils]: 34: Hoare triple {11690#(<= ~counter~0 2)} assume !(0 == ~cond); {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,476 INFO L290 TraceCheckUtils]: 35: Hoare triple {11690#(<= ~counter~0 2)} assume true; {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,476 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11690#(<= ~counter~0 2)} {11690#(<= ~counter~0 2)} #82#return; {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,476 INFO L272 TraceCheckUtils]: 37: Hoare triple {11690#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,477 INFO L290 TraceCheckUtils]: 38: Hoare triple {11690#(<= ~counter~0 2)} ~cond := #in~cond; {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,477 INFO L290 TraceCheckUtils]: 39: Hoare triple {11690#(<= ~counter~0 2)} assume !(0 == ~cond); {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,477 INFO L290 TraceCheckUtils]: 40: Hoare triple {11690#(<= ~counter~0 2)} assume true; {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,478 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11690#(<= ~counter~0 2)} {11690#(<= ~counter~0 2)} #84#return; {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,478 INFO L272 TraceCheckUtils]: 42: Hoare triple {11690#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,478 INFO L290 TraceCheckUtils]: 43: Hoare triple {11690#(<= ~counter~0 2)} ~cond := #in~cond; {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,479 INFO L290 TraceCheckUtils]: 44: Hoare triple {11690#(<= ~counter~0 2)} assume !(0 == ~cond); {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,479 INFO L290 TraceCheckUtils]: 45: Hoare triple {11690#(<= ~counter~0 2)} assume true; {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,479 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {11690#(<= ~counter~0 2)} {11690#(<= ~counter~0 2)} #86#return; {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,480 INFO L290 TraceCheckUtils]: 47: Hoare triple {11690#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,480 INFO L290 TraceCheckUtils]: 48: Hoare triple {11690#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,480 INFO L290 TraceCheckUtils]: 49: Hoare triple {11745#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,481 INFO L272 TraceCheckUtils]: 50: Hoare triple {11745#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,481 INFO L290 TraceCheckUtils]: 51: Hoare triple {11745#(<= ~counter~0 3)} ~cond := #in~cond; {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,481 INFO L290 TraceCheckUtils]: 52: Hoare triple {11745#(<= ~counter~0 3)} assume !(0 == ~cond); {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,482 INFO L290 TraceCheckUtils]: 53: Hoare triple {11745#(<= ~counter~0 3)} assume true; {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,482 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {11745#(<= ~counter~0 3)} {11745#(<= ~counter~0 3)} #82#return; {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,482 INFO L272 TraceCheckUtils]: 55: Hoare triple {11745#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,483 INFO L290 TraceCheckUtils]: 56: Hoare triple {11745#(<= ~counter~0 3)} ~cond := #in~cond; {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,483 INFO L290 TraceCheckUtils]: 57: Hoare triple {11745#(<= ~counter~0 3)} assume !(0 == ~cond); {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,483 INFO L290 TraceCheckUtils]: 58: Hoare triple {11745#(<= ~counter~0 3)} assume true; {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,484 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11745#(<= ~counter~0 3)} {11745#(<= ~counter~0 3)} #84#return; {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,484 INFO L272 TraceCheckUtils]: 60: Hoare triple {11745#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,484 INFO L290 TraceCheckUtils]: 61: Hoare triple {11745#(<= ~counter~0 3)} ~cond := #in~cond; {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,485 INFO L290 TraceCheckUtils]: 62: Hoare triple {11745#(<= ~counter~0 3)} assume !(0 == ~cond); {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,485 INFO L290 TraceCheckUtils]: 63: Hoare triple {11745#(<= ~counter~0 3)} assume true; {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,485 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {11745#(<= ~counter~0 3)} {11745#(<= ~counter~0 3)} #86#return; {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,486 INFO L290 TraceCheckUtils]: 65: Hoare triple {11745#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,486 INFO L290 TraceCheckUtils]: 66: Hoare triple {11745#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11800#(<= |main_#t~post6| 3)} is VALID [2022-04-28 12:59:50,486 INFO L290 TraceCheckUtils]: 67: Hoare triple {11800#(<= |main_#t~post6| 3)} assume !(#t~post6 < 5);havoc #t~post6; {11594#false} is VALID [2022-04-28 12:59:50,486 INFO L290 TraceCheckUtils]: 68: Hoare triple {11594#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11594#false} is VALID [2022-04-28 12:59:50,486 INFO L290 TraceCheckUtils]: 69: Hoare triple {11594#false} assume !(#t~post7 < 5);havoc #t~post7; {11594#false} is VALID [2022-04-28 12:59:50,486 INFO L272 TraceCheckUtils]: 70: Hoare triple {11594#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {11594#false} is VALID [2022-04-28 12:59:50,487 INFO L290 TraceCheckUtils]: 71: Hoare triple {11594#false} ~cond := #in~cond; {11594#false} is VALID [2022-04-28 12:59:50,487 INFO L290 TraceCheckUtils]: 72: Hoare triple {11594#false} assume !(0 == ~cond); {11594#false} is VALID [2022-04-28 12:59:50,487 INFO L290 TraceCheckUtils]: 73: Hoare triple {11594#false} assume true; {11594#false} is VALID [2022-04-28 12:59:50,487 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11594#false} {11594#false} #92#return; {11594#false} is VALID [2022-04-28 12:59:50,487 INFO L272 TraceCheckUtils]: 75: Hoare triple {11594#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {11594#false} is VALID [2022-04-28 12:59:50,487 INFO L290 TraceCheckUtils]: 76: Hoare triple {11594#false} ~cond := #in~cond; {11594#false} is VALID [2022-04-28 12:59:50,487 INFO L290 TraceCheckUtils]: 77: Hoare triple {11594#false} assume 0 == ~cond; {11594#false} is VALID [2022-04-28 12:59:50,487 INFO L290 TraceCheckUtils]: 78: Hoare triple {11594#false} assume !false; {11594#false} is VALID [2022-04-28 12:59:50,487 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 54 proven. 132 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-28 12:59:50,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:59:50,711 INFO L290 TraceCheckUtils]: 78: Hoare triple {11594#false} assume !false; {11594#false} is VALID [2022-04-28 12:59:50,711 INFO L290 TraceCheckUtils]: 77: Hoare triple {11594#false} assume 0 == ~cond; {11594#false} is VALID [2022-04-28 12:59:50,711 INFO L290 TraceCheckUtils]: 76: Hoare triple {11594#false} ~cond := #in~cond; {11594#false} is VALID [2022-04-28 12:59:50,711 INFO L272 TraceCheckUtils]: 75: Hoare triple {11594#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {11594#false} is VALID [2022-04-28 12:59:50,711 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11593#true} {11594#false} #92#return; {11594#false} is VALID [2022-04-28 12:59:50,711 INFO L290 TraceCheckUtils]: 73: Hoare triple {11593#true} assume true; {11593#true} is VALID [2022-04-28 12:59:50,711 INFO L290 TraceCheckUtils]: 72: Hoare triple {11593#true} assume !(0 == ~cond); {11593#true} is VALID [2022-04-28 12:59:50,711 INFO L290 TraceCheckUtils]: 71: Hoare triple {11593#true} ~cond := #in~cond; {11593#true} is VALID [2022-04-28 12:59:50,711 INFO L272 TraceCheckUtils]: 70: Hoare triple {11594#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {11593#true} is VALID [2022-04-28 12:59:50,711 INFO L290 TraceCheckUtils]: 69: Hoare triple {11594#false} assume !(#t~post7 < 5);havoc #t~post7; {11594#false} is VALID [2022-04-28 12:59:50,711 INFO L290 TraceCheckUtils]: 68: Hoare triple {11594#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11594#false} is VALID [2022-04-28 12:59:50,712 INFO L290 TraceCheckUtils]: 67: Hoare triple {11870#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {11594#false} is VALID [2022-04-28 12:59:50,712 INFO L290 TraceCheckUtils]: 66: Hoare triple {11874#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11870#(< |main_#t~post6| 5)} is VALID [2022-04-28 12:59:50,712 INFO L290 TraceCheckUtils]: 65: Hoare triple {11874#(< ~counter~0 5)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11874#(< ~counter~0 5)} is VALID [2022-04-28 12:59:50,713 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {11593#true} {11874#(< ~counter~0 5)} #86#return; {11874#(< ~counter~0 5)} is VALID [2022-04-28 12:59:50,713 INFO L290 TraceCheckUtils]: 63: Hoare triple {11593#true} assume true; {11593#true} is VALID [2022-04-28 12:59:50,713 INFO L290 TraceCheckUtils]: 62: Hoare triple {11593#true} assume !(0 == ~cond); {11593#true} is VALID [2022-04-28 12:59:50,713 INFO L290 TraceCheckUtils]: 61: Hoare triple {11593#true} ~cond := #in~cond; {11593#true} is VALID [2022-04-28 12:59:50,713 INFO L272 TraceCheckUtils]: 60: Hoare triple {11874#(< ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11593#true} is VALID [2022-04-28 12:59:50,713 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11593#true} {11874#(< ~counter~0 5)} #84#return; {11874#(< ~counter~0 5)} is VALID [2022-04-28 12:59:50,713 INFO L290 TraceCheckUtils]: 58: Hoare triple {11593#true} assume true; {11593#true} is VALID [2022-04-28 12:59:50,713 INFO L290 TraceCheckUtils]: 57: Hoare triple {11593#true} assume !(0 == ~cond); {11593#true} is VALID [2022-04-28 12:59:50,714 INFO L290 TraceCheckUtils]: 56: Hoare triple {11593#true} ~cond := #in~cond; {11593#true} is VALID [2022-04-28 12:59:50,714 INFO L272 TraceCheckUtils]: 55: Hoare triple {11874#(< ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {11593#true} is VALID [2022-04-28 12:59:50,714 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {11593#true} {11874#(< ~counter~0 5)} #82#return; {11874#(< ~counter~0 5)} is VALID [2022-04-28 12:59:50,714 INFO L290 TraceCheckUtils]: 53: Hoare triple {11593#true} assume true; {11593#true} is VALID [2022-04-28 12:59:50,714 INFO L290 TraceCheckUtils]: 52: Hoare triple {11593#true} assume !(0 == ~cond); {11593#true} is VALID [2022-04-28 12:59:50,714 INFO L290 TraceCheckUtils]: 51: Hoare triple {11593#true} ~cond := #in~cond; {11593#true} is VALID [2022-04-28 12:59:50,714 INFO L272 TraceCheckUtils]: 50: Hoare triple {11874#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11593#true} is VALID [2022-04-28 12:59:50,714 INFO L290 TraceCheckUtils]: 49: Hoare triple {11874#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {11874#(< ~counter~0 5)} is VALID [2022-04-28 12:59:50,715 INFO L290 TraceCheckUtils]: 48: Hoare triple {11745#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11874#(< ~counter~0 5)} is VALID [2022-04-28 12:59:50,715 INFO L290 TraceCheckUtils]: 47: Hoare triple {11745#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,716 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {11593#true} {11745#(<= ~counter~0 3)} #86#return; {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,716 INFO L290 TraceCheckUtils]: 45: Hoare triple {11593#true} assume true; {11593#true} is VALID [2022-04-28 12:59:50,716 INFO L290 TraceCheckUtils]: 44: Hoare triple {11593#true} assume !(0 == ~cond); {11593#true} is VALID [2022-04-28 12:59:50,716 INFO L290 TraceCheckUtils]: 43: Hoare triple {11593#true} ~cond := #in~cond; {11593#true} is VALID [2022-04-28 12:59:50,716 INFO L272 TraceCheckUtils]: 42: Hoare triple {11745#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11593#true} is VALID [2022-04-28 12:59:50,716 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11593#true} {11745#(<= ~counter~0 3)} #84#return; {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {11593#true} assume true; {11593#true} is VALID [2022-04-28 12:59:50,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {11593#true} assume !(0 == ~cond); {11593#true} is VALID [2022-04-28 12:59:50,716 INFO L290 TraceCheckUtils]: 38: Hoare triple {11593#true} ~cond := #in~cond; {11593#true} is VALID [2022-04-28 12:59:50,716 INFO L272 TraceCheckUtils]: 37: Hoare triple {11745#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {11593#true} is VALID [2022-04-28 12:59:50,717 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11593#true} {11745#(<= ~counter~0 3)} #82#return; {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,717 INFO L290 TraceCheckUtils]: 35: Hoare triple {11593#true} assume true; {11593#true} is VALID [2022-04-28 12:59:50,717 INFO L290 TraceCheckUtils]: 34: Hoare triple {11593#true} assume !(0 == ~cond); {11593#true} is VALID [2022-04-28 12:59:50,717 INFO L290 TraceCheckUtils]: 33: Hoare triple {11593#true} ~cond := #in~cond; {11593#true} is VALID [2022-04-28 12:59:50,717 INFO L272 TraceCheckUtils]: 32: Hoare triple {11745#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11593#true} is VALID [2022-04-28 12:59:50,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {11745#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,718 INFO L290 TraceCheckUtils]: 30: Hoare triple {11690#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11745#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:50,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {11690#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,718 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {11593#true} {11690#(<= ~counter~0 2)} #86#return; {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {11593#true} assume true; {11593#true} is VALID [2022-04-28 12:59:50,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {11593#true} assume !(0 == ~cond); {11593#true} is VALID [2022-04-28 12:59:50,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {11593#true} ~cond := #in~cond; {11593#true} is VALID [2022-04-28 12:59:50,719 INFO L272 TraceCheckUtils]: 24: Hoare triple {11690#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11593#true} is VALID [2022-04-28 12:59:50,719 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11593#true} {11690#(<= ~counter~0 2)} #84#return; {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,719 INFO L290 TraceCheckUtils]: 22: Hoare triple {11593#true} assume true; {11593#true} is VALID [2022-04-28 12:59:50,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {11593#true} assume !(0 == ~cond); {11593#true} is VALID [2022-04-28 12:59:50,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {11593#true} ~cond := #in~cond; {11593#true} is VALID [2022-04-28 12:59:50,719 INFO L272 TraceCheckUtils]: 19: Hoare triple {11690#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {11593#true} is VALID [2022-04-28 12:59:50,720 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11593#true} {11690#(<= ~counter~0 2)} #82#return; {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {11593#true} assume true; {11593#true} is VALID [2022-04-28 12:59:50,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {11593#true} assume !(0 == ~cond); {11593#true} is VALID [2022-04-28 12:59:50,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {11593#true} ~cond := #in~cond; {11593#true} is VALID [2022-04-28 12:59:50,720 INFO L272 TraceCheckUtils]: 14: Hoare triple {11690#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11593#true} is VALID [2022-04-28 12:59:50,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {11690#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {11635#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11690#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:50,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {11635#(<= ~counter~0 1)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,721 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11593#true} {11635#(<= ~counter~0 1)} #80#return; {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {11593#true} assume true; {11593#true} is VALID [2022-04-28 12:59:50,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {11593#true} assume !(0 == ~cond); {11593#true} is VALID [2022-04-28 12:59:50,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {11593#true} ~cond := #in~cond; {11593#true} is VALID [2022-04-28 12:59:50,722 INFO L272 TraceCheckUtils]: 6: Hoare triple {11635#(<= ~counter~0 1)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {11593#true} is VALID [2022-04-28 12:59:50,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {11635#(<= ~counter~0 1)} 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; {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {11635#(<= ~counter~0 1)} call #t~ret8 := main(); {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11635#(<= ~counter~0 1)} {11593#true} #96#return; {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {11635#(<= ~counter~0 1)} assume true; {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {11593#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);~counter~0 := 0; {11635#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:50,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {11593#true} call ULTIMATE.init(); {11593#true} is VALID [2022-04-28 12:59:50,724 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 12:59:50,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:59:50,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452983062] [2022-04-28 12:59:50,724 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:59:50,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764947067] [2022-04-28 12:59:50,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764947067] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:59:50,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:59:50,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 12:59:50,724 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:59:50,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1442003233] [2022-04-28 12:59:50,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1442003233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:59:50,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:59:50,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 12:59:50,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648583128] [2022-04-28 12:59:50,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:59:50,725 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Word has length 79 [2022-04-28 12:59:50,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:59:50,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-28 12:59:50,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:50,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 12:59:50,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:59:50,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 12:59:50,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:59:50,770 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-28 12:59:51,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:51,025 INFO L93 Difference]: Finished difference Result 170 states and 207 transitions. [2022-04-28 12:59:51,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 12:59:51,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Word has length 79 [2022-04-28 12:59:51,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:59:51,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-28 12:59:51,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2022-04-28 12:59:51,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-28 12:59:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2022-04-28 12:59:51,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 102 transitions. [2022-04-28 12:59:51,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:51,100 INFO L225 Difference]: With dead ends: 170 [2022-04-28 12:59:51,100 INFO L226 Difference]: Without dead ends: 127 [2022-04-28 12:59:51,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 12:59:51,100 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 7 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:59:51,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 157 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:59:51,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-04-28 12:59:51,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-04-28 12:59:51,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:59:51,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 127 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 86 states have internal predecessors, (95), 27 states have call successors, (27), 18 states have call predecessors, (27), 17 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 12:59:51,204 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 127 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 86 states have internal predecessors, (95), 27 states have call successors, (27), 18 states have call predecessors, (27), 17 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 12:59:51,204 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 127 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 86 states have internal predecessors, (95), 27 states have call successors, (27), 18 states have call predecessors, (27), 17 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 12:59:51,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:51,207 INFO L93 Difference]: Finished difference Result 127 states and 147 transitions. [2022-04-28 12:59:51,207 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 147 transitions. [2022-04-28 12:59:51,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:59:51,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:59:51,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 86 states have internal predecessors, (95), 27 states have call successors, (27), 18 states have call predecessors, (27), 17 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) Second operand 127 states. [2022-04-28 12:59:51,208 INFO L87 Difference]: Start difference. First operand has 127 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 86 states have internal predecessors, (95), 27 states have call successors, (27), 18 states have call predecessors, (27), 17 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) Second operand 127 states. [2022-04-28 12:59:51,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:51,210 INFO L93 Difference]: Finished difference Result 127 states and 147 transitions. [2022-04-28 12:59:51,210 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 147 transitions. [2022-04-28 12:59:51,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:59:51,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:59:51,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:59:51,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:59:51,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 86 states have internal predecessors, (95), 27 states have call successors, (27), 18 states have call predecessors, (27), 17 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 12:59:51,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 147 transitions. [2022-04-28 12:59:51,212 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 147 transitions. Word has length 79 [2022-04-28 12:59:51,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:59:51,212 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 147 transitions. [2022-04-28 12:59:51,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-28 12:59:51,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 147 transitions. [2022-04-28 12:59:53,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 146 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:53,403 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 147 transitions. [2022-04-28 12:59:53,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 12:59:53,404 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:59:53,404 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:59:53,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 12:59:53,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 12:59:53,604 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:59:53,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:59:53,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1069895175, now seen corresponding path program 3 times [2022-04-28 12:59:53,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:59:53,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1343840236] [2022-04-28 12:59:59,339 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 12:59:59,339 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 12:59:59,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1069895175, now seen corresponding path program 4 times [2022-04-28 12:59:59,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:59:59,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545142033] [2022-04-28 12:59:59,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:59:59,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:59:59,350 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:59:59,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [941641312] [2022-04-28 12:59:59,350 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:59:59,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:59:59,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:59:59,358 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:59:59,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 12:59:59,401 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:59:59,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:59:59,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 12:59:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:59:59,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:59:59,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {12929#true} call ULTIMATE.init(); {12929#true} is VALID [2022-04-28 12:59:59,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {12929#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);~counter~0 := 0; {12937#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {12937#(<= ~counter~0 0)} assume true; {12937#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12937#(<= ~counter~0 0)} {12929#true} #96#return; {12937#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {12937#(<= ~counter~0 0)} call #t~ret8 := main(); {12937#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {12937#(<= ~counter~0 0)} 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; {12937#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,691 INFO L272 TraceCheckUtils]: 6: Hoare triple {12937#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {12937#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {12937#(<= ~counter~0 0)} ~cond := #in~cond; {12937#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {12937#(<= ~counter~0 0)} assume !(0 == ~cond); {12937#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {12937#(<= ~counter~0 0)} assume true; {12937#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,694 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12937#(<= ~counter~0 0)} {12937#(<= ~counter~0 0)} #80#return; {12937#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {12937#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {12937#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {12937#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {12971#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,695 INFO L272 TraceCheckUtils]: 14: Hoare triple {12971#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {12971#(<= ~counter~0 1)} ~cond := #in~cond; {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {12971#(<= ~counter~0 1)} assume !(0 == ~cond); {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {12971#(<= ~counter~0 1)} assume true; {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,696 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12971#(<= ~counter~0 1)} {12971#(<= ~counter~0 1)} #82#return; {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,696 INFO L272 TraceCheckUtils]: 19: Hoare triple {12971#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {12971#(<= ~counter~0 1)} ~cond := #in~cond; {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {12971#(<= ~counter~0 1)} assume !(0 == ~cond); {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {12971#(<= ~counter~0 1)} assume true; {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,697 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12971#(<= ~counter~0 1)} {12971#(<= ~counter~0 1)} #84#return; {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,698 INFO L272 TraceCheckUtils]: 24: Hoare triple {12971#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {12971#(<= ~counter~0 1)} ~cond := #in~cond; {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {12971#(<= ~counter~0 1)} assume !(0 == ~cond); {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,698 INFO L290 TraceCheckUtils]: 27: Hoare triple {12971#(<= ~counter~0 1)} assume true; {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,698 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {12971#(<= ~counter~0 1)} {12971#(<= ~counter~0 1)} #86#return; {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {12971#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {12971#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,699 INFO L290 TraceCheckUtils]: 31: Hoare triple {13026#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,699 INFO L272 TraceCheckUtils]: 32: Hoare triple {13026#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,700 INFO L290 TraceCheckUtils]: 33: Hoare triple {13026#(<= ~counter~0 2)} ~cond := #in~cond; {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,700 INFO L290 TraceCheckUtils]: 34: Hoare triple {13026#(<= ~counter~0 2)} assume !(0 == ~cond); {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,700 INFO L290 TraceCheckUtils]: 35: Hoare triple {13026#(<= ~counter~0 2)} assume true; {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,700 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13026#(<= ~counter~0 2)} {13026#(<= ~counter~0 2)} #82#return; {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,700 INFO L272 TraceCheckUtils]: 37: Hoare triple {13026#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,701 INFO L290 TraceCheckUtils]: 38: Hoare triple {13026#(<= ~counter~0 2)} ~cond := #in~cond; {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,701 INFO L290 TraceCheckUtils]: 39: Hoare triple {13026#(<= ~counter~0 2)} assume !(0 == ~cond); {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,701 INFO L290 TraceCheckUtils]: 40: Hoare triple {13026#(<= ~counter~0 2)} assume true; {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,701 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13026#(<= ~counter~0 2)} {13026#(<= ~counter~0 2)} #84#return; {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,702 INFO L272 TraceCheckUtils]: 42: Hoare triple {13026#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,702 INFO L290 TraceCheckUtils]: 43: Hoare triple {13026#(<= ~counter~0 2)} ~cond := #in~cond; {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,702 INFO L290 TraceCheckUtils]: 44: Hoare triple {13026#(<= ~counter~0 2)} assume !(0 == ~cond); {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,703 INFO L290 TraceCheckUtils]: 45: Hoare triple {13026#(<= ~counter~0 2)} assume true; {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,703 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {13026#(<= ~counter~0 2)} {13026#(<= ~counter~0 2)} #86#return; {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,703 INFO L290 TraceCheckUtils]: 47: Hoare triple {13026#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,704 INFO L290 TraceCheckUtils]: 48: Hoare triple {13026#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,704 INFO L290 TraceCheckUtils]: 49: Hoare triple {13081#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,704 INFO L272 TraceCheckUtils]: 50: Hoare triple {13081#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,704 INFO L290 TraceCheckUtils]: 51: Hoare triple {13081#(<= ~counter~0 3)} ~cond := #in~cond; {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,709 INFO L290 TraceCheckUtils]: 52: Hoare triple {13081#(<= ~counter~0 3)} assume !(0 == ~cond); {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,709 INFO L290 TraceCheckUtils]: 53: Hoare triple {13081#(<= ~counter~0 3)} assume true; {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,709 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13081#(<= ~counter~0 3)} {13081#(<= ~counter~0 3)} #82#return; {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,710 INFO L272 TraceCheckUtils]: 55: Hoare triple {13081#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,710 INFO L290 TraceCheckUtils]: 56: Hoare triple {13081#(<= ~counter~0 3)} ~cond := #in~cond; {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,710 INFO L290 TraceCheckUtils]: 57: Hoare triple {13081#(<= ~counter~0 3)} assume !(0 == ~cond); {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,711 INFO L290 TraceCheckUtils]: 58: Hoare triple {13081#(<= ~counter~0 3)} assume true; {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,711 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13081#(<= ~counter~0 3)} {13081#(<= ~counter~0 3)} #84#return; {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,711 INFO L272 TraceCheckUtils]: 60: Hoare triple {13081#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,711 INFO L290 TraceCheckUtils]: 61: Hoare triple {13081#(<= ~counter~0 3)} ~cond := #in~cond; {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,712 INFO L290 TraceCheckUtils]: 62: Hoare triple {13081#(<= ~counter~0 3)} assume !(0 == ~cond); {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,712 INFO L290 TraceCheckUtils]: 63: Hoare triple {13081#(<= ~counter~0 3)} assume true; {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,712 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13081#(<= ~counter~0 3)} {13081#(<= ~counter~0 3)} #86#return; {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,712 INFO L290 TraceCheckUtils]: 65: Hoare triple {13081#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,713 INFO L290 TraceCheckUtils]: 66: Hoare triple {13081#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13136#(<= ~counter~0 4)} is VALID [2022-04-28 12:59:59,713 INFO L290 TraceCheckUtils]: 67: Hoare triple {13136#(<= ~counter~0 4)} assume !!(#t~post7 < 5);havoc #t~post7; {13136#(<= ~counter~0 4)} is VALID [2022-04-28 12:59:59,713 INFO L272 TraceCheckUtils]: 68: Hoare triple {13136#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {13136#(<= ~counter~0 4)} is VALID [2022-04-28 12:59:59,713 INFO L290 TraceCheckUtils]: 69: Hoare triple {13136#(<= ~counter~0 4)} ~cond := #in~cond; {13136#(<= ~counter~0 4)} is VALID [2022-04-28 12:59:59,714 INFO L290 TraceCheckUtils]: 70: Hoare triple {13136#(<= ~counter~0 4)} assume !(0 == ~cond); {13136#(<= ~counter~0 4)} is VALID [2022-04-28 12:59:59,714 INFO L290 TraceCheckUtils]: 71: Hoare triple {13136#(<= ~counter~0 4)} assume true; {13136#(<= ~counter~0 4)} is VALID [2022-04-28 12:59:59,714 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13136#(<= ~counter~0 4)} {13136#(<= ~counter~0 4)} #88#return; {13136#(<= ~counter~0 4)} is VALID [2022-04-28 12:59:59,714 INFO L272 TraceCheckUtils]: 73: Hoare triple {13136#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {13136#(<= ~counter~0 4)} is VALID [2022-04-28 12:59:59,715 INFO L290 TraceCheckUtils]: 74: Hoare triple {13136#(<= ~counter~0 4)} ~cond := #in~cond; {13136#(<= ~counter~0 4)} is VALID [2022-04-28 12:59:59,715 INFO L290 TraceCheckUtils]: 75: Hoare triple {13136#(<= ~counter~0 4)} assume !(0 == ~cond); {13136#(<= ~counter~0 4)} is VALID [2022-04-28 12:59:59,715 INFO L290 TraceCheckUtils]: 76: Hoare triple {13136#(<= ~counter~0 4)} assume true; {13136#(<= ~counter~0 4)} is VALID [2022-04-28 12:59:59,715 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {13136#(<= ~counter~0 4)} {13136#(<= ~counter~0 4)} #90#return; {13136#(<= ~counter~0 4)} is VALID [2022-04-28 12:59:59,715 INFO L290 TraceCheckUtils]: 78: Hoare triple {13136#(<= ~counter~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); {13136#(<= ~counter~0 4)} is VALID [2022-04-28 12:59:59,716 INFO L290 TraceCheckUtils]: 79: Hoare triple {13136#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {13136#(<= ~counter~0 4)} is VALID [2022-04-28 12:59:59,716 INFO L290 TraceCheckUtils]: 80: Hoare triple {13136#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13179#(<= |main_#t~post7| 4)} is VALID [2022-04-28 12:59:59,716 INFO L290 TraceCheckUtils]: 81: Hoare triple {13179#(<= |main_#t~post7| 4)} assume !(#t~post7 < 5);havoc #t~post7; {12930#false} is VALID [2022-04-28 12:59:59,716 INFO L272 TraceCheckUtils]: 82: Hoare triple {12930#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {12930#false} is VALID [2022-04-28 12:59:59,716 INFO L290 TraceCheckUtils]: 83: Hoare triple {12930#false} ~cond := #in~cond; {12930#false} is VALID [2022-04-28 12:59:59,716 INFO L290 TraceCheckUtils]: 84: Hoare triple {12930#false} assume 0 == ~cond; {12930#false} is VALID [2022-04-28 12:59:59,716 INFO L290 TraceCheckUtils]: 85: Hoare triple {12930#false} assume !false; {12930#false} is VALID [2022-04-28 12:59:59,717 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 22 proven. 200 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 12:59:59,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:59:59,983 INFO L290 TraceCheckUtils]: 85: Hoare triple {12930#false} assume !false; {12930#false} is VALID [2022-04-28 12:59:59,983 INFO L290 TraceCheckUtils]: 84: Hoare triple {12930#false} assume 0 == ~cond; {12930#false} is VALID [2022-04-28 12:59:59,983 INFO L290 TraceCheckUtils]: 83: Hoare triple {12930#false} ~cond := #in~cond; {12930#false} is VALID [2022-04-28 12:59:59,984 INFO L272 TraceCheckUtils]: 82: Hoare triple {12930#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {12930#false} is VALID [2022-04-28 12:59:59,984 INFO L290 TraceCheckUtils]: 81: Hoare triple {13179#(<= |main_#t~post7| 4)} assume !(#t~post7 < 5);havoc #t~post7; {12930#false} is VALID [2022-04-28 12:59:59,984 INFO L290 TraceCheckUtils]: 80: Hoare triple {13136#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13179#(<= |main_#t~post7| 4)} is VALID [2022-04-28 12:59:59,985 INFO L290 TraceCheckUtils]: 79: Hoare triple {13136#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {13136#(<= ~counter~0 4)} is VALID [2022-04-28 12:59:59,985 INFO L290 TraceCheckUtils]: 78: Hoare triple {13136#(<= ~counter~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); {13136#(<= ~counter~0 4)} is VALID [2022-04-28 12:59:59,986 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {12929#true} {13136#(<= ~counter~0 4)} #90#return; {13136#(<= ~counter~0 4)} is VALID [2022-04-28 12:59:59,986 INFO L290 TraceCheckUtils]: 76: Hoare triple {12929#true} assume true; {12929#true} is VALID [2022-04-28 12:59:59,986 INFO L290 TraceCheckUtils]: 75: Hoare triple {12929#true} assume !(0 == ~cond); {12929#true} is VALID [2022-04-28 12:59:59,986 INFO L290 TraceCheckUtils]: 74: Hoare triple {12929#true} ~cond := #in~cond; {12929#true} is VALID [2022-04-28 12:59:59,986 INFO L272 TraceCheckUtils]: 73: Hoare triple {13136#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {12929#true} is VALID [2022-04-28 12:59:59,986 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {12929#true} {13136#(<= ~counter~0 4)} #88#return; {13136#(<= ~counter~0 4)} is VALID [2022-04-28 12:59:59,987 INFO L290 TraceCheckUtils]: 71: Hoare triple {12929#true} assume true; {12929#true} is VALID [2022-04-28 12:59:59,987 INFO L290 TraceCheckUtils]: 70: Hoare triple {12929#true} assume !(0 == ~cond); {12929#true} is VALID [2022-04-28 12:59:59,987 INFO L290 TraceCheckUtils]: 69: Hoare triple {12929#true} ~cond := #in~cond; {12929#true} is VALID [2022-04-28 12:59:59,987 INFO L272 TraceCheckUtils]: 68: Hoare triple {13136#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {12929#true} is VALID [2022-04-28 12:59:59,987 INFO L290 TraceCheckUtils]: 67: Hoare triple {13136#(<= ~counter~0 4)} assume !!(#t~post7 < 5);havoc #t~post7; {13136#(<= ~counter~0 4)} is VALID [2022-04-28 12:59:59,988 INFO L290 TraceCheckUtils]: 66: Hoare triple {13081#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13136#(<= ~counter~0 4)} is VALID [2022-04-28 12:59:59,988 INFO L290 TraceCheckUtils]: 65: Hoare triple {13081#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,989 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12929#true} {13081#(<= ~counter~0 3)} #86#return; {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,989 INFO L290 TraceCheckUtils]: 63: Hoare triple {12929#true} assume true; {12929#true} is VALID [2022-04-28 12:59:59,989 INFO L290 TraceCheckUtils]: 62: Hoare triple {12929#true} assume !(0 == ~cond); {12929#true} is VALID [2022-04-28 12:59:59,989 INFO L290 TraceCheckUtils]: 61: Hoare triple {12929#true} ~cond := #in~cond; {12929#true} is VALID [2022-04-28 12:59:59,989 INFO L272 TraceCheckUtils]: 60: Hoare triple {13081#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {12929#true} is VALID [2022-04-28 12:59:59,989 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12929#true} {13081#(<= ~counter~0 3)} #84#return; {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,989 INFO L290 TraceCheckUtils]: 58: Hoare triple {12929#true} assume true; {12929#true} is VALID [2022-04-28 12:59:59,990 INFO L290 TraceCheckUtils]: 57: Hoare triple {12929#true} assume !(0 == ~cond); {12929#true} is VALID [2022-04-28 12:59:59,990 INFO L290 TraceCheckUtils]: 56: Hoare triple {12929#true} ~cond := #in~cond; {12929#true} is VALID [2022-04-28 12:59:59,990 INFO L272 TraceCheckUtils]: 55: Hoare triple {13081#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {12929#true} is VALID [2022-04-28 12:59:59,990 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {12929#true} {13081#(<= ~counter~0 3)} #82#return; {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,990 INFO L290 TraceCheckUtils]: 53: Hoare triple {12929#true} assume true; {12929#true} is VALID [2022-04-28 12:59:59,990 INFO L290 TraceCheckUtils]: 52: Hoare triple {12929#true} assume !(0 == ~cond); {12929#true} is VALID [2022-04-28 12:59:59,990 INFO L290 TraceCheckUtils]: 51: Hoare triple {12929#true} ~cond := #in~cond; {12929#true} is VALID [2022-04-28 12:59:59,990 INFO L272 TraceCheckUtils]: 50: Hoare triple {13081#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12929#true} is VALID [2022-04-28 12:59:59,991 INFO L290 TraceCheckUtils]: 49: Hoare triple {13081#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,991 INFO L290 TraceCheckUtils]: 48: Hoare triple {13026#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13081#(<= ~counter~0 3)} is VALID [2022-04-28 12:59:59,992 INFO L290 TraceCheckUtils]: 47: Hoare triple {13026#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,992 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {12929#true} {13026#(<= ~counter~0 2)} #86#return; {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,992 INFO L290 TraceCheckUtils]: 45: Hoare triple {12929#true} assume true; {12929#true} is VALID [2022-04-28 12:59:59,992 INFO L290 TraceCheckUtils]: 44: Hoare triple {12929#true} assume !(0 == ~cond); {12929#true} is VALID [2022-04-28 12:59:59,992 INFO L290 TraceCheckUtils]: 43: Hoare triple {12929#true} ~cond := #in~cond; {12929#true} is VALID [2022-04-28 12:59:59,993 INFO L272 TraceCheckUtils]: 42: Hoare triple {13026#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {12929#true} is VALID [2022-04-28 12:59:59,993 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12929#true} {13026#(<= ~counter~0 2)} #84#return; {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,993 INFO L290 TraceCheckUtils]: 40: Hoare triple {12929#true} assume true; {12929#true} is VALID [2022-04-28 12:59:59,993 INFO L290 TraceCheckUtils]: 39: Hoare triple {12929#true} assume !(0 == ~cond); {12929#true} is VALID [2022-04-28 12:59:59,993 INFO L290 TraceCheckUtils]: 38: Hoare triple {12929#true} ~cond := #in~cond; {12929#true} is VALID [2022-04-28 12:59:59,993 INFO L272 TraceCheckUtils]: 37: Hoare triple {13026#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {12929#true} is VALID [2022-04-28 12:59:59,994 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12929#true} {13026#(<= ~counter~0 2)} #82#return; {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,994 INFO L290 TraceCheckUtils]: 35: Hoare triple {12929#true} assume true; {12929#true} is VALID [2022-04-28 12:59:59,994 INFO L290 TraceCheckUtils]: 34: Hoare triple {12929#true} assume !(0 == ~cond); {12929#true} is VALID [2022-04-28 12:59:59,994 INFO L290 TraceCheckUtils]: 33: Hoare triple {12929#true} ~cond := #in~cond; {12929#true} is VALID [2022-04-28 12:59:59,994 INFO L272 TraceCheckUtils]: 32: Hoare triple {13026#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12929#true} is VALID [2022-04-28 12:59:59,995 INFO L290 TraceCheckUtils]: 31: Hoare triple {13026#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,995 INFO L290 TraceCheckUtils]: 30: Hoare triple {12971#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13026#(<= ~counter~0 2)} is VALID [2022-04-28 12:59:59,995 INFO L290 TraceCheckUtils]: 29: Hoare triple {12971#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,996 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {12929#true} {12971#(<= ~counter~0 1)} #86#return; {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {12929#true} assume true; {12929#true} is VALID [2022-04-28 12:59:59,996 INFO L290 TraceCheckUtils]: 26: Hoare triple {12929#true} assume !(0 == ~cond); {12929#true} is VALID [2022-04-28 12:59:59,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {12929#true} ~cond := #in~cond; {12929#true} is VALID [2022-04-28 12:59:59,996 INFO L272 TraceCheckUtils]: 24: Hoare triple {12971#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {12929#true} is VALID [2022-04-28 12:59:59,997 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12929#true} {12971#(<= ~counter~0 1)} #84#return; {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {12929#true} assume true; {12929#true} is VALID [2022-04-28 12:59:59,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {12929#true} assume !(0 == ~cond); {12929#true} is VALID [2022-04-28 12:59:59,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {12929#true} ~cond := #in~cond; {12929#true} is VALID [2022-04-28 12:59:59,997 INFO L272 TraceCheckUtils]: 19: Hoare triple {12971#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {12929#true} is VALID [2022-04-28 12:59:59,997 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12929#true} {12971#(<= ~counter~0 1)} #82#return; {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {12929#true} assume true; {12929#true} is VALID [2022-04-28 12:59:59,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {12929#true} assume !(0 == ~cond); {12929#true} is VALID [2022-04-28 12:59:59,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {12929#true} ~cond := #in~cond; {12929#true} is VALID [2022-04-28 12:59:59,998 INFO L272 TraceCheckUtils]: 14: Hoare triple {12971#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12929#true} is VALID [2022-04-28 12:59:59,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {12971#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {12937#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12971#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {12937#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {12937#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,999 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12929#true} {12937#(<= ~counter~0 0)} #80#return; {12937#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {12929#true} assume true; {12929#true} is VALID [2022-04-28 12:59:59,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {12929#true} assume !(0 == ~cond); {12929#true} is VALID [2022-04-28 12:59:59,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {12929#true} ~cond := #in~cond; {12929#true} is VALID [2022-04-28 12:59:59,999 INFO L272 TraceCheckUtils]: 6: Hoare triple {12937#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {12929#true} is VALID [2022-04-28 13:00:00,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {12937#(<= ~counter~0 0)} 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; {12937#(<= ~counter~0 0)} is VALID [2022-04-28 13:00:00,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {12937#(<= ~counter~0 0)} call #t~ret8 := main(); {12937#(<= ~counter~0 0)} is VALID [2022-04-28 13:00:00,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12937#(<= ~counter~0 0)} {12929#true} #96#return; {12937#(<= ~counter~0 0)} is VALID [2022-04-28 13:00:00,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {12937#(<= ~counter~0 0)} assume true; {12937#(<= ~counter~0 0)} is VALID [2022-04-28 13:00:00,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {12929#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);~counter~0 := 0; {12937#(<= ~counter~0 0)} is VALID [2022-04-28 13:00:00,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {12929#true} call ULTIMATE.init(); {12929#true} is VALID [2022-04-28 13:00:00,001 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 22 proven. 20 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 13:00:00,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:00:00,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545142033] [2022-04-28 13:00:00,002 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:00:00,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941641312] [2022-04-28 13:00:00,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941641312] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:00:00,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:00:00,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 13:00:00,002 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:00:00,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1343840236] [2022-04-28 13:00:00,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1343840236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:00:00,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:00:00,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 13:00:00,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114292903] [2022-04-28 13:00:00,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:00:00,003 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) Word has length 86 [2022-04-28 13:00:00,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:00:00,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 13:00:00,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:00:00,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 13:00:00,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:00:00,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 13:00:00,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 13:00:00,054 INFO L87 Difference]: Start difference. First operand 127 states and 147 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 13:00:00,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:00:00,590 INFO L93 Difference]: Finished difference Result 179 states and 206 transitions. [2022-04-28 13:00:00,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 13:00:00,590 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) Word has length 86 [2022-04-28 13:00:00,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:00:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 13:00:00,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2022-04-28 13:00:00,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 13:00:00,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2022-04-28 13:00:00,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 119 transitions. [2022-04-28 13:00:00,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:00:00,686 INFO L225 Difference]: With dead ends: 179 [2022-04-28 13:00:00,686 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 13:00:00,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 13:00:00,686 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 35 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:00:00,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 213 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:00:00,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 13:00:00,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2022-04-28 13:00:00,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:00:00,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 161 states, 105 states have (on average 1.1523809523809523) internal successors, (121), 109 states have internal predecessors, (121), 34 states have call successors, (34), 23 states have call predecessors, (34), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 13:00:00,850 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 161 states, 105 states have (on average 1.1523809523809523) internal successors, (121), 109 states have internal predecessors, (121), 34 states have call successors, (34), 23 states have call predecessors, (34), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 13:00:00,850 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 161 states, 105 states have (on average 1.1523809523809523) internal successors, (121), 109 states have internal predecessors, (121), 34 states have call successors, (34), 23 states have call predecessors, (34), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 13:00:00,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:00:00,852 INFO L93 Difference]: Finished difference Result 164 states and 188 transitions. [2022-04-28 13:00:00,852 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 188 transitions. [2022-04-28 13:00:00,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:00:00,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:00:00,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 105 states have (on average 1.1523809523809523) internal successors, (121), 109 states have internal predecessors, (121), 34 states have call successors, (34), 23 states have call predecessors, (34), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) Second operand 164 states. [2022-04-28 13:00:00,853 INFO L87 Difference]: Start difference. First operand has 161 states, 105 states have (on average 1.1523809523809523) internal successors, (121), 109 states have internal predecessors, (121), 34 states have call successors, (34), 23 states have call predecessors, (34), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) Second operand 164 states. [2022-04-28 13:00:00,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:00:00,855 INFO L93 Difference]: Finished difference Result 164 states and 188 transitions. [2022-04-28 13:00:00,855 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 188 transitions. [2022-04-28 13:00:00,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:00:00,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:00:00,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:00:00,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:00:00,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 105 states have (on average 1.1523809523809523) internal successors, (121), 109 states have internal predecessors, (121), 34 states have call successors, (34), 23 states have call predecessors, (34), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 13:00:00,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2022-04-28 13:00:00,858 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 86 [2022-04-28 13:00:00,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:00:00,858 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2022-04-28 13:00:00,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 13:00:00,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 161 states and 186 transitions. [2022-04-28 13:00:03,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 185 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 13:00:03,068 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2022-04-28 13:00:03,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 13:00:03,069 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:00:03,069 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 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, 1, 1, 1, 1, 1] [2022-04-28 13:00:03,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 13:00:03,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:00:03,269 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:00:03,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:00:03,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1068167297, now seen corresponding path program 5 times [2022-04-28 13:00:03,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:00:03,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [848971019] [2022-04-28 13:00:11,324 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:00:11,324 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:00:11,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1068167297, now seen corresponding path program 6 times [2022-04-28 13:00:11,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:00:11,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979479051] [2022-04-28 13:00:11,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:00:11,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:00:11,335 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:00:11,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [666566833] [2022-04-28 13:00:11,335 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:00:11,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:00:11,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:00:11,338 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:00:11,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 13:00:11,382 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 13:00:11,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:00:11,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 13:00:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:00:11,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:01:29,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {14462#true} call ULTIMATE.init(); {14462#true} is VALID [2022-04-28 13:01:29,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {14462#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);~counter~0 := 0; {14462#true} is VALID [2022-04-28 13:01:29,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:01:29,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14462#true} {14462#true} #96#return; {14462#true} is VALID [2022-04-28 13:01:29,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {14462#true} call #t~ret8 := main(); {14462#true} is VALID [2022-04-28 13:01:29,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {14462#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; {14462#true} is VALID [2022-04-28 13:01:29,527 INFO L272 TraceCheckUtils]: 6: Hoare triple {14462#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {14462#true} is VALID [2022-04-28 13:01:29,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {14462#true} ~cond := #in~cond; {14462#true} is VALID [2022-04-28 13:01:29,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {14462#true} assume !(0 == ~cond); {14462#true} is VALID [2022-04-28 13:01:29,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:01:29,527 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14462#true} {14462#true} #80#return; {14462#true} is VALID [2022-04-28 13:01:29,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {14462#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:01:29,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:01:29,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:01:29,546 INFO L272 TraceCheckUtils]: 14: Hoare triple {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {14462#true} is VALID [2022-04-28 13:01:29,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {14462#true} ~cond := #in~cond; {14462#true} is VALID [2022-04-28 13:01:29,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {14462#true} assume !(0 == ~cond); {14462#true} is VALID [2022-04-28 13:01:29,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:01:29,547 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14462#true} {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #82#return; {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:01:29,547 INFO L272 TraceCheckUtils]: 19: Hoare triple {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {14462#true} is VALID [2022-04-28 13:01:29,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {14462#true} ~cond := #in~cond; {14462#true} is VALID [2022-04-28 13:01:29,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {14462#true} assume !(0 == ~cond); {14462#true} is VALID [2022-04-28 13:01:29,547 INFO L290 TraceCheckUtils]: 22: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:01:29,547 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14462#true} {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #84#return; {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:01:29,547 INFO L272 TraceCheckUtils]: 24: Hoare triple {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {14462#true} is VALID [2022-04-28 13:01:29,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {14462#true} ~cond := #in~cond; {14462#true} is VALID [2022-04-28 13:01:29,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {14462#true} assume !(0 == ~cond); {14462#true} is VALID [2022-04-28 13:01:29,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:01:29,548 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {14462#true} {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #86#return; {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:01:29,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:01:29,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:01:29,549 INFO L290 TraceCheckUtils]: 31: Hoare triple {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:01:29,549 INFO L272 TraceCheckUtils]: 32: Hoare triple {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {14462#true} is VALID [2022-04-28 13:01:29,549 INFO L290 TraceCheckUtils]: 33: Hoare triple {14462#true} ~cond := #in~cond; {14462#true} is VALID [2022-04-28 13:01:29,549 INFO L290 TraceCheckUtils]: 34: Hoare triple {14462#true} assume !(0 == ~cond); {14462#true} is VALID [2022-04-28 13:01:29,549 INFO L290 TraceCheckUtils]: 35: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:01:29,550 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14462#true} {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #82#return; {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:01:29,550 INFO L272 TraceCheckUtils]: 37: Hoare triple {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {14462#true} is VALID [2022-04-28 13:01:29,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {14462#true} ~cond := #in~cond; {14462#true} is VALID [2022-04-28 13:01:29,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {14462#true} assume !(0 == ~cond); {14462#true} is VALID [2022-04-28 13:01:29,550 INFO L290 TraceCheckUtils]: 40: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:01:29,550 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14462#true} {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #84#return; {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:01:29,550 INFO L272 TraceCheckUtils]: 42: Hoare triple {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {14462#true} is VALID [2022-04-28 13:01:29,550 INFO L290 TraceCheckUtils]: 43: Hoare triple {14462#true} ~cond := #in~cond; {14462#true} is VALID [2022-04-28 13:01:29,550 INFO L290 TraceCheckUtils]: 44: Hoare triple {14462#true} assume !(0 == ~cond); {14462#true} is VALID [2022-04-28 13:01:29,550 INFO L290 TraceCheckUtils]: 45: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:01:29,551 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14462#true} {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #86#return; {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:01:29,552 INFO L290 TraceCheckUtils]: 47: Hoare triple {14500#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {14609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:01:29,552 INFO L290 TraceCheckUtils]: 48: Hoare triple {14609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:01:29,553 INFO L290 TraceCheckUtils]: 49: Hoare triple {14609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !!(#t~post6 < 5);havoc #t~post6; {14609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:01:29,553 INFO L272 TraceCheckUtils]: 50: Hoare triple {14609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {14462#true} is VALID [2022-04-28 13:01:29,553 INFO L290 TraceCheckUtils]: 51: Hoare triple {14462#true} ~cond := #in~cond; {14462#true} is VALID [2022-04-28 13:01:29,553 INFO L290 TraceCheckUtils]: 52: Hoare triple {14462#true} assume !(0 == ~cond); {14462#true} is VALID [2022-04-28 13:01:29,553 INFO L290 TraceCheckUtils]: 53: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:01:29,553 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {14462#true} {14609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #82#return; {14609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:01:29,553 INFO L272 TraceCheckUtils]: 55: Hoare triple {14609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {14462#true} is VALID [2022-04-28 13:01:29,553 INFO L290 TraceCheckUtils]: 56: Hoare triple {14462#true} ~cond := #in~cond; {14462#true} is VALID [2022-04-28 13:01:29,553 INFO L290 TraceCheckUtils]: 57: Hoare triple {14462#true} assume !(0 == ~cond); {14462#true} is VALID [2022-04-28 13:01:29,553 INFO L290 TraceCheckUtils]: 58: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:01:29,554 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14462#true} {14609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #84#return; {14609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:01:29,554 INFO L272 TraceCheckUtils]: 60: Hoare triple {14609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {14462#true} is VALID [2022-04-28 13:01:29,554 INFO L290 TraceCheckUtils]: 61: Hoare triple {14462#true} ~cond := #in~cond; {14652#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:01:29,554 INFO L290 TraceCheckUtils]: 62: Hoare triple {14652#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14656#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:01:29,555 INFO L290 TraceCheckUtils]: 63: Hoare triple {14656#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14656#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:01:29,555 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14656#(not (= |__VERIFIER_assert_#in~cond| 0))} {14609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #86#return; {14663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:01:29,557 INFO L290 TraceCheckUtils]: 65: Hoare triple {14663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {14663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:01:29,557 INFO L290 TraceCheckUtils]: 66: Hoare triple {14663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:01:29,558 INFO L290 TraceCheckUtils]: 67: Hoare triple {14663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !!(#t~post7 < 5);havoc #t~post7; {14663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:01:29,558 INFO L272 TraceCheckUtils]: 68: Hoare triple {14663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {14462#true} is VALID [2022-04-28 13:01:29,558 INFO L290 TraceCheckUtils]: 69: Hoare triple {14462#true} ~cond := #in~cond; {14462#true} is VALID [2022-04-28 13:01:29,558 INFO L290 TraceCheckUtils]: 70: Hoare triple {14462#true} assume !(0 == ~cond); {14462#true} is VALID [2022-04-28 13:01:29,558 INFO L290 TraceCheckUtils]: 71: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:01:29,559 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {14462#true} {14663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #88#return; {14663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:01:29,559 INFO L272 TraceCheckUtils]: 73: Hoare triple {14663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {14462#true} is VALID [2022-04-28 13:01:29,559 INFO L290 TraceCheckUtils]: 74: Hoare triple {14462#true} ~cond := #in~cond; {14462#true} is VALID [2022-04-28 13:01:29,559 INFO L290 TraceCheckUtils]: 75: Hoare triple {14462#true} assume !(0 == ~cond); {14462#true} is VALID [2022-04-28 13:01:29,559 INFO L290 TraceCheckUtils]: 76: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:01:29,559 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {14462#true} {14663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #90#return; {14663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:01:29,564 INFO L290 TraceCheckUtils]: 78: Hoare triple {14663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~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); {14706#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-28 13:01:29,567 INFO L290 TraceCheckUtils]: 79: Hoare triple {14706#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= main_~q~0 0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:01:29,568 INFO L290 TraceCheckUtils]: 80: Hoare triple {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:01:29,568 INFO L290 TraceCheckUtils]: 81: Hoare triple {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} assume !!(#t~post7 < 5);havoc #t~post7; {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:01:29,569 INFO L272 TraceCheckUtils]: 82: Hoare triple {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {14720#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:01:29,569 INFO L290 TraceCheckUtils]: 83: Hoare triple {14720#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14724#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:01:29,569 INFO L290 TraceCheckUtils]: 84: Hoare triple {14724#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14463#false} is VALID [2022-04-28 13:01:29,570 INFO L290 TraceCheckUtils]: 85: Hoare triple {14463#false} assume !false; {14463#false} is VALID [2022-04-28 13:01:29,570 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 57 proven. 10 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-28 13:01:29,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:02:31,912 WARN L232 SmtUtils]: Spent 30.56s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 13:03:42,544 INFO L290 TraceCheckUtils]: 85: Hoare triple {14463#false} assume !false; {14463#false} is VALID [2022-04-28 13:03:42,545 INFO L290 TraceCheckUtils]: 84: Hoare triple {14724#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14463#false} is VALID [2022-04-28 13:03:42,545 INFO L290 TraceCheckUtils]: 83: Hoare triple {14720#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14724#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:03:42,545 INFO L272 TraceCheckUtils]: 82: Hoare triple {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {14720#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:03:42,546 INFO L290 TraceCheckUtils]: 81: Hoare triple {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} assume !!(#t~post7 < 5);havoc #t~post7; {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:03:42,546 INFO L290 TraceCheckUtils]: 80: Hoare triple {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:03:42,548 INFO L290 TraceCheckUtils]: 79: Hoare triple {14749#(= (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) (+ (mod main_~A~0 4294967296) main_~d~0 (* (- 1) main_~r~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:03:42,559 INFO L290 TraceCheckUtils]: 78: Hoare triple {14753#(and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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); {14749#(= (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) (+ (mod main_~A~0 4294967296) main_~d~0 (* (- 1) main_~r~0)))} is VALID [2022-04-28 13:03:42,560 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {14462#true} {14753#(and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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)))))} #90#return; {14753#(and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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-28 13:03:42,560 INFO L290 TraceCheckUtils]: 76: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:03:42,560 INFO L290 TraceCheckUtils]: 75: Hoare triple {14462#true} assume !(0 == ~cond); {14462#true} is VALID [2022-04-28 13:03:42,560 INFO L290 TraceCheckUtils]: 74: Hoare triple {14462#true} ~cond := #in~cond; {14462#true} is VALID [2022-04-28 13:03:42,560 INFO L272 TraceCheckUtils]: 73: Hoare triple {14753#(and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {14462#true} is VALID [2022-04-28 13:03:42,560 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {14462#true} {14753#(and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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)))))} #88#return; {14753#(and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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-28 13:03:42,560 INFO L290 TraceCheckUtils]: 71: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:03:42,560 INFO L290 TraceCheckUtils]: 70: Hoare triple {14462#true} assume !(0 == ~cond); {14462#true} is VALID [2022-04-28 13:03:42,560 INFO L290 TraceCheckUtils]: 69: Hoare triple {14462#true} ~cond := #in~cond; {14462#true} is VALID [2022-04-28 13:03:42,561 INFO L272 TraceCheckUtils]: 68: Hoare triple {14753#(and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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)))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {14462#true} is VALID [2022-04-28 13:03:42,561 INFO L290 TraceCheckUtils]: 67: Hoare triple {14753#(and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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 !!(#t~post7 < 5);havoc #t~post7; {14753#(and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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-28 13:03:42,562 INFO L290 TraceCheckUtils]: 66: Hoare triple {14753#(and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14753#(and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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-28 13:03:42,563 INFO L290 TraceCheckUtils]: 65: Hoare triple {14753#(and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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 !(~r~0 >= ~d~0); {14753#(and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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-28 13:03:42,566 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14656#(not (= |__VERIFIER_assert_#in~cond| 0))} {14796#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))))))} #86#return; {14753#(and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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-28 13:03:42,566 INFO L290 TraceCheckUtils]: 63: Hoare triple {14656#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14656#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:03:42,566 INFO L290 TraceCheckUtils]: 62: Hoare triple {14806#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14656#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:03:42,567 INFO L290 TraceCheckUtils]: 61: Hoare triple {14462#true} ~cond := #in~cond; {14806#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:03:42,567 INFO L272 TraceCheckUtils]: 60: Hoare triple {14796#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div 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)); {14462#true} is VALID [2022-04-28 13:03:42,567 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14462#true} {14796#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))))))} #84#return; {14796#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))))))} is VALID [2022-04-28 13:03:42,567 INFO L290 TraceCheckUtils]: 58: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:03:42,568 INFO L290 TraceCheckUtils]: 57: Hoare triple {14462#true} assume !(0 == ~cond); {14462#true} is VALID [2022-04-28 13:03:42,568 INFO L290 TraceCheckUtils]: 56: Hoare triple {14462#true} ~cond := #in~cond; {14462#true} is VALID [2022-04-28 13:03:42,568 INFO L272 TraceCheckUtils]: 55: Hoare triple {14796#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {14462#true} is VALID [2022-04-28 13:03:42,568 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {14462#true} {14796#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))))))} #82#return; {14796#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))))))} is VALID [2022-04-28 13:03:42,568 INFO L290 TraceCheckUtils]: 53: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:03:42,568 INFO L290 TraceCheckUtils]: 52: Hoare triple {14462#true} assume !(0 == ~cond); {14462#true} is VALID [2022-04-28 13:03:42,568 INFO L290 TraceCheckUtils]: 51: Hoare triple {14462#true} ~cond := #in~cond; {14462#true} is VALID [2022-04-28 13:03:42,568 INFO L272 TraceCheckUtils]: 50: Hoare triple {14796#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {14462#true} is VALID [2022-04-28 13:03:42,577 INFO L290 TraceCheckUtils]: 49: Hoare triple {14796#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))))))} assume !!(#t~post6 < 5);havoc #t~post6; {14796#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))))))} is VALID [2022-04-28 13:03:42,579 INFO L290 TraceCheckUtils]: 48: Hoare triple {14796#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14796#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))))))} is VALID [2022-04-28 13:03:42,582 INFO L290 TraceCheckUtils]: 47: Hoare triple {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {14796#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ 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)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))))))} is VALID [2022-04-28 13:03:42,583 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14462#true} {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} #86#return; {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:03:42,583 INFO L290 TraceCheckUtils]: 45: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:03:42,583 INFO L290 TraceCheckUtils]: 44: Hoare triple {14462#true} assume !(0 == ~cond); {14462#true} is VALID [2022-04-28 13:03:42,583 INFO L290 TraceCheckUtils]: 43: Hoare triple {14462#true} ~cond := #in~cond; {14462#true} is VALID [2022-04-28 13:03:42,583 INFO L272 TraceCheckUtils]: 42: Hoare triple {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {14462#true} is VALID [2022-04-28 13:03:42,583 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14462#true} {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} #84#return; {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:03:42,583 INFO L290 TraceCheckUtils]: 40: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:03:42,584 INFO L290 TraceCheckUtils]: 39: Hoare triple {14462#true} assume !(0 == ~cond); {14462#true} is VALID [2022-04-28 13:03:42,584 INFO L290 TraceCheckUtils]: 38: Hoare triple {14462#true} ~cond := #in~cond; {14462#true} is VALID [2022-04-28 13:03:42,584 INFO L272 TraceCheckUtils]: 37: Hoare triple {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {14462#true} is VALID [2022-04-28 13:03:42,584 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14462#true} {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} #82#return; {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:03:42,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:03:42,584 INFO L290 TraceCheckUtils]: 34: Hoare triple {14462#true} assume !(0 == ~cond); {14462#true} is VALID [2022-04-28 13:03:42,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {14462#true} ~cond := #in~cond; {14462#true} is VALID [2022-04-28 13:03:42,584 INFO L272 TraceCheckUtils]: 32: Hoare triple {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {14462#true} is VALID [2022-04-28 13:03:42,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 5);havoc #t~post6; {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:03:42,585 INFO L290 TraceCheckUtils]: 30: Hoare triple {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:03:42,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:03:42,585 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {14462#true} {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} #86#return; {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:03:42,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:03:42,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {14462#true} assume !(0 == ~cond); {14462#true} is VALID [2022-04-28 13:03:42,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {14462#true} ~cond := #in~cond; {14462#true} is VALID [2022-04-28 13:03:42,586 INFO L272 TraceCheckUtils]: 24: Hoare triple {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {14462#true} is VALID [2022-04-28 13:03:42,586 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14462#true} {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} #84#return; {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:03:42,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:03:42,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {14462#true} assume !(0 == ~cond); {14462#true} is VALID [2022-04-28 13:03:42,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {14462#true} ~cond := #in~cond; {14462#true} is VALID [2022-04-28 13:03:42,586 INFO L272 TraceCheckUtils]: 19: Hoare triple {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {14462#true} is VALID [2022-04-28 13:03:42,587 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14462#true} {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} #82#return; {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:03:42,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:03:42,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {14462#true} assume !(0 == ~cond); {14462#true} is VALID [2022-04-28 13:03:42,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {14462#true} ~cond := #in~cond; {14462#true} is VALID [2022-04-28 13:03:42,587 INFO L272 TraceCheckUtils]: 14: Hoare triple {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {14462#true} is VALID [2022-04-28 13:03:42,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 5);havoc #t~post6; {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:03:42,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:03:42,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {14462#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {14710#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:03:42,588 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14462#true} {14462#true} #80#return; {14462#true} is VALID [2022-04-28 13:03:42,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:03:42,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {14462#true} assume !(0 == ~cond); {14462#true} is VALID [2022-04-28 13:03:42,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {14462#true} ~cond := #in~cond; {14462#true} is VALID [2022-04-28 13:03:42,588 INFO L272 TraceCheckUtils]: 6: Hoare triple {14462#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {14462#true} is VALID [2022-04-28 13:03:42,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {14462#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; {14462#true} is VALID [2022-04-28 13:03:42,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {14462#true} call #t~ret8 := main(); {14462#true} is VALID [2022-04-28 13:03:42,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14462#true} {14462#true} #96#return; {14462#true} is VALID [2022-04-28 13:03:42,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {14462#true} assume true; {14462#true} is VALID [2022-04-28 13:03:42,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {14462#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);~counter~0 := 0; {14462#true} is VALID [2022-04-28 13:03:42,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {14462#true} call ULTIMATE.init(); {14462#true} is VALID [2022-04-28 13:03:42,589 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 45 proven. 22 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-28 13:03:42,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:03:42,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979479051] [2022-04-28 13:03:42,589 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:03:42,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666566833] [2022-04-28 13:03:42,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666566833] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:03:42,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:03:42,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2022-04-28 13:03:42,589 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:03:42,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [848971019] [2022-04-28 13:03:42,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [848971019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:03:42,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:03:42,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 13:03:42,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128374390] [2022-04-28 13:03:42,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:03:42,590 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 86 [2022-04-28 13:03:42,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:03:42,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 13:03:42,651 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-28 13:03:42,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 13:03:42,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:03:42,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 13:03:42,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=163, Unknown=1, NotChecked=0, Total=210 [2022-04-28 13:03:42,652 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 13:03:49,468 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-28 13:03:55,383 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:03:58,467 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-28 13:04:00,478 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-28 13:04:02,794 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:04:03,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:04:03,107 INFO L93 Difference]: Finished difference Result 200 states and 235 transitions. [2022-04-28 13:04:03,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 13:04:03,108 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 86 [2022-04-28 13:04:03,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:04:03,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 13:04:03,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2022-04-28 13:04:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 13:04:03,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2022-04-28 13:04:03,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 109 transitions. [2022-04-28 13:04:03,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:04:03,257 INFO L225 Difference]: With dead ends: 200 [2022-04-28 13:04:03,257 INFO L226 Difference]: Without dead ends: 180 [2022-04-28 13:04:03,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 155 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 39.8s TimeCoverageRelationStatistics Valid=59, Invalid=212, Unknown=1, NotChecked=0, Total=272 [2022-04-28 13:04:03,257 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 40 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 37 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-04-28 13:04:03,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 191 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 280 Invalid, 3 Unknown, 0 Unchecked, 10.7s Time] [2022-04-28 13:04:03,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-28 13:04:03,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 173. [2022-04-28 13:04:03,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:04:03,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 173 states, 114 states have (on average 1.1666666666666667) internal successors, (133), 120 states have internal predecessors, (133), 36 states have call successors, (36), 23 states have call predecessors, (36), 22 states have return successors, (34), 29 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 13:04:03,423 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 173 states, 114 states have (on average 1.1666666666666667) internal successors, (133), 120 states have internal predecessors, (133), 36 states have call successors, (36), 23 states have call predecessors, (36), 22 states have return successors, (34), 29 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 13:04:03,424 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 173 states, 114 states have (on average 1.1666666666666667) internal successors, (133), 120 states have internal predecessors, (133), 36 states have call successors, (36), 23 states have call predecessors, (36), 22 states have return successors, (34), 29 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 13:04:03,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:04:03,426 INFO L93 Difference]: Finished difference Result 180 states and 213 transitions. [2022-04-28 13:04:03,426 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 213 transitions. [2022-04-28 13:04:03,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:04:03,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:04:03,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 114 states have (on average 1.1666666666666667) internal successors, (133), 120 states have internal predecessors, (133), 36 states have call successors, (36), 23 states have call predecessors, (36), 22 states have return successors, (34), 29 states have call predecessors, (34), 34 states have call successors, (34) Second operand 180 states. [2022-04-28 13:04:03,427 INFO L87 Difference]: Start difference. First operand has 173 states, 114 states have (on average 1.1666666666666667) internal successors, (133), 120 states have internal predecessors, (133), 36 states have call successors, (36), 23 states have call predecessors, (36), 22 states have return successors, (34), 29 states have call predecessors, (34), 34 states have call successors, (34) Second operand 180 states. [2022-04-28 13:04:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:04:03,429 INFO L93 Difference]: Finished difference Result 180 states and 213 transitions. [2022-04-28 13:04:03,429 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 213 transitions. [2022-04-28 13:04:03,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:04:03,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:04:03,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:04:03,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:04:03,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 114 states have (on average 1.1666666666666667) internal successors, (133), 120 states have internal predecessors, (133), 36 states have call successors, (36), 23 states have call predecessors, (36), 22 states have return successors, (34), 29 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 13:04:03,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 203 transitions. [2022-04-28 13:04:03,433 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 203 transitions. Word has length 86 [2022-04-28 13:04:03,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:04:03,433 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 203 transitions. [2022-04-28 13:04:03,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 13:04:03,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 173 states and 203 transitions. [2022-04-28 13:04:05,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 202 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 13:04:05,694 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 203 transitions. [2022-04-28 13:04:05,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 13:04:05,695 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:04:05,695 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 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, 1, 1, 1] [2022-04-28 13:04:05,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 13:04:05,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 13:04:05,908 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:04:05,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:04:05,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1271087930, now seen corresponding path program 7 times [2022-04-28 13:04:05,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:04:05,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1956165643] [2022-04-28 13:04:13,469 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:04:13,469 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:04:13,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1271087930, now seen corresponding path program 8 times [2022-04-28 13:04:13,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:04:13,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063645893] [2022-04-28 13:04:13,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:04:13,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:04:13,480 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:04:13,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1341300891] [2022-04-28 13:04:13,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:04:13,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:04:13,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:04:13,482 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:04:13,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 13:04:13,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:04:13,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:04:13,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 13:04:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:04:13,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:04:15,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {16102#true} call ULTIMATE.init(); {16102#true} is VALID [2022-04-28 13:04:15,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {16102#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);~counter~0 := 0; {16102#true} is VALID [2022-04-28 13:04:15,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:15,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16102#true} {16102#true} #96#return; {16102#true} is VALID [2022-04-28 13:04:15,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {16102#true} call #t~ret8 := main(); {16102#true} is VALID [2022-04-28 13:04:15,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {16102#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; {16102#true} is VALID [2022-04-28 13:04:15,160 INFO L272 TraceCheckUtils]: 6: Hoare triple {16102#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {16102#true} is VALID [2022-04-28 13:04:15,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {16102#true} ~cond := #in~cond; {16128#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 13:04:15,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {16128#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {16132#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 13:04:15,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {16132#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {16132#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 13:04:15,161 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16132#(not (= |assume_abort_if_not_#in~cond| 0))} {16102#true} #80#return; {16139#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-28 13:04:15,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {16139#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {16143#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 13:04:15,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {16143#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16143#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 13:04:15,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {16143#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {16143#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 13:04:15,163 INFO L272 TraceCheckUtils]: 14: Hoare triple {16143#(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)); {16102#true} is VALID [2022-04-28 13:04:15,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:15,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:15,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:15,163 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16102#true} {16143#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #82#return; {16143#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 13:04:15,163 INFO L272 TraceCheckUtils]: 19: Hoare triple {16143#(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)); {16102#true} is VALID [2022-04-28 13:04:15,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:15,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:15,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:15,164 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16102#true} {16143#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #84#return; {16143#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 13:04:15,164 INFO L272 TraceCheckUtils]: 24: Hoare triple {16143#(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)); {16102#true} is VALID [2022-04-28 13:04:15,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:15,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:15,164 INFO L290 TraceCheckUtils]: 27: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:15,165 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {16102#true} {16143#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #86#return; {16143#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 13:04:15,166 INFO L290 TraceCheckUtils]: 29: Hoare triple {16143#(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; {16198#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:04:15,166 INFO L290 TraceCheckUtils]: 30: Hoare triple {16198#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16198#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:04:15,167 INFO L290 TraceCheckUtils]: 31: Hoare triple {16198#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 5);havoc #t~post6; {16198#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:04:15,167 INFO L272 TraceCheckUtils]: 32: Hoare triple {16198#(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)); {16102#true} is VALID [2022-04-28 13:04:15,167 INFO L290 TraceCheckUtils]: 33: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:15,167 INFO L290 TraceCheckUtils]: 34: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:15,167 INFO L290 TraceCheckUtils]: 35: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:15,167 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16102#true} {16198#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #82#return; {16198#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:04:15,167 INFO L272 TraceCheckUtils]: 37: Hoare triple {16198#(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)); {16102#true} is VALID [2022-04-28 13:04:15,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:15,167 INFO L290 TraceCheckUtils]: 39: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:15,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:15,168 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16102#true} {16198#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #84#return; {16198#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:04:15,168 INFO L272 TraceCheckUtils]: 42: Hoare triple {16198#(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)); {16102#true} is VALID [2022-04-28 13:04:15,168 INFO L290 TraceCheckUtils]: 43: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:15,168 INFO L290 TraceCheckUtils]: 44: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:15,168 INFO L290 TraceCheckUtils]: 45: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:15,169 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16102#true} {16198#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #86#return; {16198#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:04:15,169 INFO L290 TraceCheckUtils]: 47: Hoare triple {16198#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16253#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-28 13:04:15,170 INFO L290 TraceCheckUtils]: 48: Hoare triple {16253#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16253#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-28 13:04:15,170 INFO L290 TraceCheckUtils]: 49: Hoare triple {16253#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} assume !!(#t~post6 < 5);havoc #t~post6; {16253#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-28 13:04:15,170 INFO L272 TraceCheckUtils]: 50: Hoare triple {16253#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16102#true} is VALID [2022-04-28 13:04:15,170 INFO L290 TraceCheckUtils]: 51: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:15,170 INFO L290 TraceCheckUtils]: 52: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:15,170 INFO L290 TraceCheckUtils]: 53: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:15,171 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16102#true} {16253#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} #82#return; {16253#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-28 13:04:15,171 INFO L272 TraceCheckUtils]: 55: Hoare triple {16253#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {16102#true} is VALID [2022-04-28 13:04:15,171 INFO L290 TraceCheckUtils]: 56: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:15,171 INFO L290 TraceCheckUtils]: 57: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:15,171 INFO L290 TraceCheckUtils]: 58: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:15,172 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16102#true} {16253#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} #84#return; {16253#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-28 13:04:15,172 INFO L272 TraceCheckUtils]: 60: Hoare triple {16253#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {16102#true} is VALID [2022-04-28 13:04:15,172 INFO L290 TraceCheckUtils]: 61: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:15,172 INFO L290 TraceCheckUtils]: 62: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:15,172 INFO L290 TraceCheckUtils]: 63: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:15,172 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16102#true} {16253#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} #86#return; {16253#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-28 13:04:15,173 INFO L290 TraceCheckUtils]: 65: Hoare triple {16253#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} assume !(~r~0 >= ~d~0); {16308#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-28 13:04:15,173 INFO L290 TraceCheckUtils]: 66: Hoare triple {16308#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16308#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-28 13:04:15,173 INFO L290 TraceCheckUtils]: 67: Hoare triple {16308#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} assume !!(#t~post7 < 5);havoc #t~post7; {16308#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-28 13:04:15,173 INFO L272 TraceCheckUtils]: 68: Hoare triple {16308#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {16102#true} is VALID [2022-04-28 13:04:15,174 INFO L290 TraceCheckUtils]: 69: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:15,174 INFO L290 TraceCheckUtils]: 70: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:15,174 INFO L290 TraceCheckUtils]: 71: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:15,174 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {16102#true} {16308#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} #88#return; {16308#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-28 13:04:15,174 INFO L272 TraceCheckUtils]: 73: Hoare triple {16308#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {16102#true} is VALID [2022-04-28 13:04:15,174 INFO L290 TraceCheckUtils]: 74: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:15,174 INFO L290 TraceCheckUtils]: 75: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:15,174 INFO L290 TraceCheckUtils]: 76: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:15,175 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {16102#true} {16308#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} #90#return; {16308#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-28 13:04:15,176 INFO L290 TraceCheckUtils]: 78: Hoare triple {16308#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~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); {16198#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:04:15,176 INFO L290 TraceCheckUtils]: 79: Hoare triple {16198#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {16198#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:04:15,177 INFO L290 TraceCheckUtils]: 80: Hoare triple {16198#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16198#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:04:15,177 INFO L290 TraceCheckUtils]: 81: Hoare triple {16198#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} assume !!(#t~post7 < 5);havoc #t~post7; {16198#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:04:15,177 INFO L272 TraceCheckUtils]: 82: Hoare triple {16198#(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)); {16102#true} is VALID [2022-04-28 13:04:15,177 INFO L290 TraceCheckUtils]: 83: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:15,177 INFO L290 TraceCheckUtils]: 84: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:15,177 INFO L290 TraceCheckUtils]: 85: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:15,178 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16102#true} {16198#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #88#return; {16198#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:04:15,178 INFO L272 TraceCheckUtils]: 87: Hoare triple {16198#(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)); {16375#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:04:15,179 INFO L290 TraceCheckUtils]: 88: Hoare triple {16375#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16379#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:04:15,179 INFO L290 TraceCheckUtils]: 89: Hoare triple {16379#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16103#false} is VALID [2022-04-28 13:04:15,179 INFO L290 TraceCheckUtils]: 90: Hoare triple {16103#false} assume !false; {16103#false} is VALID [2022-04-28 13:04:15,179 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 24 proven. 22 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 13:04:15,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:04:19,153 INFO L290 TraceCheckUtils]: 90: Hoare triple {16103#false} assume !false; {16103#false} is VALID [2022-04-28 13:04:19,153 INFO L290 TraceCheckUtils]: 89: Hoare triple {16379#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16103#false} is VALID [2022-04-28 13:04:19,153 INFO L290 TraceCheckUtils]: 88: Hoare triple {16375#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16379#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:04:19,154 INFO L272 TraceCheckUtils]: 87: Hoare triple {16395#(= 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)); {16375#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:04:19,154 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16102#true} {16395#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #88#return; {16395#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:04:19,155 INFO L290 TraceCheckUtils]: 85: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:19,155 INFO L290 TraceCheckUtils]: 84: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:19,155 INFO L290 TraceCheckUtils]: 83: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:19,155 INFO L272 TraceCheckUtils]: 82: Hoare triple {16395#(= 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)); {16102#true} is VALID [2022-04-28 13:04:19,155 INFO L290 TraceCheckUtils]: 81: Hoare triple {16395#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(#t~post7 < 5);havoc #t~post7; {16395#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:04:19,155 INFO L290 TraceCheckUtils]: 80: Hoare triple {16395#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16395#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:04:19,155 INFO L290 TraceCheckUtils]: 79: Hoare triple {16395#(= 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; {16395#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:04:19,167 INFO L290 TraceCheckUtils]: 78: Hoare triple {16423#(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); {16395#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:04:19,167 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {16102#true} {16423#(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)))))} #90#return; {16423#(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-28 13:04:19,167 INFO L290 TraceCheckUtils]: 76: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:19,167 INFO L290 TraceCheckUtils]: 75: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:19,167 INFO L290 TraceCheckUtils]: 74: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:19,167 INFO L272 TraceCheckUtils]: 73: Hoare triple {16423#(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)); {16102#true} is VALID [2022-04-28 13:04:19,168 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {16102#true} {16423#(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; {16423#(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-28 13:04:19,168 INFO L290 TraceCheckUtils]: 71: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:19,168 INFO L290 TraceCheckUtils]: 70: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:19,168 INFO L290 TraceCheckUtils]: 69: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:19,168 INFO L272 TraceCheckUtils]: 68: Hoare triple {16423#(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)); {16102#true} is VALID [2022-04-28 13:04:19,169 INFO L290 TraceCheckUtils]: 67: Hoare triple {16423#(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 !!(#t~post7 < 5);havoc #t~post7; {16423#(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-28 13:04:19,170 INFO L290 TraceCheckUtils]: 66: Hoare triple {16423#(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)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16423#(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-28 13:04:19,171 INFO L290 TraceCheckUtils]: 65: Hoare triple {16463#(or (<= main_~d~0 main_~r~0) (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); {16423#(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-28 13:04:19,171 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16102#true} {16463#(or (<= main_~d~0 main_~r~0) (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; {16463#(or (<= main_~d~0 main_~r~0) (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-28 13:04:19,171 INFO L290 TraceCheckUtils]: 63: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:19,171 INFO L290 TraceCheckUtils]: 62: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:19,172 INFO L290 TraceCheckUtils]: 61: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:19,172 INFO L272 TraceCheckUtils]: 60: Hoare triple {16463#(or (<= main_~d~0 main_~r~0) (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)); {16102#true} is VALID [2022-04-28 13:04:19,172 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16102#true} {16463#(or (<= main_~d~0 main_~r~0) (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))))))} #84#return; {16463#(or (<= main_~d~0 main_~r~0) (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-28 13:04:19,172 INFO L290 TraceCheckUtils]: 58: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:19,172 INFO L290 TraceCheckUtils]: 57: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:19,172 INFO L290 TraceCheckUtils]: 56: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:19,172 INFO L272 TraceCheckUtils]: 55: Hoare triple {16463#(or (<= main_~d~0 main_~r~0) (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 ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {16102#true} is VALID [2022-04-28 13:04:19,173 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16102#true} {16463#(or (<= main_~d~0 main_~r~0) (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))))))} #82#return; {16463#(or (<= main_~d~0 main_~r~0) (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-28 13:04:19,173 INFO L290 TraceCheckUtils]: 53: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:19,173 INFO L290 TraceCheckUtils]: 52: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:19,173 INFO L290 TraceCheckUtils]: 51: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:19,173 INFO L272 TraceCheckUtils]: 50: Hoare triple {16463#(or (<= main_~d~0 main_~r~0) (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 0 == ~q~0 then 1 else 0)); {16102#true} is VALID [2022-04-28 13:04:19,174 INFO L290 TraceCheckUtils]: 49: Hoare triple {16463#(or (<= main_~d~0 main_~r~0) (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 !!(#t~post6 < 5);havoc #t~post6; {16463#(or (<= main_~d~0 main_~r~0) (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-28 13:04:19,175 INFO L290 TraceCheckUtils]: 48: Hoare triple {16463#(or (<= main_~d~0 main_~r~0) (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))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16463#(or (<= main_~d~0 main_~r~0) (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-28 13:04:19,178 INFO L290 TraceCheckUtils]: 47: Hoare triple {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16463#(or (<= main_~d~0 main_~r~0) (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-28 13:04:19,179 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16102#true} {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #86#return; {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-28 13:04:19,179 INFO L290 TraceCheckUtils]: 45: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:19,179 INFO L290 TraceCheckUtils]: 44: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:19,179 INFO L290 TraceCheckUtils]: 43: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:19,179 INFO L272 TraceCheckUtils]: 42: Hoare triple {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {16102#true} is VALID [2022-04-28 13:04:19,179 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16102#true} {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #84#return; {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-28 13:04:19,179 INFO L290 TraceCheckUtils]: 40: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:19,179 INFO L290 TraceCheckUtils]: 39: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:19,179 INFO L290 TraceCheckUtils]: 38: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:19,179 INFO L272 TraceCheckUtils]: 37: Hoare triple {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {16102#true} is VALID [2022-04-28 13:04:19,180 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16102#true} {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #82#return; {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-28 13:04:19,180 INFO L290 TraceCheckUtils]: 35: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:19,180 INFO L290 TraceCheckUtils]: 34: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:19,180 INFO L290 TraceCheckUtils]: 33: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:19,180 INFO L272 TraceCheckUtils]: 32: Hoare triple {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16102#true} is VALID [2022-04-28 13:04:19,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} assume !!(#t~post6 < 5);havoc #t~post6; {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-28 13:04:19,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-28 13:04:19,182 INFO L290 TraceCheckUtils]: 29: Hoare triple {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-28 13:04:19,182 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {16102#true} {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #86#return; {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-28 13:04:19,183 INFO L290 TraceCheckUtils]: 27: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:19,183 INFO L290 TraceCheckUtils]: 26: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:19,183 INFO L290 TraceCheckUtils]: 25: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:19,183 INFO L272 TraceCheckUtils]: 24: Hoare triple {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {16102#true} is VALID [2022-04-28 13:04:19,183 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16102#true} {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #84#return; {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-28 13:04:19,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:19,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:19,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:19,183 INFO L272 TraceCheckUtils]: 19: Hoare triple {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {16102#true} is VALID [2022-04-28 13:04:19,184 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16102#true} {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #82#return; {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-28 13:04:19,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:19,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:19,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:19,184 INFO L272 TraceCheckUtils]: 14: Hoare triple {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16102#true} is VALID [2022-04-28 13:04:19,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} assume !!(#t~post6 < 5);havoc #t~post6; {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-28 13:04:19,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-28 13:04:19,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {16102#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {16518#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-28 13:04:19,185 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16102#true} {16102#true} #80#return; {16102#true} is VALID [2022-04-28 13:04:19,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:19,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {16102#true} assume !(0 == ~cond); {16102#true} is VALID [2022-04-28 13:04:19,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {16102#true} ~cond := #in~cond; {16102#true} is VALID [2022-04-28 13:04:19,186 INFO L272 TraceCheckUtils]: 6: Hoare triple {16102#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {16102#true} is VALID [2022-04-28 13:04:19,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {16102#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; {16102#true} is VALID [2022-04-28 13:04:19,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {16102#true} call #t~ret8 := main(); {16102#true} is VALID [2022-04-28 13:04:19,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16102#true} {16102#true} #96#return; {16102#true} is VALID [2022-04-28 13:04:19,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {16102#true} assume true; {16102#true} is VALID [2022-04-28 13:04:19,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {16102#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);~counter~0 := 0; {16102#true} is VALID [2022-04-28 13:04:19,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {16102#true} call ULTIMATE.init(); {16102#true} is VALID [2022-04-28 13:04:19,186 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2022-04-28 13:04:19,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:04:19,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063645893] [2022-04-28 13:04:19,187 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:04:19,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341300891] [2022-04-28 13:04:19,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341300891] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:04:19,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:04:19,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2022-04-28 13:04:19,187 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:04:19,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1956165643] [2022-04-28 13:04:19,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1956165643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:04:19,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:04:19,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 13:04:19,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379411173] [2022-04-28 13:04:19,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:04:19,188 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 91 [2022-04-28 13:04:19,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:04:19,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 13:04:19,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:04:19,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 13:04:19,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:04:19,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 13:04:19,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-04-28 13:04:19,246 INFO L87 Difference]: Start difference. First operand 173 states and 203 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 13:04:21,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:04:21,266 INFO L93 Difference]: Finished difference Result 257 states and 325 transitions. [2022-04-28 13:04:21,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 13:04:21,266 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 91 [2022-04-28 13:04:21,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:04:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 13:04:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2022-04-28 13:04:21,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 13:04:21,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2022-04-28 13:04:21,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 124 transitions. [2022-04-28 13:04:21,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:04:21,390 INFO L225 Difference]: With dead ends: 257 [2022-04-28 13:04:21,390 INFO L226 Difference]: Without dead ends: 205 [2022-04-28 13:04:21,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 165 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-04-28 13:04:21,391 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 42 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 13:04:21,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 359 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 13:04:21,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-04-28 13:04:21,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-04-28 13:04:21,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:04:21,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 205 states, 134 states have (on average 1.171641791044776) internal successors, (157), 143 states have internal predecessors, (157), 45 states have call successors, (45), 26 states have call predecessors, (45), 25 states have return successors, (41), 35 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 13:04:21,595 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 205 states, 134 states have (on average 1.171641791044776) internal successors, (157), 143 states have internal predecessors, (157), 45 states have call successors, (45), 26 states have call predecessors, (45), 25 states have return successors, (41), 35 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 13:04:21,595 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 205 states, 134 states have (on average 1.171641791044776) internal successors, (157), 143 states have internal predecessors, (157), 45 states have call successors, (45), 26 states have call predecessors, (45), 25 states have return successors, (41), 35 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 13:04:21,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:04:21,598 INFO L93 Difference]: Finished difference Result 205 states and 243 transitions. [2022-04-28 13:04:21,598 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 243 transitions. [2022-04-28 13:04:21,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:04:21,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:04:21,599 INFO L74 IsIncluded]: Start isIncluded. First operand has 205 states, 134 states have (on average 1.171641791044776) internal successors, (157), 143 states have internal predecessors, (157), 45 states have call successors, (45), 26 states have call predecessors, (45), 25 states have return successors, (41), 35 states have call predecessors, (41), 41 states have call successors, (41) Second operand 205 states. [2022-04-28 13:04:21,599 INFO L87 Difference]: Start difference. First operand has 205 states, 134 states have (on average 1.171641791044776) internal successors, (157), 143 states have internal predecessors, (157), 45 states have call successors, (45), 26 states have call predecessors, (45), 25 states have return successors, (41), 35 states have call predecessors, (41), 41 states have call successors, (41) Second operand 205 states. [2022-04-28 13:04:21,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:04:21,602 INFO L93 Difference]: Finished difference Result 205 states and 243 transitions. [2022-04-28 13:04:21,602 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 243 transitions. [2022-04-28 13:04:21,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:04:21,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:04:21,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:04:21,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:04:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 134 states have (on average 1.171641791044776) internal successors, (157), 143 states have internal predecessors, (157), 45 states have call successors, (45), 26 states have call predecessors, (45), 25 states have return successors, (41), 35 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 13:04:21,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 243 transitions. [2022-04-28 13:04:21,606 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 243 transitions. Word has length 91 [2022-04-28 13:04:21,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:04:21,606 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 243 transitions. [2022-04-28 13:04:21,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 13:04:21,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 205 states and 243 transitions. [2022-04-28 13:04:23,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 242 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 13:04:23,941 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 243 transitions. [2022-04-28 13:04:23,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-28 13:04:23,942 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:04:23,942 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:04:23,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 13:04:24,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:04:24,143 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:04:24,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:04:24,144 INFO L85 PathProgramCache]: Analyzing trace with hash 114996177, now seen corresponding path program 7 times [2022-04-28 13:04:24,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:04:24,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [810321965] [2022-04-28 13:04:31,339 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:04:31,340 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:04:31,340 INFO L85 PathProgramCache]: Analyzing trace with hash 114996177, now seen corresponding path program 8 times [2022-04-28 13:04:31,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:04:31,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403419265] [2022-04-28 13:04:31,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:04:31,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:04:31,348 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:04:31,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1450426907] [2022-04-28 13:04:31,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:04:31,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:04:31,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:04:31,349 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:04:31,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 13:04:31,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:04:31,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:04:31,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 13:04:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:04:31,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:04:31,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {18000#true} call ULTIMATE.init(); {18000#true} is VALID [2022-04-28 13:04:31,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {18000#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);~counter~0 := 0; {18008#(<= ~counter~0 0)} is VALID [2022-04-28 13:04:31,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {18008#(<= ~counter~0 0)} assume true; {18008#(<= ~counter~0 0)} is VALID [2022-04-28 13:04:31,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18008#(<= ~counter~0 0)} {18000#true} #96#return; {18008#(<= ~counter~0 0)} is VALID [2022-04-28 13:04:31,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {18008#(<= ~counter~0 0)} call #t~ret8 := main(); {18008#(<= ~counter~0 0)} is VALID [2022-04-28 13:04:31,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {18008#(<= ~counter~0 0)} 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; {18008#(<= ~counter~0 0)} is VALID [2022-04-28 13:04:31,810 INFO L272 TraceCheckUtils]: 6: Hoare triple {18008#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {18008#(<= ~counter~0 0)} is VALID [2022-04-28 13:04:31,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {18008#(<= ~counter~0 0)} ~cond := #in~cond; {18008#(<= ~counter~0 0)} is VALID [2022-04-28 13:04:31,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {18008#(<= ~counter~0 0)} assume !(0 == ~cond); {18008#(<= ~counter~0 0)} is VALID [2022-04-28 13:04:31,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {18008#(<= ~counter~0 0)} assume true; {18008#(<= ~counter~0 0)} is VALID [2022-04-28 13:04:31,811 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18008#(<= ~counter~0 0)} {18008#(<= ~counter~0 0)} #80#return; {18008#(<= ~counter~0 0)} is VALID [2022-04-28 13:04:31,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {18008#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {18008#(<= ~counter~0 0)} is VALID [2022-04-28 13:04:31,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {18008#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:31,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {18042#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:31,813 INFO L272 TraceCheckUtils]: 14: Hoare triple {18042#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:31,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {18042#(<= ~counter~0 1)} ~cond := #in~cond; {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:31,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {18042#(<= ~counter~0 1)} assume !(0 == ~cond); {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:31,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {18042#(<= ~counter~0 1)} assume true; {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:31,814 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18042#(<= ~counter~0 1)} {18042#(<= ~counter~0 1)} #82#return; {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:31,815 INFO L272 TraceCheckUtils]: 19: Hoare triple {18042#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:31,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {18042#(<= ~counter~0 1)} ~cond := #in~cond; {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:31,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {18042#(<= ~counter~0 1)} assume !(0 == ~cond); {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:31,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {18042#(<= ~counter~0 1)} assume true; {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:31,816 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18042#(<= ~counter~0 1)} {18042#(<= ~counter~0 1)} #84#return; {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:31,816 INFO L272 TraceCheckUtils]: 24: Hoare triple {18042#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:31,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {18042#(<= ~counter~0 1)} ~cond := #in~cond; {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:31,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {18042#(<= ~counter~0 1)} assume !(0 == ~cond); {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:31,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {18042#(<= ~counter~0 1)} assume true; {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:31,818 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {18042#(<= ~counter~0 1)} {18042#(<= ~counter~0 1)} #86#return; {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:31,818 INFO L290 TraceCheckUtils]: 29: Hoare triple {18042#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:31,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {18042#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:31,819 INFO L290 TraceCheckUtils]: 31: Hoare triple {18097#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:31,819 INFO L272 TraceCheckUtils]: 32: Hoare triple {18097#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:31,819 INFO L290 TraceCheckUtils]: 33: Hoare triple {18097#(<= ~counter~0 2)} ~cond := #in~cond; {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:31,820 INFO L290 TraceCheckUtils]: 34: Hoare triple {18097#(<= ~counter~0 2)} assume !(0 == ~cond); {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:31,820 INFO L290 TraceCheckUtils]: 35: Hoare triple {18097#(<= ~counter~0 2)} assume true; {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:31,820 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18097#(<= ~counter~0 2)} {18097#(<= ~counter~0 2)} #82#return; {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:31,821 INFO L272 TraceCheckUtils]: 37: Hoare triple {18097#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:31,821 INFO L290 TraceCheckUtils]: 38: Hoare triple {18097#(<= ~counter~0 2)} ~cond := #in~cond; {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:31,821 INFO L290 TraceCheckUtils]: 39: Hoare triple {18097#(<= ~counter~0 2)} assume !(0 == ~cond); {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:31,821 INFO L290 TraceCheckUtils]: 40: Hoare triple {18097#(<= ~counter~0 2)} assume true; {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:31,822 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18097#(<= ~counter~0 2)} {18097#(<= ~counter~0 2)} #84#return; {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:31,822 INFO L272 TraceCheckUtils]: 42: Hoare triple {18097#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:31,823 INFO L290 TraceCheckUtils]: 43: Hoare triple {18097#(<= ~counter~0 2)} ~cond := #in~cond; {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:31,823 INFO L290 TraceCheckUtils]: 44: Hoare triple {18097#(<= ~counter~0 2)} assume !(0 == ~cond); {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:31,823 INFO L290 TraceCheckUtils]: 45: Hoare triple {18097#(<= ~counter~0 2)} assume true; {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:31,824 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {18097#(<= ~counter~0 2)} {18097#(<= ~counter~0 2)} #86#return; {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:31,824 INFO L290 TraceCheckUtils]: 47: Hoare triple {18097#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:31,824 INFO L290 TraceCheckUtils]: 48: Hoare triple {18097#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:31,825 INFO L290 TraceCheckUtils]: 49: Hoare triple {18152#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:31,825 INFO L272 TraceCheckUtils]: 50: Hoare triple {18152#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:31,825 INFO L290 TraceCheckUtils]: 51: Hoare triple {18152#(<= ~counter~0 3)} ~cond := #in~cond; {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:31,825 INFO L290 TraceCheckUtils]: 52: Hoare triple {18152#(<= ~counter~0 3)} assume !(0 == ~cond); {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:31,826 INFO L290 TraceCheckUtils]: 53: Hoare triple {18152#(<= ~counter~0 3)} assume true; {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:31,826 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {18152#(<= ~counter~0 3)} {18152#(<= ~counter~0 3)} #82#return; {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:31,827 INFO L272 TraceCheckUtils]: 55: Hoare triple {18152#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:31,827 INFO L290 TraceCheckUtils]: 56: Hoare triple {18152#(<= ~counter~0 3)} ~cond := #in~cond; {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:31,827 INFO L290 TraceCheckUtils]: 57: Hoare triple {18152#(<= ~counter~0 3)} assume !(0 == ~cond); {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:31,827 INFO L290 TraceCheckUtils]: 58: Hoare triple {18152#(<= ~counter~0 3)} assume true; {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:31,828 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18152#(<= ~counter~0 3)} {18152#(<= ~counter~0 3)} #84#return; {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:31,828 INFO L272 TraceCheckUtils]: 60: Hoare triple {18152#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:31,829 INFO L290 TraceCheckUtils]: 61: Hoare triple {18152#(<= ~counter~0 3)} ~cond := #in~cond; {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:31,829 INFO L290 TraceCheckUtils]: 62: Hoare triple {18152#(<= ~counter~0 3)} assume !(0 == ~cond); {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:31,829 INFO L290 TraceCheckUtils]: 63: Hoare triple {18152#(<= ~counter~0 3)} assume true; {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:31,830 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18152#(<= ~counter~0 3)} {18152#(<= ~counter~0 3)} #86#return; {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:31,830 INFO L290 TraceCheckUtils]: 65: Hoare triple {18152#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:31,830 INFO L290 TraceCheckUtils]: 66: Hoare triple {18152#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:31,831 INFO L290 TraceCheckUtils]: 67: Hoare triple {18207#(<= ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:31,831 INFO L272 TraceCheckUtils]: 68: Hoare triple {18207#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:31,831 INFO L290 TraceCheckUtils]: 69: Hoare triple {18207#(<= ~counter~0 4)} ~cond := #in~cond; {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:31,832 INFO L290 TraceCheckUtils]: 70: Hoare triple {18207#(<= ~counter~0 4)} assume !(0 == ~cond); {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:31,832 INFO L290 TraceCheckUtils]: 71: Hoare triple {18207#(<= ~counter~0 4)} assume true; {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:31,832 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {18207#(<= ~counter~0 4)} {18207#(<= ~counter~0 4)} #82#return; {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:31,833 INFO L272 TraceCheckUtils]: 73: Hoare triple {18207#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:31,833 INFO L290 TraceCheckUtils]: 74: Hoare triple {18207#(<= ~counter~0 4)} ~cond := #in~cond; {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:31,833 INFO L290 TraceCheckUtils]: 75: Hoare triple {18207#(<= ~counter~0 4)} assume !(0 == ~cond); {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:31,833 INFO L290 TraceCheckUtils]: 76: Hoare triple {18207#(<= ~counter~0 4)} assume true; {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:31,834 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {18207#(<= ~counter~0 4)} {18207#(<= ~counter~0 4)} #84#return; {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:31,834 INFO L272 TraceCheckUtils]: 78: Hoare triple {18207#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:31,835 INFO L290 TraceCheckUtils]: 79: Hoare triple {18207#(<= ~counter~0 4)} ~cond := #in~cond; {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:31,835 INFO L290 TraceCheckUtils]: 80: Hoare triple {18207#(<= ~counter~0 4)} assume !(0 == ~cond); {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:31,835 INFO L290 TraceCheckUtils]: 81: Hoare triple {18207#(<= ~counter~0 4)} assume true; {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:31,836 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {18207#(<= ~counter~0 4)} {18207#(<= ~counter~0 4)} #86#return; {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:31,836 INFO L290 TraceCheckUtils]: 83: Hoare triple {18207#(<= ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:31,836 INFO L290 TraceCheckUtils]: 84: Hoare triple {18207#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18262#(<= |main_#t~post6| 4)} is VALID [2022-04-28 13:04:31,837 INFO L290 TraceCheckUtils]: 85: Hoare triple {18262#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {18001#false} is VALID [2022-04-28 13:04:31,837 INFO L290 TraceCheckUtils]: 86: Hoare triple {18001#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18001#false} is VALID [2022-04-28 13:04:31,837 INFO L290 TraceCheckUtils]: 87: Hoare triple {18001#false} assume !(#t~post7 < 5);havoc #t~post7; {18001#false} is VALID [2022-04-28 13:04:31,837 INFO L272 TraceCheckUtils]: 88: Hoare triple {18001#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {18001#false} is VALID [2022-04-28 13:04:31,837 INFO L290 TraceCheckUtils]: 89: Hoare triple {18001#false} ~cond := #in~cond; {18001#false} is VALID [2022-04-28 13:04:31,837 INFO L290 TraceCheckUtils]: 90: Hoare triple {18001#false} assume !(0 == ~cond); {18001#false} is VALID [2022-04-28 13:04:31,837 INFO L290 TraceCheckUtils]: 91: Hoare triple {18001#false} assume true; {18001#false} is VALID [2022-04-28 13:04:31,837 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {18001#false} {18001#false} #92#return; {18001#false} is VALID [2022-04-28 13:04:31,837 INFO L272 TraceCheckUtils]: 93: Hoare triple {18001#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {18001#false} is VALID [2022-04-28 13:04:31,837 INFO L290 TraceCheckUtils]: 94: Hoare triple {18001#false} ~cond := #in~cond; {18001#false} is VALID [2022-04-28 13:04:31,837 INFO L290 TraceCheckUtils]: 95: Hoare triple {18001#false} assume 0 == ~cond; {18001#false} is VALID [2022-04-28 13:04:31,837 INFO L290 TraceCheckUtils]: 96: Hoare triple {18001#false} assume !false; {18001#false} is VALID [2022-04-28 13:04:31,837 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 72 proven. 260 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-04-28 13:04:31,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:04:32,163 INFO L290 TraceCheckUtils]: 96: Hoare triple {18001#false} assume !false; {18001#false} is VALID [2022-04-28 13:04:32,163 INFO L290 TraceCheckUtils]: 95: Hoare triple {18001#false} assume 0 == ~cond; {18001#false} is VALID [2022-04-28 13:04:32,163 INFO L290 TraceCheckUtils]: 94: Hoare triple {18001#false} ~cond := #in~cond; {18001#false} is VALID [2022-04-28 13:04:32,163 INFO L272 TraceCheckUtils]: 93: Hoare triple {18001#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {18001#false} is VALID [2022-04-28 13:04:32,164 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {18000#true} {18001#false} #92#return; {18001#false} is VALID [2022-04-28 13:04:32,164 INFO L290 TraceCheckUtils]: 91: Hoare triple {18000#true} assume true; {18000#true} is VALID [2022-04-28 13:04:32,164 INFO L290 TraceCheckUtils]: 90: Hoare triple {18000#true} assume !(0 == ~cond); {18000#true} is VALID [2022-04-28 13:04:32,164 INFO L290 TraceCheckUtils]: 89: Hoare triple {18000#true} ~cond := #in~cond; {18000#true} is VALID [2022-04-28 13:04:32,164 INFO L272 TraceCheckUtils]: 88: Hoare triple {18001#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {18000#true} is VALID [2022-04-28 13:04:32,164 INFO L290 TraceCheckUtils]: 87: Hoare triple {18001#false} assume !(#t~post7 < 5);havoc #t~post7; {18001#false} is VALID [2022-04-28 13:04:32,164 INFO L290 TraceCheckUtils]: 86: Hoare triple {18001#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18001#false} is VALID [2022-04-28 13:04:32,164 INFO L290 TraceCheckUtils]: 85: Hoare triple {18262#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {18001#false} is VALID [2022-04-28 13:04:32,165 INFO L290 TraceCheckUtils]: 84: Hoare triple {18207#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18262#(<= |main_#t~post6| 4)} is VALID [2022-04-28 13:04:32,165 INFO L290 TraceCheckUtils]: 83: Hoare triple {18207#(<= ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:32,165 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {18000#true} {18207#(<= ~counter~0 4)} #86#return; {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:32,165 INFO L290 TraceCheckUtils]: 81: Hoare triple {18000#true} assume true; {18000#true} is VALID [2022-04-28 13:04:32,165 INFO L290 TraceCheckUtils]: 80: Hoare triple {18000#true} assume !(0 == ~cond); {18000#true} is VALID [2022-04-28 13:04:32,166 INFO L290 TraceCheckUtils]: 79: Hoare triple {18000#true} ~cond := #in~cond; {18000#true} is VALID [2022-04-28 13:04:32,166 INFO L272 TraceCheckUtils]: 78: Hoare triple {18207#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {18000#true} is VALID [2022-04-28 13:04:32,166 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {18000#true} {18207#(<= ~counter~0 4)} #84#return; {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:32,166 INFO L290 TraceCheckUtils]: 76: Hoare triple {18000#true} assume true; {18000#true} is VALID [2022-04-28 13:04:32,166 INFO L290 TraceCheckUtils]: 75: Hoare triple {18000#true} assume !(0 == ~cond); {18000#true} is VALID [2022-04-28 13:04:32,166 INFO L290 TraceCheckUtils]: 74: Hoare triple {18000#true} ~cond := #in~cond; {18000#true} is VALID [2022-04-28 13:04:32,166 INFO L272 TraceCheckUtils]: 73: Hoare triple {18207#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {18000#true} is VALID [2022-04-28 13:04:32,167 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {18000#true} {18207#(<= ~counter~0 4)} #82#return; {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:32,167 INFO L290 TraceCheckUtils]: 71: Hoare triple {18000#true} assume true; {18000#true} is VALID [2022-04-28 13:04:32,167 INFO L290 TraceCheckUtils]: 70: Hoare triple {18000#true} assume !(0 == ~cond); {18000#true} is VALID [2022-04-28 13:04:32,167 INFO L290 TraceCheckUtils]: 69: Hoare triple {18000#true} ~cond := #in~cond; {18000#true} is VALID [2022-04-28 13:04:32,167 INFO L272 TraceCheckUtils]: 68: Hoare triple {18207#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18000#true} is VALID [2022-04-28 13:04:32,167 INFO L290 TraceCheckUtils]: 67: Hoare triple {18207#(<= ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:32,168 INFO L290 TraceCheckUtils]: 66: Hoare triple {18152#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18207#(<= ~counter~0 4)} is VALID [2022-04-28 13:04:32,168 INFO L290 TraceCheckUtils]: 65: Hoare triple {18152#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:32,168 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18000#true} {18152#(<= ~counter~0 3)} #86#return; {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:32,168 INFO L290 TraceCheckUtils]: 63: Hoare triple {18000#true} assume true; {18000#true} is VALID [2022-04-28 13:04:32,169 INFO L290 TraceCheckUtils]: 62: Hoare triple {18000#true} assume !(0 == ~cond); {18000#true} is VALID [2022-04-28 13:04:32,169 INFO L290 TraceCheckUtils]: 61: Hoare triple {18000#true} ~cond := #in~cond; {18000#true} is VALID [2022-04-28 13:04:32,169 INFO L272 TraceCheckUtils]: 60: Hoare triple {18152#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {18000#true} is VALID [2022-04-28 13:04:32,169 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18000#true} {18152#(<= ~counter~0 3)} #84#return; {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:32,169 INFO L290 TraceCheckUtils]: 58: Hoare triple {18000#true} assume true; {18000#true} is VALID [2022-04-28 13:04:32,169 INFO L290 TraceCheckUtils]: 57: Hoare triple {18000#true} assume !(0 == ~cond); {18000#true} is VALID [2022-04-28 13:04:32,169 INFO L290 TraceCheckUtils]: 56: Hoare triple {18000#true} ~cond := #in~cond; {18000#true} is VALID [2022-04-28 13:04:32,169 INFO L272 TraceCheckUtils]: 55: Hoare triple {18152#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {18000#true} is VALID [2022-04-28 13:04:32,170 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {18000#true} {18152#(<= ~counter~0 3)} #82#return; {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:32,170 INFO L290 TraceCheckUtils]: 53: Hoare triple {18000#true} assume true; {18000#true} is VALID [2022-04-28 13:04:32,170 INFO L290 TraceCheckUtils]: 52: Hoare triple {18000#true} assume !(0 == ~cond); {18000#true} is VALID [2022-04-28 13:04:32,170 INFO L290 TraceCheckUtils]: 51: Hoare triple {18000#true} ~cond := #in~cond; {18000#true} is VALID [2022-04-28 13:04:32,170 INFO L272 TraceCheckUtils]: 50: Hoare triple {18152#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18000#true} is VALID [2022-04-28 13:04:32,170 INFO L290 TraceCheckUtils]: 49: Hoare triple {18152#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:32,171 INFO L290 TraceCheckUtils]: 48: Hoare triple {18097#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18152#(<= ~counter~0 3)} is VALID [2022-04-28 13:04:32,171 INFO L290 TraceCheckUtils]: 47: Hoare triple {18097#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:32,171 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {18000#true} {18097#(<= ~counter~0 2)} #86#return; {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:32,172 INFO L290 TraceCheckUtils]: 45: Hoare triple {18000#true} assume true; {18000#true} is VALID [2022-04-28 13:04:32,172 INFO L290 TraceCheckUtils]: 44: Hoare triple {18000#true} assume !(0 == ~cond); {18000#true} is VALID [2022-04-28 13:04:32,172 INFO L290 TraceCheckUtils]: 43: Hoare triple {18000#true} ~cond := #in~cond; {18000#true} is VALID [2022-04-28 13:04:32,172 INFO L272 TraceCheckUtils]: 42: Hoare triple {18097#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {18000#true} is VALID [2022-04-28 13:04:32,172 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18000#true} {18097#(<= ~counter~0 2)} #84#return; {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:32,172 INFO L290 TraceCheckUtils]: 40: Hoare triple {18000#true} assume true; {18000#true} is VALID [2022-04-28 13:04:32,173 INFO L290 TraceCheckUtils]: 39: Hoare triple {18000#true} assume !(0 == ~cond); {18000#true} is VALID [2022-04-28 13:04:32,173 INFO L290 TraceCheckUtils]: 38: Hoare triple {18000#true} ~cond := #in~cond; {18000#true} is VALID [2022-04-28 13:04:32,173 INFO L272 TraceCheckUtils]: 37: Hoare triple {18097#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {18000#true} is VALID [2022-04-28 13:04:32,173 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18000#true} {18097#(<= ~counter~0 2)} #82#return; {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:32,173 INFO L290 TraceCheckUtils]: 35: Hoare triple {18000#true} assume true; {18000#true} is VALID [2022-04-28 13:04:32,173 INFO L290 TraceCheckUtils]: 34: Hoare triple {18000#true} assume !(0 == ~cond); {18000#true} is VALID [2022-04-28 13:04:32,173 INFO L290 TraceCheckUtils]: 33: Hoare triple {18000#true} ~cond := #in~cond; {18000#true} is VALID [2022-04-28 13:04:32,173 INFO L272 TraceCheckUtils]: 32: Hoare triple {18097#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18000#true} is VALID [2022-04-28 13:04:32,174 INFO L290 TraceCheckUtils]: 31: Hoare triple {18097#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:32,174 INFO L290 TraceCheckUtils]: 30: Hoare triple {18042#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18097#(<= ~counter~0 2)} is VALID [2022-04-28 13:04:32,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {18042#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:32,175 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {18000#true} {18042#(<= ~counter~0 1)} #86#return; {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:32,175 INFO L290 TraceCheckUtils]: 27: Hoare triple {18000#true} assume true; {18000#true} is VALID [2022-04-28 13:04:32,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {18000#true} assume !(0 == ~cond); {18000#true} is VALID [2022-04-28 13:04:32,176 INFO L290 TraceCheckUtils]: 25: Hoare triple {18000#true} ~cond := #in~cond; {18000#true} is VALID [2022-04-28 13:04:32,176 INFO L272 TraceCheckUtils]: 24: Hoare triple {18042#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {18000#true} is VALID [2022-04-28 13:04:32,176 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18000#true} {18042#(<= ~counter~0 1)} #84#return; {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:32,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {18000#true} assume true; {18000#true} is VALID [2022-04-28 13:04:32,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {18000#true} assume !(0 == ~cond); {18000#true} is VALID [2022-04-28 13:04:32,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {18000#true} ~cond := #in~cond; {18000#true} is VALID [2022-04-28 13:04:32,176 INFO L272 TraceCheckUtils]: 19: Hoare triple {18042#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {18000#true} is VALID [2022-04-28 13:04:32,177 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18000#true} {18042#(<= ~counter~0 1)} #82#return; {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:32,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {18000#true} assume true; {18000#true} is VALID [2022-04-28 13:04:32,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {18000#true} assume !(0 == ~cond); {18000#true} is VALID [2022-04-28 13:04:32,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {18000#true} ~cond := #in~cond; {18000#true} is VALID [2022-04-28 13:04:32,177 INFO L272 TraceCheckUtils]: 14: Hoare triple {18042#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18000#true} is VALID [2022-04-28 13:04:32,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {18042#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:32,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {18008#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18042#(<= ~counter~0 1)} is VALID [2022-04-28 13:04:32,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {18008#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {18008#(<= ~counter~0 0)} is VALID [2022-04-28 13:04:32,179 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18000#true} {18008#(<= ~counter~0 0)} #80#return; {18008#(<= ~counter~0 0)} is VALID [2022-04-28 13:04:32,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {18000#true} assume true; {18000#true} is VALID [2022-04-28 13:04:32,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {18000#true} assume !(0 == ~cond); {18000#true} is VALID [2022-04-28 13:04:32,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {18000#true} ~cond := #in~cond; {18000#true} is VALID [2022-04-28 13:04:32,179 INFO L272 TraceCheckUtils]: 6: Hoare triple {18008#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {18000#true} is VALID [2022-04-28 13:04:32,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {18008#(<= ~counter~0 0)} 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; {18008#(<= ~counter~0 0)} is VALID [2022-04-28 13:04:32,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {18008#(<= ~counter~0 0)} call #t~ret8 := main(); {18008#(<= ~counter~0 0)} is VALID [2022-04-28 13:04:32,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18008#(<= ~counter~0 0)} {18000#true} #96#return; {18008#(<= ~counter~0 0)} is VALID [2022-04-28 13:04:32,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {18008#(<= ~counter~0 0)} assume true; {18008#(<= ~counter~0 0)} is VALID [2022-04-28 13:04:32,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {18000#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);~counter~0 := 0; {18008#(<= ~counter~0 0)} is VALID [2022-04-28 13:04:32,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {18000#true} call ULTIMATE.init(); {18000#true} is VALID [2022-04-28 13:04:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 13:04:32,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:04:32,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403419265] [2022-04-28 13:04:32,182 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:04:32,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450426907] [2022-04-28 13:04:32,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450426907] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:04:32,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:04:32,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 13:04:32,182 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:04:32,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [810321965] [2022-04-28 13:04:32,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [810321965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:04:32,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:04:32,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 13:04:32,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294843329] [2022-04-28 13:04:32,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:04:32,183 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) Word has length 97 [2022-04-28 13:04:32,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:04:32,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 13:04:32,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:04:32,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 13:04:32,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:04:32,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 13:04:32,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 13:04:32,249 INFO L87 Difference]: Start difference. First operand 205 states and 243 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 13:04:32,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:04:32,794 INFO L93 Difference]: Finished difference Result 266 states and 328 transitions. [2022-04-28 13:04:32,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 13:04:32,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) Word has length 97 [2022-04-28 13:04:32,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:04:32,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 13:04:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 124 transitions. [2022-04-28 13:04:32,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 13:04:32,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 124 transitions. [2022-04-28 13:04:32,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 124 transitions. [2022-04-28 13:04:32,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:04:32,896 INFO L225 Difference]: With dead ends: 266 [2022-04-28 13:04:32,896 INFO L226 Difference]: Without dead ends: 207 [2022-04-28 13:04:32,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 186 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 13:04:32,897 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 23 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:04:32,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 164 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:04:32,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-04-28 13:04:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-04-28 13:04:33,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:04:33,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 207 states, 136 states have (on average 1.1691176470588236) internal successors, (159), 145 states have internal predecessors, (159), 45 states have call successors, (45), 26 states have call predecessors, (45), 25 states have return successors, (41), 35 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 13:04:33,119 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 207 states, 136 states have (on average 1.1691176470588236) internal successors, (159), 145 states have internal predecessors, (159), 45 states have call successors, (45), 26 states have call predecessors, (45), 25 states have return successors, (41), 35 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 13:04:33,119 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 207 states, 136 states have (on average 1.1691176470588236) internal successors, (159), 145 states have internal predecessors, (159), 45 states have call successors, (45), 26 states have call predecessors, (45), 25 states have return successors, (41), 35 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 13:04:33,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:04:33,122 INFO L93 Difference]: Finished difference Result 207 states and 245 transitions. [2022-04-28 13:04:33,122 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 245 transitions. [2022-04-28 13:04:33,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:04:33,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:04:33,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 136 states have (on average 1.1691176470588236) internal successors, (159), 145 states have internal predecessors, (159), 45 states have call successors, (45), 26 states have call predecessors, (45), 25 states have return successors, (41), 35 states have call predecessors, (41), 41 states have call successors, (41) Second operand 207 states. [2022-04-28 13:04:33,123 INFO L87 Difference]: Start difference. First operand has 207 states, 136 states have (on average 1.1691176470588236) internal successors, (159), 145 states have internal predecessors, (159), 45 states have call successors, (45), 26 states have call predecessors, (45), 25 states have return successors, (41), 35 states have call predecessors, (41), 41 states have call successors, (41) Second operand 207 states. [2022-04-28 13:04:33,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:04:33,126 INFO L93 Difference]: Finished difference Result 207 states and 245 transitions. [2022-04-28 13:04:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 245 transitions. [2022-04-28 13:04:33,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:04:33,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:04:33,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:04:33,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:04:33,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 136 states have (on average 1.1691176470588236) internal successors, (159), 145 states have internal predecessors, (159), 45 states have call successors, (45), 26 states have call predecessors, (45), 25 states have return successors, (41), 35 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 13:04:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 245 transitions. [2022-04-28 13:04:33,130 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 245 transitions. Word has length 97 [2022-04-28 13:04:33,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:04:33,130 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 245 transitions. [2022-04-28 13:04:33,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 13:04:33,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 245 transitions. [2022-04-28 13:04:35,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 244 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 13:04:35,488 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 245 transitions. [2022-04-28 13:04:35,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-28 13:04:35,489 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:04:35,489 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-28 13:04:35,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 13:04:35,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:04:35,689 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:04:35,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:04:35,690 INFO L85 PathProgramCache]: Analyzing trace with hash -545719131, now seen corresponding path program 5 times [2022-04-28 13:04:35,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:04:35,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1999627109] [2022-04-28 13:04:44,156 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:04:44,156 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:04:44,156 INFO L85 PathProgramCache]: Analyzing trace with hash -545719131, now seen corresponding path program 6 times [2022-04-28 13:04:44,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:04:44,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573735200] [2022-04-28 13:04:44,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:04:44,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:04:44,173 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:04:44,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1455541275] [2022-04-28 13:04:44,174 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:04:44,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:04:44,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:04:44,177 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:04:44,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 13:04:44,315 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 13:04:44,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:04:44,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-28 13:04:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:04:44,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:05:18,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {19957#true} call ULTIMATE.init(); {19957#true} is VALID [2022-04-28 13:05:18,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {19957#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);~counter~0 := 0; {19957#true} is VALID [2022-04-28 13:05:18,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:05:18,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19957#true} {19957#true} #96#return; {19957#true} is VALID [2022-04-28 13:05:18,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {19957#true} call #t~ret8 := main(); {19957#true} is VALID [2022-04-28 13:05:18,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {19957#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; {19957#true} is VALID [2022-04-28 13:05:18,765 INFO L272 TraceCheckUtils]: 6: Hoare triple {19957#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:05:18,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {19957#true} ~cond := #in~cond; {19983#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 13:05:18,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {19983#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {19987#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 13:05:18,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {19987#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {19987#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 13:05:18,766 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19987#(not (= |assume_abort_if_not_#in~cond| 0))} {19957#true} #80#return; {19994#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-28 13:05:18,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {19994#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {19998#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~d~0 4294967296) (<= 0 main_~d~0) (= main_~q~0 0) (<= 1 (mod main_~d~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 13:05:18,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {19998#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~d~0 4294967296) (<= 0 main_~d~0) (= main_~q~0 0) (<= 1 (mod main_~d~0 4294967296)) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19998#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~d~0 4294967296) (<= 0 main_~d~0) (= main_~q~0 0) (<= 1 (mod main_~d~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 13:05:18,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {19998#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~d~0 4294967296) (<= 0 main_~d~0) (= main_~q~0 0) (<= 1 (mod main_~d~0 4294967296)) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {19998#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~d~0 4294967296) (<= 0 main_~d~0) (= main_~q~0 0) (<= 1 (mod main_~d~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 13:05:18,770 INFO L272 TraceCheckUtils]: 14: Hoare triple {19998#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~d~0 4294967296) (<= 0 main_~d~0) (= main_~q~0 0) (<= 1 (mod main_~d~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:05:18,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:05:18,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:05:18,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:05:18,771 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {19957#true} {19998#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~d~0 4294967296) (<= 0 main_~d~0) (= main_~q~0 0) (<= 1 (mod main_~d~0 4294967296)) (= main_~p~0 1))} #82#return; {19998#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~d~0 4294967296) (<= 0 main_~d~0) (= main_~q~0 0) (<= 1 (mod main_~d~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 13:05:18,771 INFO L272 TraceCheckUtils]: 19: Hoare triple {19998#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~d~0 4294967296) (<= 0 main_~d~0) (= main_~q~0 0) (<= 1 (mod main_~d~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:05:18,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:05:18,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:05:18,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:05:18,771 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19957#true} {19998#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~d~0 4294967296) (<= 0 main_~d~0) (= main_~q~0 0) (<= 1 (mod main_~d~0 4294967296)) (= main_~p~0 1))} #84#return; {19998#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~d~0 4294967296) (<= 0 main_~d~0) (= main_~q~0 0) (<= 1 (mod main_~d~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 13:05:18,772 INFO L272 TraceCheckUtils]: 24: Hoare triple {19998#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~d~0 4294967296) (<= 0 main_~d~0) (= main_~q~0 0) (<= 1 (mod main_~d~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:05:18,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:05:18,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:05:18,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:05:18,772 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {19957#true} {19998#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~d~0 4294967296) (<= 0 main_~d~0) (= main_~q~0 0) (<= 1 (mod main_~d~0 4294967296)) (= main_~p~0 1))} #86#return; {19998#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~d~0 4294967296) (<= 0 main_~d~0) (= main_~q~0 0) (<= 1 (mod main_~d~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-28 13:05:18,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {19998#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~d~0 4294967296) (<= 0 main_~d~0) (= main_~q~0 0) (<= 1 (mod main_~d~0 4294967296)) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20053#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 13:05:18,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {20053#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20053#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 13:05:18,775 INFO L290 TraceCheckUtils]: 31: Hoare triple {20053#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {20053#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 13:05:18,775 INFO L272 TraceCheckUtils]: 32: Hoare triple {20053#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:05:18,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:05:18,775 INFO L290 TraceCheckUtils]: 34: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:05:18,775 INFO L290 TraceCheckUtils]: 35: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:05:18,776 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {19957#true} {20053#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #82#return; {20053#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 13:05:18,776 INFO L272 TraceCheckUtils]: 37: Hoare triple {20053#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:05:18,776 INFO L290 TraceCheckUtils]: 38: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:05:18,776 INFO L290 TraceCheckUtils]: 39: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:05:18,776 INFO L290 TraceCheckUtils]: 40: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:05:18,776 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {19957#true} {20053#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #84#return; {20053#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 13:05:18,776 INFO L272 TraceCheckUtils]: 42: Hoare triple {20053#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:05:18,776 INFO L290 TraceCheckUtils]: 43: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:05:18,777 INFO L290 TraceCheckUtils]: 44: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:05:18,777 INFO L290 TraceCheckUtils]: 45: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:05:18,777 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {19957#true} {20053#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #86#return; {20053#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 13:05:18,779 INFO L290 TraceCheckUtils]: 47: Hoare triple {20053#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} is VALID [2022-04-28 13:05:18,780 INFO L290 TraceCheckUtils]: 48: Hoare triple {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} is VALID [2022-04-28 13:05:18,780 INFO L290 TraceCheckUtils]: 49: Hoare triple {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} assume !!(#t~post6 < 5);havoc #t~post6; {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} is VALID [2022-04-28 13:05:18,781 INFO L272 TraceCheckUtils]: 50: Hoare triple {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:05:18,781 INFO L290 TraceCheckUtils]: 51: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:05:18,781 INFO L290 TraceCheckUtils]: 52: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:05:18,781 INFO L290 TraceCheckUtils]: 53: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:05:18,781 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {19957#true} {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} #82#return; {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} is VALID [2022-04-28 13:05:18,781 INFO L272 TraceCheckUtils]: 55: Hoare triple {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:05:18,781 INFO L290 TraceCheckUtils]: 56: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:05:18,781 INFO L290 TraceCheckUtils]: 57: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:05:18,781 INFO L290 TraceCheckUtils]: 58: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:05:18,782 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19957#true} {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} #84#return; {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} is VALID [2022-04-28 13:05:18,782 INFO L272 TraceCheckUtils]: 60: Hoare triple {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:05:18,782 INFO L290 TraceCheckUtils]: 61: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:05:18,782 INFO L290 TraceCheckUtils]: 62: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:05:18,782 INFO L290 TraceCheckUtils]: 63: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:05:18,783 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {19957#true} {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} #86#return; {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} is VALID [2022-04-28 13:05:18,783 INFO L290 TraceCheckUtils]: 65: Hoare triple {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} assume !(~r~0 >= ~d~0); {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} is VALID [2022-04-28 13:05:18,784 INFO L290 TraceCheckUtils]: 66: Hoare triple {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} is VALID [2022-04-28 13:05:18,784 INFO L290 TraceCheckUtils]: 67: Hoare triple {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} assume !!(#t~post7 < 5);havoc #t~post7; {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} is VALID [2022-04-28 13:05:18,784 INFO L272 TraceCheckUtils]: 68: Hoare triple {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:05:18,784 INFO L290 TraceCheckUtils]: 69: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:05:18,784 INFO L290 TraceCheckUtils]: 70: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:05:18,784 INFO L290 TraceCheckUtils]: 71: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:05:18,785 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {19957#true} {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} #88#return; {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} is VALID [2022-04-28 13:05:18,785 INFO L272 TraceCheckUtils]: 73: Hoare triple {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:05:18,785 INFO L290 TraceCheckUtils]: 74: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:05:18,785 INFO L290 TraceCheckUtils]: 75: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:05:18,785 INFO L290 TraceCheckUtils]: 76: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:05:18,785 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {19957#true} {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} #90#return; {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 4294967296))} is VALID [2022-04-28 13:05:18,787 INFO L290 TraceCheckUtils]: 78: Hoare triple {20108#(and (<= 1 (mod (div (div main_~d~0 2) 2) 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (div main_~d~0 2) 2)) (= (mod (div main_~d~0 2) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (< (div (div main_~d~0 2) 2) 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); {20053#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 13:05:18,790 INFO L290 TraceCheckUtils]: 79: Hoare triple {20053#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {20205#(and (= main_~q~0 main_~p~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0))} is VALID [2022-04-28 13:05:18,790 INFO L290 TraceCheckUtils]: 80: Hoare triple {20205#(and (= main_~q~0 main_~p~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20205#(and (= main_~q~0 main_~p~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0))} is VALID [2022-04-28 13:05:18,791 INFO L290 TraceCheckUtils]: 81: Hoare triple {20205#(and (= main_~q~0 main_~p~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0))} assume !!(#t~post7 < 5);havoc #t~post7; {20205#(and (= main_~q~0 main_~p~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0))} is VALID [2022-04-28 13:05:18,791 INFO L272 TraceCheckUtils]: 82: Hoare triple {20205#(and (= main_~q~0 main_~p~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:05:18,791 INFO L290 TraceCheckUtils]: 83: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:05:18,791 INFO L290 TraceCheckUtils]: 84: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:05:18,791 INFO L290 TraceCheckUtils]: 85: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:05:18,792 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {19957#true} {20205#(and (= main_~q~0 main_~p~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0))} #88#return; {20205#(and (= main_~q~0 main_~p~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0))} is VALID [2022-04-28 13:05:18,792 INFO L272 TraceCheckUtils]: 87: Hoare triple {20205#(and (= main_~q~0 main_~p~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:05:18,792 INFO L290 TraceCheckUtils]: 88: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:05:18,792 INFO L290 TraceCheckUtils]: 89: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:05:18,792 INFO L290 TraceCheckUtils]: 90: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:05:18,792 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {19957#true} {20205#(and (= main_~q~0 main_~p~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0))} #90#return; {20205#(and (= main_~q~0 main_~p~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (mod main_~d~0 2) 0))} is VALID [2022-04-28 13:05:18,795 INFO L290 TraceCheckUtils]: 92: Hoare triple {20205#(and (= main_~q~0 main_~p~0) (< (div main_~d~0 2) 4294967296) (<= 1 (mod (div main_~d~0 2) 4294967296)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= main_~p~0 2) (<= 0 (div main_~d~0 2)) (= (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); {20245#(and (< (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2) 4294967296) (= main_~q~0 2) (= (mod (+ (mod main_~A~0 4294967296) main_~r~0) 2) 0) (<= 1 (mod (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2) 4294967296)) (= main_~d~0 (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (<= 0 (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (= main_~p~0 1))} is VALID [2022-04-28 13:05:18,798 INFO L290 TraceCheckUtils]: 93: Hoare triple {20245#(and (< (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2) 4294967296) (= main_~q~0 2) (= (mod (+ (mod main_~A~0 4294967296) main_~r~0) 2) 0) (<= 1 (mod (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2) 4294967296)) (= main_~d~0 (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (<= 0 (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {20249#(and (<= 1 (mod (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2) 4294967296)) (= (mod (+ (mod main_~A~0 4294967296) main_~d~0 main_~r~0) 2) 0) (< (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2) 4294967296) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (<= 0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (= (+ (- 2) main_~q~0) 1))} is VALID [2022-04-28 13:05:18,799 INFO L290 TraceCheckUtils]: 94: Hoare triple {20249#(and (<= 1 (mod (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2) 4294967296)) (= (mod (+ (mod main_~A~0 4294967296) main_~d~0 main_~r~0) 2) 0) (< (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2) 4294967296) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (<= 0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (= (+ (- 2) main_~q~0) 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20249#(and (<= 1 (mod (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2) 4294967296)) (= (mod (+ (mod main_~A~0 4294967296) main_~d~0 main_~r~0) 2) 0) (< (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2) 4294967296) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (<= 0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (= (+ (- 2) main_~q~0) 1))} is VALID [2022-04-28 13:05:18,800 INFO L290 TraceCheckUtils]: 95: Hoare triple {20249#(and (<= 1 (mod (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2) 4294967296)) (= (mod (+ (mod main_~A~0 4294967296) main_~d~0 main_~r~0) 2) 0) (< (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2) 4294967296) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (<= 0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (= (+ (- 2) main_~q~0) 1))} assume !(#t~post7 < 5);havoc #t~post7; {20249#(and (<= 1 (mod (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2) 4294967296)) (= (mod (+ (mod main_~A~0 4294967296) main_~d~0 main_~r~0) 2) 0) (< (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2) 4294967296) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (<= 0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (= (+ (- 2) main_~q~0) 1))} is VALID [2022-04-28 13:05:18,801 INFO L272 TraceCheckUtils]: 96: Hoare triple {20249#(and (<= 1 (mod (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2) 4294967296)) (= (mod (+ (mod main_~A~0 4294967296) main_~d~0 main_~r~0) 2) 0) (< (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2) 4294967296) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (<= 0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (= (+ (- 2) main_~q~0) 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {20259#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:05:18,802 INFO L290 TraceCheckUtils]: 97: Hoare triple {20259#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20263#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:05:18,802 INFO L290 TraceCheckUtils]: 98: Hoare triple {20263#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19958#false} is VALID [2022-04-28 13:05:18,802 INFO L290 TraceCheckUtils]: 99: Hoare triple {19958#false} assume !false; {19958#false} is VALID [2022-04-28 13:05:18,803 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 13:05:18,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:06:13,667 INFO L290 TraceCheckUtils]: 99: Hoare triple {19958#false} assume !false; {19958#false} is VALID [2022-04-28 13:06:13,667 INFO L290 TraceCheckUtils]: 98: Hoare triple {20263#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19958#false} is VALID [2022-04-28 13:06:13,668 INFO L290 TraceCheckUtils]: 97: Hoare triple {20259#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20263#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:06:13,668 INFO L272 TraceCheckUtils]: 96: Hoare triple {20279#(= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {20259#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:06:13,669 INFO L290 TraceCheckUtils]: 95: Hoare triple {20279#(= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0))} assume !(#t~post7 < 5);havoc #t~post7; {20279#(= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0))} is VALID [2022-04-28 13:06:13,669 INFO L290 TraceCheckUtils]: 94: Hoare triple {20279#(= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20279#(= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0))} is VALID [2022-04-28 13:06:13,673 INFO L290 TraceCheckUtils]: 93: Hoare triple {20289#(= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 main_~p~0) main_~d~0) (* (- 1) main_~d~0) main_~r~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {20279#(= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0))} is VALID [2022-04-28 13:06:13,700 INFO L290 TraceCheckUtils]: 92: Hoare triple {20293#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2))))))) (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 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) (+ (div main_~d~0 2) 1))))) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 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); {20289#(= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 main_~p~0) main_~d~0) (* (- 1) main_~d~0) main_~r~0))} is VALID [2022-04-28 13:06:13,700 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {19957#true} {20293#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2))))))) (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 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) (+ (div main_~d~0 2) 1))))) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #90#return; {20293#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2))))))) (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 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) (+ (div main_~d~0 2) 1))))) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-28 13:06:13,700 INFO L290 TraceCheckUtils]: 90: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:06:13,700 INFO L290 TraceCheckUtils]: 89: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:06:13,701 INFO L290 TraceCheckUtils]: 88: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:06:13,701 INFO L272 TraceCheckUtils]: 87: Hoare triple {20293#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2))))))) (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 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) (+ (div main_~d~0 2) 1))))) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:06:13,701 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {19957#true} {20293#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2))))))) (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 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) (+ (div main_~d~0 2) 1))))) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #88#return; {20293#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2))))))) (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 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) (+ (div main_~d~0 2) 1))))) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-28 13:06:13,701 INFO L290 TraceCheckUtils]: 85: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:06:13,701 INFO L290 TraceCheckUtils]: 84: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:06:13,701 INFO L290 TraceCheckUtils]: 83: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:06:13,701 INFO L272 TraceCheckUtils]: 82: Hoare triple {20293#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2))))))) (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 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) (+ (div main_~d~0 2) 1))))) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 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)); {19957#true} is VALID [2022-04-28 13:06:13,702 INFO L290 TraceCheckUtils]: 81: Hoare triple {20293#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2))))))) (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 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) (+ (div main_~d~0 2) 1))))) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} assume !!(#t~post7 < 5);havoc #t~post7; {20293#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2))))))) (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 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) (+ (div main_~d~0 2) 1))))) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-28 13:06:13,704 INFO L290 TraceCheckUtils]: 80: Hoare triple {20293#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2))))))) (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 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) (+ (div main_~d~0 2) 1))))) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20293#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2))))))) (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 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) (+ (div main_~d~0 2) 1))))) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-28 13:06:13,756 INFO L290 TraceCheckUtils]: 79: Hoare triple {20333#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {20293#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2))))))) (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 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) (+ (div main_~d~0 2) 1))))) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-28 13:06:13,945 INFO L290 TraceCheckUtils]: 78: Hoare triple {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (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); {20333#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))))))} is VALID [2022-04-28 13:06:13,946 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {19957#true} {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))))))))) (= (mod main_~p~0 2) 0)))} #90#return; {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))))))))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-28 13:06:13,947 INFO L290 TraceCheckUtils]: 76: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:06:13,947 INFO L290 TraceCheckUtils]: 75: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:06:13,947 INFO L290 TraceCheckUtils]: 74: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:06:13,947 INFO L272 TraceCheckUtils]: 73: Hoare triple {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (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)); {19957#true} is VALID [2022-04-28 13:06:13,948 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {19957#true} {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))))))))) (= (mod main_~p~0 2) 0)))} #88#return; {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))))))))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-28 13:06:13,948 INFO L290 TraceCheckUtils]: 71: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:06:13,948 INFO L290 TraceCheckUtils]: 70: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:06:13,948 INFO L290 TraceCheckUtils]: 69: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:06:13,948 INFO L272 TraceCheckUtils]: 68: Hoare triple {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (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)); {19957#true} is VALID [2022-04-28 13:06:13,954 INFO L290 TraceCheckUtils]: 67: Hoare triple {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))))))))) (= (mod main_~p~0 2) 0)))} assume !!(#t~post7 < 5);havoc #t~post7; {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))))))))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-28 13:06:13,958 INFO L290 TraceCheckUtils]: 66: Hoare triple {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))))))))) (= (mod main_~p~0 2) 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))))))))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-28 13:06:13,962 INFO L290 TraceCheckUtils]: 65: Hoare triple {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))))))))) (= (mod main_~p~0 2) 0)))} assume !(~r~0 >= ~d~0); {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))))))))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-28 13:06:13,962 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {19957#true} {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))))))))) (= (mod main_~p~0 2) 0)))} #86#return; {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))))))))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-28 13:06:13,963 INFO L290 TraceCheckUtils]: 63: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:06:13,963 INFO L290 TraceCheckUtils]: 62: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:06:13,963 INFO L290 TraceCheckUtils]: 61: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:06:13,963 INFO L272 TraceCheckUtils]: 60: Hoare triple {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (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)); {19957#true} is VALID [2022-04-28 13:06:13,964 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19957#true} {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))))))))) (= (mod main_~p~0 2) 0)))} #84#return; {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))))))))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-28 13:06:13,964 INFO L290 TraceCheckUtils]: 58: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:06:13,964 INFO L290 TraceCheckUtils]: 57: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:06:13,964 INFO L290 TraceCheckUtils]: 56: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:06:13,964 INFO L272 TraceCheckUtils]: 55: Hoare triple {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))))))))) (= (mod main_~p~0 2) 0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:06:13,965 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {19957#true} {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))))))))) (= (mod main_~p~0 2) 0)))} #82#return; {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))))))))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-28 13:06:13,965 INFO L290 TraceCheckUtils]: 53: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:06:13,965 INFO L290 TraceCheckUtils]: 52: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:06:13,965 INFO L290 TraceCheckUtils]: 51: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:06:13,965 INFO L272 TraceCheckUtils]: 50: Hoare triple {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))))))))) (= (mod main_~p~0 2) 0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:06:13,969 INFO L290 TraceCheckUtils]: 49: Hoare triple {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))))))))) (= (mod main_~p~0 2) 0)))} assume !!(#t~post6 < 5);havoc #t~post6; {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))))))))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-28 13:06:13,972 INFO L290 TraceCheckUtils]: 48: Hoare triple {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))))))))) (= (mod main_~p~0 2) 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))))))))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-28 13:06:15,428 INFO L290 TraceCheckUtils]: 47: Hoare triple {20333#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20337#(and (or (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) 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) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) (mod main_~A~0 4294967296)) (not (< (div main_~p~0 2) 0))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod main_~A~0 4294967296) (+ (- 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)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (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) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2)))) (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 (and (< (div main_~p~0 2) 0) (not (= (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)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) 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 (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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) (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))))))))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-28 13:06:15,429 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {19957#true} {20333#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))))))} #86#return; {20333#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))))))} is VALID [2022-04-28 13:06:15,429 INFO L290 TraceCheckUtils]: 45: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:06:15,429 INFO L290 TraceCheckUtils]: 44: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:06:15,429 INFO L290 TraceCheckUtils]: 43: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:06:15,429 INFO L272 TraceCheckUtils]: 42: Hoare triple {20333#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:06:15,430 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {19957#true} {20333#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))))))} #84#return; {20333#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))))))} is VALID [2022-04-28 13:06:15,430 INFO L290 TraceCheckUtils]: 40: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:06:15,430 INFO L290 TraceCheckUtils]: 39: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:06:15,430 INFO L290 TraceCheckUtils]: 38: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:06:15,430 INFO L272 TraceCheckUtils]: 37: Hoare triple {20333#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:06:15,431 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {19957#true} {20333#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))))))} #82#return; {20333#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))))))} is VALID [2022-04-28 13:06:15,431 INFO L290 TraceCheckUtils]: 35: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:06:15,431 INFO L290 TraceCheckUtils]: 34: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:06:15,431 INFO L290 TraceCheckUtils]: 33: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:06:15,431 INFO L272 TraceCheckUtils]: 32: Hoare triple {20333#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:06:15,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {20333#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))))))} assume !!(#t~post6 < 5);havoc #t~post6; {20333#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))))))} is VALID [2022-04-28 13:06:15,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {20333#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20333#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))))))} is VALID [2022-04-28 13:06:15,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {20485#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20333#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))))))} is VALID [2022-04-28 13:06:15,438 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {19957#true} {20485#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))))} #86#return; {20485#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))))} is VALID [2022-04-28 13:06:15,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:06:15,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:06:15,438 INFO L290 TraceCheckUtils]: 25: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:06:15,438 INFO L272 TraceCheckUtils]: 24: Hoare triple {20485#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:06:15,438 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19957#true} {20485#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))))} #84#return; {20485#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))))} is VALID [2022-04-28 13:06:15,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:06:15,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:06:15,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:06:15,439 INFO L272 TraceCheckUtils]: 19: Hoare triple {20485#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:06:15,439 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {19957#true} {20485#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))))} #82#return; {20485#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))))} is VALID [2022-04-28 13:06:15,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:06:15,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:06:15,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:06:15,439 INFO L272 TraceCheckUtils]: 14: Hoare triple {20485#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:06:15,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {20485#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))))} assume !!(#t~post6 < 5);havoc #t~post6; {20485#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))))} is VALID [2022-04-28 13:06:15,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {20485#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20485#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))))} is VALID [2022-04-28 13:06:15,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {19957#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {20485#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))))} is VALID [2022-04-28 13:06:15,441 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19957#true} {19957#true} #80#return; {19957#true} is VALID [2022-04-28 13:06:15,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:06:15,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {19957#true} assume !(0 == ~cond); {19957#true} is VALID [2022-04-28 13:06:15,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {19957#true} ~cond := #in~cond; {19957#true} is VALID [2022-04-28 13:06:15,441 INFO L272 TraceCheckUtils]: 6: Hoare triple {19957#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {19957#true} is VALID [2022-04-28 13:06:15,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {19957#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; {19957#true} is VALID [2022-04-28 13:06:15,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {19957#true} call #t~ret8 := main(); {19957#true} is VALID [2022-04-28 13:06:15,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19957#true} {19957#true} #96#return; {19957#true} is VALID [2022-04-28 13:06:15,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {19957#true} assume true; {19957#true} is VALID [2022-04-28 13:06:15,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {19957#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);~counter~0 := 0; {19957#true} is VALID [2022-04-28 13:06:15,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {19957#true} call ULTIMATE.init(); {19957#true} is VALID [2022-04-28 13:06:15,442 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 13:06:15,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:06:15,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573735200] [2022-04-28 13:06:15,442 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:06:15,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455541275] [2022-04-28 13:06:15,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455541275] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:06:15,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:06:15,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2022-04-28 13:06:15,443 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:06:15,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1999627109] [2022-04-28 13:06:15,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1999627109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:06:15,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:06:15,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 13:06:15,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844011948] [2022-04-28 13:06:15,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:06:15,443 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 100 [2022-04-28 13:06:15,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:06:15,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-28 13:06:15,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:06:15,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 13:06:15,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:06:15,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 13:06:15,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-04-28 13:06:15,581 INFO L87 Difference]: Start difference. First operand 207 states and 245 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-28 13:06:25,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:06:25,257 INFO L93 Difference]: Finished difference Result 221 states and 258 transitions. [2022-04-28 13:06:25,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 13:06:25,257 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 100 [2022-04-28 13:06:25,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:06:25,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-28 13:06:25,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 119 transitions. [2022-04-28 13:06:25,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-28 13:06:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 119 transitions. [2022-04-28 13:06:25,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 119 transitions. [2022-04-28 13:06:25,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:06:25,713 INFO L225 Difference]: With dead ends: 221 [2022-04-28 13:06:25,713 INFO L226 Difference]: Without dead ends: 206 [2022-04-28 13:06:25,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 179 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2022-04-28 13:06:25,714 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 48 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-28 13:06:25,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 470 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-04-28 13:06:25,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-04-28 13:06:25,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2022-04-28 13:06:25,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:06:25,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 205 states, 136 states have (on average 1.1470588235294117) internal successors, (156), 144 states have internal predecessors, (156), 42 states have call successors, (42), 27 states have call predecessors, (42), 26 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 13:06:25,980 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 205 states, 136 states have (on average 1.1470588235294117) internal successors, (156), 144 states have internal predecessors, (156), 42 states have call successors, (42), 27 states have call predecessors, (42), 26 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 13:06:25,981 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 205 states, 136 states have (on average 1.1470588235294117) internal successors, (156), 144 states have internal predecessors, (156), 42 states have call successors, (42), 27 states have call predecessors, (42), 26 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 13:06:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:06:25,983 INFO L93 Difference]: Finished difference Result 206 states and 237 transitions. [2022-04-28 13:06:25,984 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 237 transitions. [2022-04-28 13:06:25,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:06:25,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:06:25,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 205 states, 136 states have (on average 1.1470588235294117) internal successors, (156), 144 states have internal predecessors, (156), 42 states have call successors, (42), 27 states have call predecessors, (42), 26 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) Second operand 206 states. [2022-04-28 13:06:25,984 INFO L87 Difference]: Start difference. First operand has 205 states, 136 states have (on average 1.1470588235294117) internal successors, (156), 144 states have internal predecessors, (156), 42 states have call successors, (42), 27 states have call predecessors, (42), 26 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) Second operand 206 states. [2022-04-28 13:06:25,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:06:25,987 INFO L93 Difference]: Finished difference Result 206 states and 237 transitions. [2022-04-28 13:06:25,987 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 237 transitions. [2022-04-28 13:06:25,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:06:25,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:06:25,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:06:25,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:06:25,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 136 states have (on average 1.1470588235294117) internal successors, (156), 144 states have internal predecessors, (156), 42 states have call successors, (42), 27 states have call predecessors, (42), 26 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 13:06:25,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 236 transitions. [2022-04-28 13:06:26,011 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 236 transitions. Word has length 100 [2022-04-28 13:06:26,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:06:26,011 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 236 transitions. [2022-04-28 13:06:26,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-28 13:06:26,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 205 states and 236 transitions. [2022-04-28 13:06:28,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 235 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 13:06:28,419 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 236 transitions. [2022-04-28 13:06:28,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-28 13:06:28,420 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:06:28,420 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 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-28 13:06:28,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-28 13:06:28,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:06:28,621 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:06:28,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:06:28,621 INFO L85 PathProgramCache]: Analyzing trace with hash -543991253, now seen corresponding path program 9 times [2022-04-28 13:06:28,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:06:28,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1125871387] [2022-04-28 13:06:35,070 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:06:35,070 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:06:35,070 INFO L85 PathProgramCache]: Analyzing trace with hash -543991253, now seen corresponding path program 10 times [2022-04-28 13:06:35,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:06:35,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043679779] [2022-04-28 13:06:35,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:06:35,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:06:35,080 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:06:35,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [621264522] [2022-04-28 13:06:35,080 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:06:35,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:06:35,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:06:35,082 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:06:35,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 13:06:35,153 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:06:35,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:06:35,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 13:06:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:06:35,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:06:35,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {21855#true} call ULTIMATE.init(); {21855#true} is VALID [2022-04-28 13:06:35,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {21855#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);~counter~0 := 0; {21863#(<= 0 ~counter~0)} is VALID [2022-04-28 13:06:35,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {21863#(<= 0 ~counter~0)} assume true; {21863#(<= 0 ~counter~0)} is VALID [2022-04-28 13:06:35,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21863#(<= 0 ~counter~0)} {21855#true} #96#return; {21863#(<= 0 ~counter~0)} is VALID [2022-04-28 13:06:35,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {21863#(<= 0 ~counter~0)} call #t~ret8 := main(); {21863#(<= 0 ~counter~0)} is VALID [2022-04-28 13:06:35,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {21863#(<= 0 ~counter~0)} 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; {21863#(<= 0 ~counter~0)} is VALID [2022-04-28 13:06:35,661 INFO L272 TraceCheckUtils]: 6: Hoare triple {21863#(<= 0 ~counter~0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {21863#(<= 0 ~counter~0)} is VALID [2022-04-28 13:06:35,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {21863#(<= 0 ~counter~0)} ~cond := #in~cond; {21863#(<= 0 ~counter~0)} is VALID [2022-04-28 13:06:35,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {21863#(<= 0 ~counter~0)} assume !(0 == ~cond); {21863#(<= 0 ~counter~0)} is VALID [2022-04-28 13:06:35,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {21863#(<= 0 ~counter~0)} assume true; {21863#(<= 0 ~counter~0)} is VALID [2022-04-28 13:06:35,662 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21863#(<= 0 ~counter~0)} {21863#(<= 0 ~counter~0)} #80#return; {21863#(<= 0 ~counter~0)} is VALID [2022-04-28 13:06:35,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {21863#(<= 0 ~counter~0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {21863#(<= 0 ~counter~0)} is VALID [2022-04-28 13:06:35,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {21863#(<= 0 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:35,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {21897#(<= 1 ~counter~0)} assume !!(#t~post6 < 5);havoc #t~post6; {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:35,664 INFO L272 TraceCheckUtils]: 14: Hoare triple {21897#(<= 1 ~counter~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:35,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {21897#(<= 1 ~counter~0)} ~cond := #in~cond; {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:35,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {21897#(<= 1 ~counter~0)} assume !(0 == ~cond); {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:35,665 INFO L290 TraceCheckUtils]: 17: Hoare triple {21897#(<= 1 ~counter~0)} assume true; {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:35,665 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {21897#(<= 1 ~counter~0)} {21897#(<= 1 ~counter~0)} #82#return; {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:35,666 INFO L272 TraceCheckUtils]: 19: Hoare triple {21897#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:35,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {21897#(<= 1 ~counter~0)} ~cond := #in~cond; {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:35,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {21897#(<= 1 ~counter~0)} assume !(0 == ~cond); {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:35,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {21897#(<= 1 ~counter~0)} assume true; {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:35,667 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21897#(<= 1 ~counter~0)} {21897#(<= 1 ~counter~0)} #84#return; {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:35,667 INFO L272 TraceCheckUtils]: 24: Hoare triple {21897#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:35,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {21897#(<= 1 ~counter~0)} ~cond := #in~cond; {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:35,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {21897#(<= 1 ~counter~0)} assume !(0 == ~cond); {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:35,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {21897#(<= 1 ~counter~0)} assume true; {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:35,669 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {21897#(<= 1 ~counter~0)} {21897#(<= 1 ~counter~0)} #86#return; {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:35,669 INFO L290 TraceCheckUtils]: 29: Hoare triple {21897#(<= 1 ~counter~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:35,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {21897#(<= 1 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:35,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {21952#(<= 2 ~counter~0)} assume !!(#t~post6 < 5);havoc #t~post6; {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:35,670 INFO L272 TraceCheckUtils]: 32: Hoare triple {21952#(<= 2 ~counter~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:35,671 INFO L290 TraceCheckUtils]: 33: Hoare triple {21952#(<= 2 ~counter~0)} ~cond := #in~cond; {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:35,671 INFO L290 TraceCheckUtils]: 34: Hoare triple {21952#(<= 2 ~counter~0)} assume !(0 == ~cond); {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:35,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {21952#(<= 2 ~counter~0)} assume true; {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:35,672 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21952#(<= 2 ~counter~0)} {21952#(<= 2 ~counter~0)} #82#return; {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:35,672 INFO L272 TraceCheckUtils]: 37: Hoare triple {21952#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:35,672 INFO L290 TraceCheckUtils]: 38: Hoare triple {21952#(<= 2 ~counter~0)} ~cond := #in~cond; {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:35,673 INFO L290 TraceCheckUtils]: 39: Hoare triple {21952#(<= 2 ~counter~0)} assume !(0 == ~cond); {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:35,673 INFO L290 TraceCheckUtils]: 40: Hoare triple {21952#(<= 2 ~counter~0)} assume true; {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:35,673 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21952#(<= 2 ~counter~0)} {21952#(<= 2 ~counter~0)} #84#return; {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:35,674 INFO L272 TraceCheckUtils]: 42: Hoare triple {21952#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:35,674 INFO L290 TraceCheckUtils]: 43: Hoare triple {21952#(<= 2 ~counter~0)} ~cond := #in~cond; {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:35,674 INFO L290 TraceCheckUtils]: 44: Hoare triple {21952#(<= 2 ~counter~0)} assume !(0 == ~cond); {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:35,674 INFO L290 TraceCheckUtils]: 45: Hoare triple {21952#(<= 2 ~counter~0)} assume true; {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:35,675 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21952#(<= 2 ~counter~0)} {21952#(<= 2 ~counter~0)} #86#return; {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:35,675 INFO L290 TraceCheckUtils]: 47: Hoare triple {21952#(<= 2 ~counter~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:35,676 INFO L290 TraceCheckUtils]: 48: Hoare triple {21952#(<= 2 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:35,676 INFO L290 TraceCheckUtils]: 49: Hoare triple {22007#(<= 3 ~counter~0)} assume !!(#t~post6 < 5);havoc #t~post6; {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:35,677 INFO L272 TraceCheckUtils]: 50: Hoare triple {22007#(<= 3 ~counter~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:35,677 INFO L290 TraceCheckUtils]: 51: Hoare triple {22007#(<= 3 ~counter~0)} ~cond := #in~cond; {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:35,677 INFO L290 TraceCheckUtils]: 52: Hoare triple {22007#(<= 3 ~counter~0)} assume !(0 == ~cond); {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:35,677 INFO L290 TraceCheckUtils]: 53: Hoare triple {22007#(<= 3 ~counter~0)} assume true; {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:35,678 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {22007#(<= 3 ~counter~0)} {22007#(<= 3 ~counter~0)} #82#return; {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:35,678 INFO L272 TraceCheckUtils]: 55: Hoare triple {22007#(<= 3 ~counter~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:35,678 INFO L290 TraceCheckUtils]: 56: Hoare triple {22007#(<= 3 ~counter~0)} ~cond := #in~cond; {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:35,679 INFO L290 TraceCheckUtils]: 57: Hoare triple {22007#(<= 3 ~counter~0)} assume !(0 == ~cond); {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:35,679 INFO L290 TraceCheckUtils]: 58: Hoare triple {22007#(<= 3 ~counter~0)} assume true; {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:35,679 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {22007#(<= 3 ~counter~0)} {22007#(<= 3 ~counter~0)} #84#return; {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:35,680 INFO L272 TraceCheckUtils]: 60: Hoare triple {22007#(<= 3 ~counter~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:35,680 INFO L290 TraceCheckUtils]: 61: Hoare triple {22007#(<= 3 ~counter~0)} ~cond := #in~cond; {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:35,680 INFO L290 TraceCheckUtils]: 62: Hoare triple {22007#(<= 3 ~counter~0)} assume !(0 == ~cond); {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:35,681 INFO L290 TraceCheckUtils]: 63: Hoare triple {22007#(<= 3 ~counter~0)} assume true; {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:35,681 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {22007#(<= 3 ~counter~0)} {22007#(<= 3 ~counter~0)} #86#return; {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:35,681 INFO L290 TraceCheckUtils]: 65: Hoare triple {22007#(<= 3 ~counter~0)} assume !(~r~0 >= ~d~0); {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:35,682 INFO L290 TraceCheckUtils]: 66: Hoare triple {22007#(<= 3 ~counter~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22062#(<= 4 ~counter~0)} is VALID [2022-04-28 13:06:35,682 INFO L290 TraceCheckUtils]: 67: Hoare triple {22062#(<= 4 ~counter~0)} assume !!(#t~post7 < 5);havoc #t~post7; {22062#(<= 4 ~counter~0)} is VALID [2022-04-28 13:06:35,683 INFO L272 TraceCheckUtils]: 68: Hoare triple {22062#(<= 4 ~counter~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {22062#(<= 4 ~counter~0)} is VALID [2022-04-28 13:06:35,683 INFO L290 TraceCheckUtils]: 69: Hoare triple {22062#(<= 4 ~counter~0)} ~cond := #in~cond; {22062#(<= 4 ~counter~0)} is VALID [2022-04-28 13:06:35,683 INFO L290 TraceCheckUtils]: 70: Hoare triple {22062#(<= 4 ~counter~0)} assume !(0 == ~cond); {22062#(<= 4 ~counter~0)} is VALID [2022-04-28 13:06:35,684 INFO L290 TraceCheckUtils]: 71: Hoare triple {22062#(<= 4 ~counter~0)} assume true; {22062#(<= 4 ~counter~0)} is VALID [2022-04-28 13:06:35,684 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {22062#(<= 4 ~counter~0)} {22062#(<= 4 ~counter~0)} #88#return; {22062#(<= 4 ~counter~0)} is VALID [2022-04-28 13:06:35,685 INFO L272 TraceCheckUtils]: 73: Hoare triple {22062#(<= 4 ~counter~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {22062#(<= 4 ~counter~0)} is VALID [2022-04-28 13:06:35,685 INFO L290 TraceCheckUtils]: 74: Hoare triple {22062#(<= 4 ~counter~0)} ~cond := #in~cond; {22062#(<= 4 ~counter~0)} is VALID [2022-04-28 13:06:35,685 INFO L290 TraceCheckUtils]: 75: Hoare triple {22062#(<= 4 ~counter~0)} assume !(0 == ~cond); {22062#(<= 4 ~counter~0)} is VALID [2022-04-28 13:06:35,685 INFO L290 TraceCheckUtils]: 76: Hoare triple {22062#(<= 4 ~counter~0)} assume true; {22062#(<= 4 ~counter~0)} is VALID [2022-04-28 13:06:35,686 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {22062#(<= 4 ~counter~0)} {22062#(<= 4 ~counter~0)} #90#return; {22062#(<= 4 ~counter~0)} is VALID [2022-04-28 13:06:35,686 INFO L290 TraceCheckUtils]: 78: Hoare triple {22062#(<= 4 ~counter~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); {22062#(<= 4 ~counter~0)} is VALID [2022-04-28 13:06:35,686 INFO L290 TraceCheckUtils]: 79: Hoare triple {22062#(<= 4 ~counter~0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22062#(<= 4 ~counter~0)} is VALID [2022-04-28 13:06:35,687 INFO L290 TraceCheckUtils]: 80: Hoare triple {22062#(<= 4 ~counter~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22105#(<= 5 ~counter~0)} is VALID [2022-04-28 13:06:35,687 INFO L290 TraceCheckUtils]: 81: Hoare triple {22105#(<= 5 ~counter~0)} assume !!(#t~post7 < 5);havoc #t~post7; {22105#(<= 5 ~counter~0)} is VALID [2022-04-28 13:06:35,688 INFO L272 TraceCheckUtils]: 82: Hoare triple {22105#(<= 5 ~counter~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {22105#(<= 5 ~counter~0)} is VALID [2022-04-28 13:06:35,688 INFO L290 TraceCheckUtils]: 83: Hoare triple {22105#(<= 5 ~counter~0)} ~cond := #in~cond; {22105#(<= 5 ~counter~0)} is VALID [2022-04-28 13:06:35,688 INFO L290 TraceCheckUtils]: 84: Hoare triple {22105#(<= 5 ~counter~0)} assume !(0 == ~cond); {22105#(<= 5 ~counter~0)} is VALID [2022-04-28 13:06:35,689 INFO L290 TraceCheckUtils]: 85: Hoare triple {22105#(<= 5 ~counter~0)} assume true; {22105#(<= 5 ~counter~0)} is VALID [2022-04-28 13:06:35,689 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {22105#(<= 5 ~counter~0)} {22105#(<= 5 ~counter~0)} #88#return; {22105#(<= 5 ~counter~0)} is VALID [2022-04-28 13:06:35,690 INFO L272 TraceCheckUtils]: 87: Hoare triple {22105#(<= 5 ~counter~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {22105#(<= 5 ~counter~0)} is VALID [2022-04-28 13:06:35,690 INFO L290 TraceCheckUtils]: 88: Hoare triple {22105#(<= 5 ~counter~0)} ~cond := #in~cond; {22105#(<= 5 ~counter~0)} is VALID [2022-04-28 13:06:35,690 INFO L290 TraceCheckUtils]: 89: Hoare triple {22105#(<= 5 ~counter~0)} assume !(0 == ~cond); {22105#(<= 5 ~counter~0)} is VALID [2022-04-28 13:06:35,690 INFO L290 TraceCheckUtils]: 90: Hoare triple {22105#(<= 5 ~counter~0)} assume true; {22105#(<= 5 ~counter~0)} is VALID [2022-04-28 13:06:35,691 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {22105#(<= 5 ~counter~0)} {22105#(<= 5 ~counter~0)} #90#return; {22105#(<= 5 ~counter~0)} is VALID [2022-04-28 13:06:35,691 INFO L290 TraceCheckUtils]: 92: Hoare triple {22105#(<= 5 ~counter~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); {22105#(<= 5 ~counter~0)} is VALID [2022-04-28 13:06:35,691 INFO L290 TraceCheckUtils]: 93: Hoare triple {22105#(<= 5 ~counter~0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22105#(<= 5 ~counter~0)} is VALID [2022-04-28 13:06:35,692 INFO L290 TraceCheckUtils]: 94: Hoare triple {22105#(<= 5 ~counter~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22148#(<= 5 |main_#t~post7|)} is VALID [2022-04-28 13:06:35,692 INFO L290 TraceCheckUtils]: 95: Hoare triple {22148#(<= 5 |main_#t~post7|)} assume !!(#t~post7 < 5);havoc #t~post7; {21856#false} is VALID [2022-04-28 13:06:35,692 INFO L272 TraceCheckUtils]: 96: Hoare triple {21856#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {21856#false} is VALID [2022-04-28 13:06:35,692 INFO L290 TraceCheckUtils]: 97: Hoare triple {21856#false} ~cond := #in~cond; {21856#false} is VALID [2022-04-28 13:06:35,692 INFO L290 TraceCheckUtils]: 98: Hoare triple {21856#false} assume 0 == ~cond; {21856#false} is VALID [2022-04-28 13:06:35,692 INFO L290 TraceCheckUtils]: 99: Hoare triple {21856#false} assume !false; {21856#false} is VALID [2022-04-28 13:06:35,693 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 322 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 13:06:35,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:06:36,085 INFO L290 TraceCheckUtils]: 99: Hoare triple {21856#false} assume !false; {21856#false} is VALID [2022-04-28 13:06:36,085 INFO L290 TraceCheckUtils]: 98: Hoare triple {21856#false} assume 0 == ~cond; {21856#false} is VALID [2022-04-28 13:06:36,085 INFO L290 TraceCheckUtils]: 97: Hoare triple {21856#false} ~cond := #in~cond; {21856#false} is VALID [2022-04-28 13:06:36,085 INFO L272 TraceCheckUtils]: 96: Hoare triple {21856#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {21856#false} is VALID [2022-04-28 13:06:36,086 INFO L290 TraceCheckUtils]: 95: Hoare triple {22148#(<= 5 |main_#t~post7|)} assume !!(#t~post7 < 5);havoc #t~post7; {21856#false} is VALID [2022-04-28 13:06:36,086 INFO L290 TraceCheckUtils]: 94: Hoare triple {22105#(<= 5 ~counter~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22148#(<= 5 |main_#t~post7|)} is VALID [2022-04-28 13:06:36,086 INFO L290 TraceCheckUtils]: 93: Hoare triple {22105#(<= 5 ~counter~0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22105#(<= 5 ~counter~0)} is VALID [2022-04-28 13:06:36,087 INFO L290 TraceCheckUtils]: 92: Hoare triple {22105#(<= 5 ~counter~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); {22105#(<= 5 ~counter~0)} is VALID [2022-04-28 13:06:36,087 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {21855#true} {22105#(<= 5 ~counter~0)} #90#return; {22105#(<= 5 ~counter~0)} is VALID [2022-04-28 13:06:36,087 INFO L290 TraceCheckUtils]: 90: Hoare triple {21855#true} assume true; {21855#true} is VALID [2022-04-28 13:06:36,087 INFO L290 TraceCheckUtils]: 89: Hoare triple {21855#true} assume !(0 == ~cond); {21855#true} is VALID [2022-04-28 13:06:36,087 INFO L290 TraceCheckUtils]: 88: Hoare triple {21855#true} ~cond := #in~cond; {21855#true} is VALID [2022-04-28 13:06:36,087 INFO L272 TraceCheckUtils]: 87: Hoare triple {22105#(<= 5 ~counter~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {21855#true} is VALID [2022-04-28 13:06:36,088 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21855#true} {22105#(<= 5 ~counter~0)} #88#return; {22105#(<= 5 ~counter~0)} is VALID [2022-04-28 13:06:36,088 INFO L290 TraceCheckUtils]: 85: Hoare triple {21855#true} assume true; {21855#true} is VALID [2022-04-28 13:06:36,088 INFO L290 TraceCheckUtils]: 84: Hoare triple {21855#true} assume !(0 == ~cond); {21855#true} is VALID [2022-04-28 13:06:36,088 INFO L290 TraceCheckUtils]: 83: Hoare triple {21855#true} ~cond := #in~cond; {21855#true} is VALID [2022-04-28 13:06:36,088 INFO L272 TraceCheckUtils]: 82: Hoare triple {22105#(<= 5 ~counter~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {21855#true} is VALID [2022-04-28 13:06:36,088 INFO L290 TraceCheckUtils]: 81: Hoare triple {22105#(<= 5 ~counter~0)} assume !!(#t~post7 < 5);havoc #t~post7; {22105#(<= 5 ~counter~0)} is VALID [2022-04-28 13:06:36,089 INFO L290 TraceCheckUtils]: 80: Hoare triple {22062#(<= 4 ~counter~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22105#(<= 5 ~counter~0)} is VALID [2022-04-28 13:06:36,089 INFO L290 TraceCheckUtils]: 79: Hoare triple {22062#(<= 4 ~counter~0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22062#(<= 4 ~counter~0)} is VALID [2022-04-28 13:06:36,090 INFO L290 TraceCheckUtils]: 78: Hoare triple {22062#(<= 4 ~counter~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); {22062#(<= 4 ~counter~0)} is VALID [2022-04-28 13:06:36,090 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {21855#true} {22062#(<= 4 ~counter~0)} #90#return; {22062#(<= 4 ~counter~0)} is VALID [2022-04-28 13:06:36,090 INFO L290 TraceCheckUtils]: 76: Hoare triple {21855#true} assume true; {21855#true} is VALID [2022-04-28 13:06:36,090 INFO L290 TraceCheckUtils]: 75: Hoare triple {21855#true} assume !(0 == ~cond); {21855#true} is VALID [2022-04-28 13:06:36,090 INFO L290 TraceCheckUtils]: 74: Hoare triple {21855#true} ~cond := #in~cond; {21855#true} is VALID [2022-04-28 13:06:36,090 INFO L272 TraceCheckUtils]: 73: Hoare triple {22062#(<= 4 ~counter~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {21855#true} is VALID [2022-04-28 13:06:36,091 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {21855#true} {22062#(<= 4 ~counter~0)} #88#return; {22062#(<= 4 ~counter~0)} is VALID [2022-04-28 13:06:36,091 INFO L290 TraceCheckUtils]: 71: Hoare triple {21855#true} assume true; {21855#true} is VALID [2022-04-28 13:06:36,091 INFO L290 TraceCheckUtils]: 70: Hoare triple {21855#true} assume !(0 == ~cond); {21855#true} is VALID [2022-04-28 13:06:36,091 INFO L290 TraceCheckUtils]: 69: Hoare triple {21855#true} ~cond := #in~cond; {21855#true} is VALID [2022-04-28 13:06:36,091 INFO L272 TraceCheckUtils]: 68: Hoare triple {22062#(<= 4 ~counter~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {21855#true} is VALID [2022-04-28 13:06:36,091 INFO L290 TraceCheckUtils]: 67: Hoare triple {22062#(<= 4 ~counter~0)} assume !!(#t~post7 < 5);havoc #t~post7; {22062#(<= 4 ~counter~0)} is VALID [2022-04-28 13:06:36,092 INFO L290 TraceCheckUtils]: 66: Hoare triple {22007#(<= 3 ~counter~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22062#(<= 4 ~counter~0)} is VALID [2022-04-28 13:06:36,092 INFO L290 TraceCheckUtils]: 65: Hoare triple {22007#(<= 3 ~counter~0)} assume !(~r~0 >= ~d~0); {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:36,093 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {21855#true} {22007#(<= 3 ~counter~0)} #86#return; {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:36,093 INFO L290 TraceCheckUtils]: 63: Hoare triple {21855#true} assume true; {21855#true} is VALID [2022-04-28 13:06:36,093 INFO L290 TraceCheckUtils]: 62: Hoare triple {21855#true} assume !(0 == ~cond); {21855#true} is VALID [2022-04-28 13:06:36,093 INFO L290 TraceCheckUtils]: 61: Hoare triple {21855#true} ~cond := #in~cond; {21855#true} is VALID [2022-04-28 13:06:36,093 INFO L272 TraceCheckUtils]: 60: Hoare triple {22007#(<= 3 ~counter~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {21855#true} is VALID [2022-04-28 13:06:36,094 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21855#true} {22007#(<= 3 ~counter~0)} #84#return; {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:36,094 INFO L290 TraceCheckUtils]: 58: Hoare triple {21855#true} assume true; {21855#true} is VALID [2022-04-28 13:06:36,094 INFO L290 TraceCheckUtils]: 57: Hoare triple {21855#true} assume !(0 == ~cond); {21855#true} is VALID [2022-04-28 13:06:36,094 INFO L290 TraceCheckUtils]: 56: Hoare triple {21855#true} ~cond := #in~cond; {21855#true} is VALID [2022-04-28 13:06:36,094 INFO L272 TraceCheckUtils]: 55: Hoare triple {22007#(<= 3 ~counter~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {21855#true} is VALID [2022-04-28 13:06:36,094 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21855#true} {22007#(<= 3 ~counter~0)} #82#return; {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:36,094 INFO L290 TraceCheckUtils]: 53: Hoare triple {21855#true} assume true; {21855#true} is VALID [2022-04-28 13:06:36,094 INFO L290 TraceCheckUtils]: 52: Hoare triple {21855#true} assume !(0 == ~cond); {21855#true} is VALID [2022-04-28 13:06:36,094 INFO L290 TraceCheckUtils]: 51: Hoare triple {21855#true} ~cond := #in~cond; {21855#true} is VALID [2022-04-28 13:06:36,094 INFO L272 TraceCheckUtils]: 50: Hoare triple {22007#(<= 3 ~counter~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21855#true} is VALID [2022-04-28 13:06:36,095 INFO L290 TraceCheckUtils]: 49: Hoare triple {22007#(<= 3 ~counter~0)} assume !!(#t~post6 < 5);havoc #t~post6; {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:36,095 INFO L290 TraceCheckUtils]: 48: Hoare triple {21952#(<= 2 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22007#(<= 3 ~counter~0)} is VALID [2022-04-28 13:06:36,096 INFO L290 TraceCheckUtils]: 47: Hoare triple {21952#(<= 2 ~counter~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:36,096 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21855#true} {21952#(<= 2 ~counter~0)} #86#return; {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:36,096 INFO L290 TraceCheckUtils]: 45: Hoare triple {21855#true} assume true; {21855#true} is VALID [2022-04-28 13:06:36,096 INFO L290 TraceCheckUtils]: 44: Hoare triple {21855#true} assume !(0 == ~cond); {21855#true} is VALID [2022-04-28 13:06:36,096 INFO L290 TraceCheckUtils]: 43: Hoare triple {21855#true} ~cond := #in~cond; {21855#true} is VALID [2022-04-28 13:06:36,097 INFO L272 TraceCheckUtils]: 42: Hoare triple {21952#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {21855#true} is VALID [2022-04-28 13:06:36,097 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21855#true} {21952#(<= 2 ~counter~0)} #84#return; {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:36,097 INFO L290 TraceCheckUtils]: 40: Hoare triple {21855#true} assume true; {21855#true} is VALID [2022-04-28 13:06:36,097 INFO L290 TraceCheckUtils]: 39: Hoare triple {21855#true} assume !(0 == ~cond); {21855#true} is VALID [2022-04-28 13:06:36,097 INFO L290 TraceCheckUtils]: 38: Hoare triple {21855#true} ~cond := #in~cond; {21855#true} is VALID [2022-04-28 13:06:36,097 INFO L272 TraceCheckUtils]: 37: Hoare triple {21952#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {21855#true} is VALID [2022-04-28 13:06:36,097 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21855#true} {21952#(<= 2 ~counter~0)} #82#return; {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:36,098 INFO L290 TraceCheckUtils]: 35: Hoare triple {21855#true} assume true; {21855#true} is VALID [2022-04-28 13:06:36,098 INFO L290 TraceCheckUtils]: 34: Hoare triple {21855#true} assume !(0 == ~cond); {21855#true} is VALID [2022-04-28 13:06:36,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {21855#true} ~cond := #in~cond; {21855#true} is VALID [2022-04-28 13:06:36,098 INFO L272 TraceCheckUtils]: 32: Hoare triple {21952#(<= 2 ~counter~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21855#true} is VALID [2022-04-28 13:06:36,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {21952#(<= 2 ~counter~0)} assume !!(#t~post6 < 5);havoc #t~post6; {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:36,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {21897#(<= 1 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21952#(<= 2 ~counter~0)} is VALID [2022-04-28 13:06:36,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {21897#(<= 1 ~counter~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:36,100 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {21855#true} {21897#(<= 1 ~counter~0)} #86#return; {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:36,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {21855#true} assume true; {21855#true} is VALID [2022-04-28 13:06:36,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {21855#true} assume !(0 == ~cond); {21855#true} is VALID [2022-04-28 13:06:36,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {21855#true} ~cond := #in~cond; {21855#true} is VALID [2022-04-28 13:06:36,100 INFO L272 TraceCheckUtils]: 24: Hoare triple {21897#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {21855#true} is VALID [2022-04-28 13:06:36,100 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21855#true} {21897#(<= 1 ~counter~0)} #84#return; {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:36,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {21855#true} assume true; {21855#true} is VALID [2022-04-28 13:06:36,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {21855#true} assume !(0 == ~cond); {21855#true} is VALID [2022-04-28 13:06:36,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {21855#true} ~cond := #in~cond; {21855#true} is VALID [2022-04-28 13:06:36,100 INFO L272 TraceCheckUtils]: 19: Hoare triple {21897#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {21855#true} is VALID [2022-04-28 13:06:36,101 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {21855#true} {21897#(<= 1 ~counter~0)} #82#return; {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:36,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {21855#true} assume true; {21855#true} is VALID [2022-04-28 13:06:36,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {21855#true} assume !(0 == ~cond); {21855#true} is VALID [2022-04-28 13:06:36,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {21855#true} ~cond := #in~cond; {21855#true} is VALID [2022-04-28 13:06:36,101 INFO L272 TraceCheckUtils]: 14: Hoare triple {21897#(<= 1 ~counter~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21855#true} is VALID [2022-04-28 13:06:36,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {21897#(<= 1 ~counter~0)} assume !!(#t~post6 < 5);havoc #t~post6; {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:36,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {21863#(<= 0 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21897#(<= 1 ~counter~0)} is VALID [2022-04-28 13:06:36,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {21863#(<= 0 ~counter~0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {21863#(<= 0 ~counter~0)} is VALID [2022-04-28 13:06:36,103 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21855#true} {21863#(<= 0 ~counter~0)} #80#return; {21863#(<= 0 ~counter~0)} is VALID [2022-04-28 13:06:36,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {21855#true} assume true; {21855#true} is VALID [2022-04-28 13:06:36,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {21855#true} assume !(0 == ~cond); {21855#true} is VALID [2022-04-28 13:06:36,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {21855#true} ~cond := #in~cond; {21855#true} is VALID [2022-04-28 13:06:36,103 INFO L272 TraceCheckUtils]: 6: Hoare triple {21863#(<= 0 ~counter~0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {21855#true} is VALID [2022-04-28 13:06:36,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {21863#(<= 0 ~counter~0)} 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; {21863#(<= 0 ~counter~0)} is VALID [2022-04-28 13:06:36,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {21863#(<= 0 ~counter~0)} call #t~ret8 := main(); {21863#(<= 0 ~counter~0)} is VALID [2022-04-28 13:06:36,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21863#(<= 0 ~counter~0)} {21855#true} #96#return; {21863#(<= 0 ~counter~0)} is VALID [2022-04-28 13:06:36,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {21863#(<= 0 ~counter~0)} assume true; {21863#(<= 0 ~counter~0)} is VALID [2022-04-28 13:06:36,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {21855#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);~counter~0 := 0; {21863#(<= 0 ~counter~0)} is VALID [2022-04-28 13:06:36,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {21855#true} call ULTIMATE.init(); {21855#true} is VALID [2022-04-28 13:06:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 13:06:36,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:06:36,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043679779] [2022-04-28 13:06:36,105 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:06:36,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621264522] [2022-04-28 13:06:36,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621264522] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:06:36,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:06:36,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2022-04-28 13:06:36,106 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:06:36,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1125871387] [2022-04-28 13:06:36,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1125871387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:06:36,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:06:36,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 13:06:36,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139299365] [2022-04-28 13:06:36,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:06:36,106 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (17), 8 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) Word has length 100 [2022-04-28 13:06:36,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:06:36,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (17), 8 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 13:06:36,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:06:36,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 13:06:36,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:06:36,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 13:06:36,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-28 13:06:36,210 INFO L87 Difference]: Start difference. First operand 205 states and 236 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (17), 8 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 13:06:36,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:06:36,915 INFO L93 Difference]: Finished difference Result 234 states and 268 transitions. [2022-04-28 13:06:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 13:06:36,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (17), 8 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) Word has length 100 [2022-04-28 13:06:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:06:36,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (17), 8 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 13:06:36,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2022-04-28 13:06:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (17), 8 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 13:06:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2022-04-28 13:06:36,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 122 transitions. [2022-04-28 13:06:37,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:06:37,088 INFO L225 Difference]: With dead ends: 234 [2022-04-28 13:06:37,088 INFO L226 Difference]: Without dead ends: 160 [2022-04-28 13:06:37,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-04-28 13:06:37,089 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 41 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:06:37,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 234 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:06:37,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-28 13:06:37,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2022-04-28 13:06:37,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:06:37,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 158 states, 106 states have (on average 1.0566037735849056) internal successors, (112), 109 states have internal predecessors, (112), 28 states have call successors, (28), 24 states have call predecessors, (28), 23 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 13:06:37,398 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 158 states, 106 states have (on average 1.0566037735849056) internal successors, (112), 109 states have internal predecessors, (112), 28 states have call successors, (28), 24 states have call predecessors, (28), 23 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 13:06:37,398 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 158 states, 106 states have (on average 1.0566037735849056) internal successors, (112), 109 states have internal predecessors, (112), 28 states have call successors, (28), 24 states have call predecessors, (28), 23 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 13:06:37,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:06:37,400 INFO L93 Difference]: Finished difference Result 160 states and 167 transitions. [2022-04-28 13:06:37,400 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 167 transitions. [2022-04-28 13:06:37,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:06:37,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:06:37,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 106 states have (on average 1.0566037735849056) internal successors, (112), 109 states have internal predecessors, (112), 28 states have call successors, (28), 24 states have call predecessors, (28), 23 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 160 states. [2022-04-28 13:06:37,401 INFO L87 Difference]: Start difference. First operand has 158 states, 106 states have (on average 1.0566037735849056) internal successors, (112), 109 states have internal predecessors, (112), 28 states have call successors, (28), 24 states have call predecessors, (28), 23 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 160 states. [2022-04-28 13:06:37,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:06:37,403 INFO L93 Difference]: Finished difference Result 160 states and 167 transitions. [2022-04-28 13:06:37,403 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 167 transitions. [2022-04-28 13:06:37,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:06:37,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:06:37,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:06:37,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:06:37,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 106 states have (on average 1.0566037735849056) internal successors, (112), 109 states have internal predecessors, (112), 28 states have call successors, (28), 24 states have call predecessors, (28), 23 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 13:06:37,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 165 transitions. [2022-04-28 13:06:37,406 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 165 transitions. Word has length 100 [2022-04-28 13:06:37,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:06:37,406 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 165 transitions. [2022-04-28 13:06:37,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (17), 8 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 13:06:37,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 158 states and 165 transitions. [2022-04-28 13:06:37,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:06:37,787 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 165 transitions. [2022-04-28 13:06:37,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-28 13:06:37,787 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:06:37,787 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-28 13:06:37,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 13:06:37,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:06:37,988 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:06:37,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:06:37,988 INFO L85 PathProgramCache]: Analyzing trace with hash -123017305, now seen corresponding path program 1 times [2022-04-28 13:06:37,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:06:37,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1703636926] [2022-04-28 13:06:43,735 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:06:43,735 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:06:43,735 INFO L85 PathProgramCache]: Analyzing trace with hash -123017305, now seen corresponding path program 2 times [2022-04-28 13:06:43,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:06:43,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309753249] [2022-04-28 13:06:43,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:06:43,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:06:43,753 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:06:43,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2121639282] [2022-04-28 13:06:43,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:06:43,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:06:43,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:06:43,767 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:06:43,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 13:06:43,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:06:43,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:06:43,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 13:06:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:06:43,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:06:44,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {23569#true} call ULTIMATE.init(); {23569#true} is VALID [2022-04-28 13:06:44,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {23569#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);~counter~0 := 0; {23569#true} is VALID [2022-04-28 13:06:44,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {23569#true} assume true; {23569#true} is VALID [2022-04-28 13:06:44,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23569#true} {23569#true} #96#return; {23569#true} is VALID [2022-04-28 13:06:44,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {23569#true} call #t~ret8 := main(); {23569#true} is VALID [2022-04-28 13:06:44,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {23569#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; {23569#true} is VALID [2022-04-28 13:06:44,887 INFO L272 TraceCheckUtils]: 6: Hoare triple {23569#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {23569#true} is VALID [2022-04-28 13:06:44,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {23569#true} ~cond := #in~cond; {23569#true} is VALID [2022-04-28 13:06:44,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {23569#true} assume !(0 == ~cond); {23569#true} is VALID [2022-04-28 13:06:44,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {23569#true} assume true; {23569#true} is VALID [2022-04-28 13:06:44,887 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23569#true} {23569#true} #80#return; {23569#true} is VALID [2022-04-28 13:06:44,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {23569#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {23569#true} is VALID [2022-04-28 13:06:44,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {23569#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23569#true} is VALID [2022-04-28 13:06:44,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {23569#true} assume !!(#t~post6 < 5);havoc #t~post6; {23569#true} is VALID [2022-04-28 13:06:44,887 INFO L272 TraceCheckUtils]: 14: Hoare triple {23569#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {23569#true} is VALID [2022-04-28 13:06:44,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {23569#true} ~cond := #in~cond; {23569#true} is VALID [2022-04-28 13:06:44,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {23569#true} assume !(0 == ~cond); {23569#true} is VALID [2022-04-28 13:06:44,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {23569#true} assume true; {23569#true} is VALID [2022-04-28 13:06:44,887 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {23569#true} {23569#true} #82#return; {23569#true} is VALID [2022-04-28 13:06:44,888 INFO L272 TraceCheckUtils]: 19: Hoare triple {23569#true} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {23569#true} is VALID [2022-04-28 13:06:44,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {23569#true} ~cond := #in~cond; {23569#true} is VALID [2022-04-28 13:06:44,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {23569#true} assume !(0 == ~cond); {23569#true} is VALID [2022-04-28 13:06:44,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {23569#true} assume true; {23569#true} is VALID [2022-04-28 13:06:44,888 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23569#true} {23569#true} #84#return; {23569#true} is VALID [2022-04-28 13:06:44,888 INFO L272 TraceCheckUtils]: 24: Hoare triple {23569#true} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {23569#true} is VALID [2022-04-28 13:06:44,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {23569#true} ~cond := #in~cond; {23569#true} is VALID [2022-04-28 13:06:44,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {23569#true} assume !(0 == ~cond); {23569#true} is VALID [2022-04-28 13:06:44,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {23569#true} assume true; {23569#true} is VALID [2022-04-28 13:06:44,888 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {23569#true} {23569#true} #86#return; {23569#true} is VALID [2022-04-28 13:06:44,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {23569#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {23569#true} is VALID [2022-04-28 13:06:44,888 INFO L290 TraceCheckUtils]: 30: Hoare triple {23569#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23569#true} is VALID [2022-04-28 13:06:44,888 INFO L290 TraceCheckUtils]: 31: Hoare triple {23569#true} assume !!(#t~post6 < 5);havoc #t~post6; {23569#true} is VALID [2022-04-28 13:06:44,888 INFO L272 TraceCheckUtils]: 32: Hoare triple {23569#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {23569#true} is VALID [2022-04-28 13:06:44,888 INFO L290 TraceCheckUtils]: 33: Hoare triple {23569#true} ~cond := #in~cond; {23569#true} is VALID [2022-04-28 13:06:44,888 INFO L290 TraceCheckUtils]: 34: Hoare triple {23569#true} assume !(0 == ~cond); {23569#true} is VALID [2022-04-28 13:06:44,888 INFO L290 TraceCheckUtils]: 35: Hoare triple {23569#true} assume true; {23569#true} is VALID [2022-04-28 13:06:44,888 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {23569#true} {23569#true} #82#return; {23569#true} is VALID [2022-04-28 13:06:44,888 INFO L272 TraceCheckUtils]: 37: Hoare triple {23569#true} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {23569#true} is VALID [2022-04-28 13:06:44,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {23569#true} ~cond := #in~cond; {23569#true} is VALID [2022-04-28 13:06:44,889 INFO L290 TraceCheckUtils]: 39: Hoare triple {23569#true} assume !(0 == ~cond); {23569#true} is VALID [2022-04-28 13:06:44,889 INFO L290 TraceCheckUtils]: 40: Hoare triple {23569#true} assume true; {23569#true} is VALID [2022-04-28 13:06:44,889 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {23569#true} {23569#true} #84#return; {23569#true} is VALID [2022-04-28 13:06:44,889 INFO L272 TraceCheckUtils]: 42: Hoare triple {23569#true} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {23569#true} is VALID [2022-04-28 13:06:44,889 INFO L290 TraceCheckUtils]: 43: Hoare triple {23569#true} ~cond := #in~cond; {23569#true} is VALID [2022-04-28 13:06:44,889 INFO L290 TraceCheckUtils]: 44: Hoare triple {23569#true} assume !(0 == ~cond); {23569#true} is VALID [2022-04-28 13:06:44,889 INFO L290 TraceCheckUtils]: 45: Hoare triple {23569#true} assume true; {23569#true} is VALID [2022-04-28 13:06:44,889 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {23569#true} {23569#true} #86#return; {23569#true} is VALID [2022-04-28 13:06:44,890 INFO L290 TraceCheckUtils]: 47: Hoare triple {23569#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {23715#(<= (div (- main_~d~0) (- 2)) main_~r~0)} is VALID [2022-04-28 13:06:44,890 INFO L290 TraceCheckUtils]: 48: Hoare triple {23715#(<= (div (- main_~d~0) (- 2)) main_~r~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23715#(<= (div (- main_~d~0) (- 2)) main_~r~0)} is VALID [2022-04-28 13:06:44,891 INFO L290 TraceCheckUtils]: 49: Hoare triple {23715#(<= (div (- main_~d~0) (- 2)) main_~r~0)} assume !!(#t~post6 < 5);havoc #t~post6; {23715#(<= (div (- main_~d~0) (- 2)) main_~r~0)} is VALID [2022-04-28 13:06:44,891 INFO L272 TraceCheckUtils]: 50: Hoare triple {23715#(<= (div (- main_~d~0) (- 2)) main_~r~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {23569#true} is VALID [2022-04-28 13:06:44,891 INFO L290 TraceCheckUtils]: 51: Hoare triple {23569#true} ~cond := #in~cond; {23569#true} is VALID [2022-04-28 13:06:44,891 INFO L290 TraceCheckUtils]: 52: Hoare triple {23569#true} assume !(0 == ~cond); {23569#true} is VALID [2022-04-28 13:06:44,891 INFO L290 TraceCheckUtils]: 53: Hoare triple {23569#true} assume true; {23569#true} is VALID [2022-04-28 13:06:44,891 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {23569#true} {23715#(<= (div (- main_~d~0) (- 2)) main_~r~0)} #82#return; {23715#(<= (div (- main_~d~0) (- 2)) main_~r~0)} is VALID [2022-04-28 13:06:44,892 INFO L272 TraceCheckUtils]: 55: Hoare triple {23715#(<= (div (- main_~d~0) (- 2)) main_~r~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {23569#true} is VALID [2022-04-28 13:06:44,892 INFO L290 TraceCheckUtils]: 56: Hoare triple {23569#true} ~cond := #in~cond; {23569#true} is VALID [2022-04-28 13:06:44,892 INFO L290 TraceCheckUtils]: 57: Hoare triple {23569#true} assume !(0 == ~cond); {23569#true} is VALID [2022-04-28 13:06:44,892 INFO L290 TraceCheckUtils]: 58: Hoare triple {23569#true} assume true; {23569#true} is VALID [2022-04-28 13:06:44,892 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23569#true} {23715#(<= (div (- main_~d~0) (- 2)) main_~r~0)} #84#return; {23715#(<= (div (- main_~d~0) (- 2)) main_~r~0)} is VALID [2022-04-28 13:06:44,892 INFO L272 TraceCheckUtils]: 60: Hoare triple {23715#(<= (div (- main_~d~0) (- 2)) main_~r~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {23569#true} is VALID [2022-04-28 13:06:44,892 INFO L290 TraceCheckUtils]: 61: Hoare triple {23569#true} ~cond := #in~cond; {23569#true} is VALID [2022-04-28 13:06:44,892 INFO L290 TraceCheckUtils]: 62: Hoare triple {23569#true} assume !(0 == ~cond); {23569#true} is VALID [2022-04-28 13:06:44,892 INFO L290 TraceCheckUtils]: 63: Hoare triple {23569#true} assume true; {23569#true} is VALID [2022-04-28 13:06:44,893 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {23569#true} {23715#(<= (div (- main_~d~0) (- 2)) main_~r~0)} #86#return; {23715#(<= (div (- main_~d~0) (- 2)) main_~r~0)} is VALID [2022-04-28 13:06:44,893 INFO L290 TraceCheckUtils]: 65: Hoare triple {23715#(<= (div (- main_~d~0) (- 2)) main_~r~0)} assume !(~r~0 >= ~d~0); {23770#(and (not (<= main_~d~0 main_~r~0)) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-28 13:06:44,893 INFO L290 TraceCheckUtils]: 66: Hoare triple {23770#(and (not (<= main_~d~0 main_~r~0)) (<= (div (- main_~d~0) (- 2)) main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23770#(and (not (<= main_~d~0 main_~r~0)) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-28 13:06:44,894 INFO L290 TraceCheckUtils]: 67: Hoare triple {23770#(and (not (<= main_~d~0 main_~r~0)) (<= (div (- main_~d~0) (- 2)) main_~r~0))} assume !!(#t~post7 < 5);havoc #t~post7; {23770#(and (not (<= main_~d~0 main_~r~0)) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-28 13:06:44,894 INFO L272 TraceCheckUtils]: 68: Hoare triple {23770#(and (not (<= main_~d~0 main_~r~0)) (<= (div (- 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)); {23569#true} is VALID [2022-04-28 13:06:44,894 INFO L290 TraceCheckUtils]: 69: Hoare triple {23569#true} ~cond := #in~cond; {23569#true} is VALID [2022-04-28 13:06:44,894 INFO L290 TraceCheckUtils]: 70: Hoare triple {23569#true} assume !(0 == ~cond); {23569#true} is VALID [2022-04-28 13:06:44,894 INFO L290 TraceCheckUtils]: 71: Hoare triple {23569#true} assume true; {23569#true} is VALID [2022-04-28 13:06:44,894 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {23569#true} {23770#(and (not (<= main_~d~0 main_~r~0)) (<= (div (- main_~d~0) (- 2)) main_~r~0))} #88#return; {23770#(and (not (<= main_~d~0 main_~r~0)) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-28 13:06:44,894 INFO L272 TraceCheckUtils]: 73: Hoare triple {23770#(and (not (<= main_~d~0 main_~r~0)) (<= (div (- main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {23569#true} is VALID [2022-04-28 13:06:44,894 INFO L290 TraceCheckUtils]: 74: Hoare triple {23569#true} ~cond := #in~cond; {23569#true} is VALID [2022-04-28 13:06:44,895 INFO L290 TraceCheckUtils]: 75: Hoare triple {23569#true} assume !(0 == ~cond); {23569#true} is VALID [2022-04-28 13:06:44,895 INFO L290 TraceCheckUtils]: 76: Hoare triple {23569#true} assume true; {23569#true} is VALID [2022-04-28 13:06:44,895 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {23569#true} {23770#(and (not (<= main_~d~0 main_~r~0)) (<= (div (- main_~d~0) (- 2)) main_~r~0))} #90#return; {23770#(and (not (<= main_~d~0 main_~r~0)) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-28 13:06:44,897 INFO L290 TraceCheckUtils]: 78: Hoare triple {23770#(and (not (<= main_~d~0 main_~r~0)) (<= (div (- 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); {23810#(and (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~r~0 1)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 13:06:44,897 INFO L290 TraceCheckUtils]: 79: Hoare triple {23810#(and (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~r~0 1)) (<= main_~d~0 main_~r~0))} assume !(~r~0 >= ~d~0); {23570#false} is VALID [2022-04-28 13:06:44,897 INFO L290 TraceCheckUtils]: 80: Hoare triple {23570#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23570#false} is VALID [2022-04-28 13:06:44,897 INFO L290 TraceCheckUtils]: 81: Hoare triple {23570#false} assume !!(#t~post7 < 5);havoc #t~post7; {23570#false} is VALID [2022-04-28 13:06:44,897 INFO L272 TraceCheckUtils]: 82: Hoare triple {23570#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {23570#false} is VALID [2022-04-28 13:06:44,897 INFO L290 TraceCheckUtils]: 83: Hoare triple {23570#false} ~cond := #in~cond; {23570#false} is VALID [2022-04-28 13:06:44,897 INFO L290 TraceCheckUtils]: 84: Hoare triple {23570#false} assume !(0 == ~cond); {23570#false} is VALID [2022-04-28 13:06:44,897 INFO L290 TraceCheckUtils]: 85: Hoare triple {23570#false} assume true; {23570#false} is VALID [2022-04-28 13:06:44,897 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {23570#false} {23570#false} #88#return; {23570#false} is VALID [2022-04-28 13:06:44,897 INFO L272 TraceCheckUtils]: 87: Hoare triple {23570#false} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {23570#false} is VALID [2022-04-28 13:06:44,898 INFO L290 TraceCheckUtils]: 88: Hoare triple {23570#false} ~cond := #in~cond; {23570#false} is VALID [2022-04-28 13:06:44,898 INFO L290 TraceCheckUtils]: 89: Hoare triple {23570#false} assume !(0 == ~cond); {23570#false} is VALID [2022-04-28 13:06:44,898 INFO L290 TraceCheckUtils]: 90: Hoare triple {23570#false} assume true; {23570#false} is VALID [2022-04-28 13:06:44,898 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {23570#false} {23570#false} #90#return; {23570#false} is VALID [2022-04-28 13:06:44,898 INFO L290 TraceCheckUtils]: 92: Hoare triple {23570#false} 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); {23570#false} is VALID [2022-04-28 13:06:44,898 INFO L290 TraceCheckUtils]: 93: Hoare triple {23570#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {23570#false} is VALID [2022-04-28 13:06:44,898 INFO L290 TraceCheckUtils]: 94: Hoare triple {23570#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23570#false} is VALID [2022-04-28 13:06:44,898 INFO L290 TraceCheckUtils]: 95: Hoare triple {23570#false} assume !(#t~post7 < 5);havoc #t~post7; {23570#false} is VALID [2022-04-28 13:06:44,898 INFO L272 TraceCheckUtils]: 96: Hoare triple {23570#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {23570#false} is VALID [2022-04-28 13:06:44,898 INFO L290 TraceCheckUtils]: 97: Hoare triple {23570#false} ~cond := #in~cond; {23570#false} is VALID [2022-04-28 13:06:44,898 INFO L290 TraceCheckUtils]: 98: Hoare triple {23570#false} assume 0 == ~cond; {23570#false} is VALID [2022-04-28 13:06:44,898 INFO L290 TraceCheckUtils]: 99: Hoare triple {23570#false} assume !false; {23570#false} is VALID [2022-04-28 13:06:44,898 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2022-04-28 13:06:44,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 13:06:44,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:06:44,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309753249] [2022-04-28 13:06:44,899 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:06:44,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121639282] [2022-04-28 13:06:44,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121639282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:06:44,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:06:44,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:06:44,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:06:44,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1703636926] [2022-04-28 13:06:44,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1703636926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:06:44,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:06:44,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:06:44,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271710564] [2022-04-28 13:06:44,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:06:44,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 100 [2022-04-28 13:06:44,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:06:44,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 13:06:44,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:06:44,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:06:44,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:06:44,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:06:44,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 13:06:44,970 INFO L87 Difference]: Start difference. First operand 158 states and 165 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 13:06:45,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:06:45,565 INFO L93 Difference]: Finished difference Result 177 states and 184 transitions. [2022-04-28 13:06:45,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 13:06:45,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 100 [2022-04-28 13:06:45,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:06:45,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 13:06:45,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-28 13:06:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 13:06:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-28 13:06:45,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-28 13:06:45,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:06:45,682 INFO L225 Difference]: With dead ends: 177 [2022-04-28 13:06:45,682 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 13:06:45,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 13:06:45,682 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 7 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:06:45,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 112 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:06:45,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 13:06:46,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2022-04-28 13:06:46,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:06:46,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 127 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 86 states have internal predecessors, (88), 23 states have call successors, (23), 20 states have call predecessors, (23), 19 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 13:06:46,005 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 127 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 86 states have internal predecessors, (88), 23 states have call successors, (23), 20 states have call predecessors, (23), 19 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 13:06:46,005 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 127 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 86 states have internal predecessors, (88), 23 states have call successors, (23), 20 states have call predecessors, (23), 19 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 13:06:46,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:06:46,007 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2022-04-28 13:06:46,007 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2022-04-28 13:06:46,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:06:46,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:06:46,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 86 states have internal predecessors, (88), 23 states have call successors, (23), 20 states have call predecessors, (23), 19 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 132 states. [2022-04-28 13:06:46,007 INFO L87 Difference]: Start difference. First operand has 127 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 86 states have internal predecessors, (88), 23 states have call successors, (23), 20 states have call predecessors, (23), 19 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 132 states. [2022-04-28 13:06:46,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:06:46,010 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2022-04-28 13:06:46,010 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2022-04-28 13:06:46,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:06:46,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:06:46,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:06:46,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:06:46,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 86 states have internal predecessors, (88), 23 states have call successors, (23), 20 states have call predecessors, (23), 19 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 13:06:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2022-04-28 13:06:46,012 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 100 [2022-04-28 13:06:46,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:06:46,012 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2022-04-28 13:06:46,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 13:06:46,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 132 transitions. [2022-04-28 13:06:46,342 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-28 13:06:46,342 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2022-04-28 13:06:46,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-28 13:06:46,343 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:06:46,343 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:06:46,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 13:06:46,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-28 13:06:46,543 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:06:46,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:06:46,544 INFO L85 PathProgramCache]: Analyzing trace with hash -392782949, now seen corresponding path program 7 times [2022-04-28 13:06:46,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:06:46,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [75360445] [2022-04-28 13:06:53,062 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:06:53,062 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:06:53,062 INFO L85 PathProgramCache]: Analyzing trace with hash -392782949, now seen corresponding path program 8 times [2022-04-28 13:06:53,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:06:53,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783886159] [2022-04-28 13:06:53,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:06:53,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:06:53,078 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:06:53,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1084388369] [2022-04-28 13:06:53,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:06:53,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:06:53,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:06:53,079 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:06:53,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 13:06:53,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:06:53,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 13:06:53,144 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 13:06:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 13:06:53,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 13:06:53,207 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 13:06:53,207 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 13:06:53,210 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 13:06:53,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 13:06:53,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-28 13:06:53,433 INFO L356 BasicCegarLoop]: Path program histogram: [10, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 13:06:53,436 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 13:06:53,448 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 13:06:53,449 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-28 13:06:53,450 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 13:06:53,450 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 13:06:53,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 01:06:53 BoogieIcfgContainer [2022-04-28 13:06:53,451 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 13:06:53,452 INFO L158 Benchmark]: Toolchain (without parser) took 686809.87ms. Allocated memory was 234.9MB in the beginning and 282.1MB in the end (delta: 47.2MB). Free memory was 180.0MB in the beginning and 114.3MB in the end (delta: 65.6MB). Peak memory consumption was 113.1MB. Max. memory is 8.0GB. [2022-04-28 13:06:53,452 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 234.9MB. Free memory is still 196.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 13:06:53,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 157.00ms. Allocated memory is still 234.9MB. Free memory was 179.8MB in the beginning and 204.8MB in the end (delta: -25.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 13:06:53,452 INFO L158 Benchmark]: Boogie Preprocessor took 36.83ms. Allocated memory is still 234.9MB. Free memory was 204.8MB in the beginning and 203.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 13:06:53,453 INFO L158 Benchmark]: RCFGBuilder took 327.99ms. Allocated memory is still 234.9MB. Free memory was 203.3MB in the beginning and 191.7MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 13:06:53,453 INFO L158 Benchmark]: TraceAbstraction took 686284.50ms. Allocated memory was 234.9MB in the beginning and 282.1MB in the end (delta: 47.2MB). Free memory was 190.7MB in the beginning and 114.3MB in the end (delta: 76.4MB). Peak memory consumption was 124.6MB. Max. memory is 8.0GB. [2022-04-28 13:06:53,453 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 234.9MB. Free memory is still 196.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 157.00ms. Allocated memory is still 234.9MB. Free memory was 179.8MB in the beginning and 204.8MB in the end (delta: -25.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.83ms. Allocated memory is still 234.9MB. Free memory was 204.8MB in the beginning and 203.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 327.99ms. Allocated memory is still 234.9MB. Free memory was 203.3MB in the beginning and 191.7MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 686284.50ms. Allocated memory was 234.9MB in the beginning and 282.1MB in the end (delta: 47.2MB). Free memory was 190.7MB in the beginning and 114.3MB in the end (delta: 76.4MB). Peak memory consumption was 124.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] unsigned int A, B; [L25] long long r, d, p, q; [L26] A = __VERIFIER_nondet_uint() [L27] B = __VERIFIER_nondet_uint() [L28] CALL assume_abort_if_not(B >= 1) [L12] COND FALSE !(!cond) [L28] RET assume_abort_if_not(B >= 1) [L30] r = A [L31] d = B [L32] p = 1 [L33] q = 0 [L35] EXPR counter++ [L35] COND TRUE counter++<5 [L36] CALL __VERIFIER_assert(q == 0) [L15] COND FALSE !(!(cond)) [L36] RET __VERIFIER_assert(q == 0) [L37] CALL __VERIFIER_assert(r == A) [L15] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(r == A) [L38] CALL __VERIFIER_assert(d == B * p) [L15] COND FALSE !(!(cond)) [L38] RET __VERIFIER_assert(d == B * p) [L39] COND FALSE !(!(r >= d)) [L41] d = 2 * d [L42] p = 2 * p [L35] EXPR counter++ [L35] COND TRUE counter++<5 [L36] CALL __VERIFIER_assert(q == 0) [L15] COND FALSE !(!(cond)) [L36] RET __VERIFIER_assert(q == 0) [L37] CALL __VERIFIER_assert(r == A) [L15] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(r == A) [L38] CALL __VERIFIER_assert(d == B * p) [L15] COND FALSE !(!(cond)) [L38] RET __VERIFIER_assert(d == B * p) [L39] COND FALSE !(!(r >= d)) [L41] d = 2 * d [L42] p = 2 * p [L35] EXPR counter++ [L35] COND TRUE counter++<5 [L36] CALL __VERIFIER_assert(q == 0) [L15] COND FALSE !(!(cond)) [L36] RET __VERIFIER_assert(q == 0) [L37] CALL __VERIFIER_assert(r == A) [L15] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(r == A) [L38] CALL __VERIFIER_assert(d == B * p) [L15] COND FALSE !(!(cond)) [L38] RET __VERIFIER_assert(d == B * p) [L39] COND FALSE !(!(r >= d)) [L41] d = 2 * d [L42] p = 2 * p [L35] EXPR counter++ [L35] COND TRUE counter++<5 [L36] CALL __VERIFIER_assert(q == 0) [L15] COND FALSE !(!(cond)) [L36] RET __VERIFIER_assert(q == 0) [L37] CALL __VERIFIER_assert(r == A) [L15] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(r == A) [L38] CALL __VERIFIER_assert(d == B * p) [L15] COND FALSE !(!(cond)) [L38] RET __VERIFIER_assert(d == B * p) [L39] COND TRUE !(r >= d) [L45] EXPR counter++ [L45] COND TRUE counter++<5 [L46] CALL __VERIFIER_assert(A == q*B + r) [L15] COND FALSE !(!(cond)) [L46] RET __VERIFIER_assert(A == q*B + r) [L47] CALL __VERIFIER_assert(d == B*p) [L15] COND FALSE !(!(cond)) [L47] RET __VERIFIER_assert(d == B*p) [L49] COND FALSE !(!(p != 1)) [L51] d = d / 2 [L52] p = p / 2 [L53] COND TRUE r >= d [L54] r = r - d [L55] q = q + p [L45] EXPR counter++ [L45] COND FALSE !(counter++<5) [L59] CALL __VERIFIER_assert(A == d*q + r) [L15] COND TRUE !(cond) [L17] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 686.2s, OverallIterations: 24, TraceHistogramMax: 15, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 55.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 514 SdHoareTripleChecker+Valid, 22.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 446 mSDsluCounter, 3941 SdHoareTripleChecker+Invalid, 22.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5 IncrementalHoareTripleChecker+Unchecked, 2815 mSDsCounter, 303 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2591 IncrementalHoareTripleChecker+Invalid, 2903 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 303 mSolverCounterUnsat, 1126 mSDtfsCounter, 2591 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2541 GetRequests, 2316 SyntacticMatches, 21 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 57.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=20, InterpolantAutomatonStates: 177, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 51 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-28 13:06:53,683 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-04-28 13:06:53,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...