/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench/hard2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:21:07,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:21:07,396 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:21:07,432 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:21:07,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:21:07,433 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:21:07,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:21:07,436 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:21:07,437 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:21:07,438 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:21:07,439 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:21:07,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:21:07,440 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:21:07,441 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:21:07,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:21:07,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:21:07,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:21:07,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:21:07,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:21:07,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:21:07,448 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:21:07,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:21:07,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:21:07,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:21:07,451 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:21:07,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:21:07,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:21:07,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:21:07,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:21:07,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:21:07,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:21:07,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:21:07,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:21:07,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:21:07,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:21:07,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:21:07,459 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:21:07,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:21:07,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:21:07,460 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:21:07,461 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:21:07,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:21:07,463 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:21:07,470 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:21:07,470 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:21:07,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:21:07,471 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:21:07,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:21:07,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:21:07,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:21:07,472 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:21:07,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:21:07,472 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:21:07,472 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:21:07,472 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:21:07,472 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:21:07,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:21:07,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:21:07,473 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:21:07,473 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:21:07,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:21:07,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:21:07,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:21:07,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:21:07,473 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:21:07,473 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:21:07,474 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:21:07,474 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:21:07,474 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 04:21:07,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:21:07,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:21:07,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:21:07,690 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:21:07,691 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:21:07,692 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/hard2.c [2022-04-28 04:21:07,747 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5842735f6/c747f44eba3a486f86e4946b5734961a/FLAG0a00e1aca [2022-04-28 04:21:08,093 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:21:08,094 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/hard2.c [2022-04-28 04:21:08,099 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5842735f6/c747f44eba3a486f86e4946b5734961a/FLAG0a00e1aca [2022-04-28 04:21:08,108 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5842735f6/c747f44eba3a486f86e4946b5734961a [2022-04-28 04:21:08,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:21:08,111 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:21:08,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:21:08,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:21:08,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:21:08,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:21:08" (1/1) ... [2022-04-28 04:21:08,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36b02a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:21:08, skipping insertion in model container [2022-04-28 04:21:08,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:21:08" (1/1) ... [2022-04-28 04:21:08,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:21:08,141 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:21:08,249 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/hard2.c[526,539] [2022-04-28 04:21:08,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:21:08,279 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:21:08,300 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/hard2.c[526,539] [2022-04-28 04:21:08,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:21:08,315 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:21:08,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:21:08 WrapperNode [2022-04-28 04:21:08,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:21:08,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:21:08,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:21:08,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:21:08,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:21:08" (1/1) ... [2022-04-28 04:21:08,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:21:08" (1/1) ... [2022-04-28 04:21:08,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:21:08" (1/1) ... [2022-04-28 04:21:08,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:21:08" (1/1) ... [2022-04-28 04:21:08,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:21:08" (1/1) ... [2022-04-28 04:21:08,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:21:08" (1/1) ... [2022-04-28 04:21:08,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:21:08" (1/1) ... [2022-04-28 04:21:08,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:21:08,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:21:08,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:21:08,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:21:08,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:21:08" (1/1) ... [2022-04-28 04:21:08,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:21:08,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:21:08,367 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 04:21:08,384 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 04:21:08,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:21:08,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:21:08,407 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:21:08,407 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 04:21:08,407 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:21:08,407 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:21:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:21:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:21:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:21:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:21:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 04:21:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 04:21:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:21:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:21:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:21:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:21:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:21:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:21:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:21:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:21:08,457 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:21:08,459 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:21:08,570 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:21:08,577 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:21:08,577 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 04:21:08,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:21:08 BoogieIcfgContainer [2022-04-28 04:21:08,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:21:08,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:21:08,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:21:08,583 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:21:08,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:21:08" (1/3) ... [2022-04-28 04:21:08,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb4dd3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:21:08, skipping insertion in model container [2022-04-28 04:21:08,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:21:08" (2/3) ... [2022-04-28 04:21:08,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb4dd3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:21:08, skipping insertion in model container [2022-04-28 04:21:08,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:21:08" (3/3) ... [2022-04-28 04:21:08,585 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2.c [2022-04-28 04:21:08,595 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:21:08,595 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:21:08,631 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:21:08,637 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@410fb93, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@f5856c6 [2022-04-28 04:21:08,638 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:21:08,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 04:21:08,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 04:21:08,661 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:21:08,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:21:08,662 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:21:08,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:21:08,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1030421658, now seen corresponding path program 1 times [2022-04-28 04:21:08,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:21:08,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [350975576] [2022-04-28 04:21:08,697 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:21:08,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1030421658, now seen corresponding path program 2 times [2022-04-28 04:21:08,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:21:08,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30431075] [2022-04-28 04:21:08,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:21:08,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:21:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:21:08,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:21:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:21:08,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-28 04:21:08,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 04:21:08,987 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #90#return; {32#true} is VALID [2022-04-28 04:21:08,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:21:08,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-28 04:21:08,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 04:21:08,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #90#return; {32#true} is VALID [2022-04-28 04:21:08,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-28 04:21:08,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {37#(= main_~q~0 0)} is VALID [2022-04-28 04:21:08,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#(= main_~q~0 0)} assume !false; {37#(= main_~q~0 0)} is VALID [2022-04-28 04:21:08,994 INFO L272 TraceCheckUtils]: 7: Hoare triple {37#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:21:08,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {39#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:21:08,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {33#false} is VALID [2022-04-28 04:21:08,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 04:21:08,998 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 04:21:08,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:21:08,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30431075] [2022-04-28 04:21:09,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30431075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:21:09,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:21:09,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:21:09,004 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:21:09,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [350975576] [2022-04-28 04:21:09,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [350975576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:21:09,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:21:09,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:21:09,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122136706] [2022-04-28 04:21:09,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:21:09,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 04:21:09,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:21:09,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:21:09,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:21:09,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:21:09,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:21:09,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:21:09,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:21:09,052 INFO L87 Difference]: Start difference. First operand has 29 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:21:09,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:09,633 INFO L93 Difference]: Finished difference Result 66 states and 111 transitions. [2022-04-28 04:21:09,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:21:09,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 04:21:09,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:21:09,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:21:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-28 04:21:09,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:21:09,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-28 04:21:09,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 111 transitions. [2022-04-28 04:21:09,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:21:09,798 INFO L225 Difference]: With dead ends: 66 [2022-04-28 04:21:09,799 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 04:21:09,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:21:09,809 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 39 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:21:09,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 48 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:21:09,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 04:21:09,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2022-04-28 04:21:09,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:21:09,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 04:21:09,838 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 04:21:09,838 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 04:21:09,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:09,843 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-28 04:21:09,843 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-28 04:21:09,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:21:09,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:21:09,845 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 35 states. [2022-04-28 04:21:09,846 INFO L87 Difference]: Start difference. First operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 35 states. [2022-04-28 04:21:09,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:09,853 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-28 04:21:09,853 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-28 04:21:09,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:21:09,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:21:09,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:21:09,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:21:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 04:21:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-04-28 04:21:09,857 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 11 [2022-04-28 04:21:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:21:09,858 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-04-28 04:21:09,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:21:09,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 35 transitions. [2022-04-28 04:21:09,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:21:09,899 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-28 04:21:09,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 04:21:09,906 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:21:09,906 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:21:09,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:21:09,907 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:21:09,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:21:09,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1237898617, now seen corresponding path program 1 times [2022-04-28 04:21:09,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:21:09,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1368806052] [2022-04-28 04:21:09,910 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:21:09,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1237898617, now seen corresponding path program 2 times [2022-04-28 04:21:09,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:21:09,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258657098] [2022-04-28 04:21:09,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:21:09,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:21:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:21:09,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:21:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:21:10,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {309#true} is VALID [2022-04-28 04:21:10,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-28 04:21:10,026 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {309#true} {309#true} #90#return; {309#true} is VALID [2022-04-28 04:21:10,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-28 04:21:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:21:10,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {309#true} ~cond := #in~cond; {309#true} is VALID [2022-04-28 04:21:10,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} assume !(0 == ~cond); {309#true} is VALID [2022-04-28 04:21:10,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-28 04:21:10,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {314#(= main_~A~0 main_~r~0)} #76#return; {314#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 04:21:10,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {309#true} call ULTIMATE.init(); {321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:21:10,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {309#true} is VALID [2022-04-28 04:21:10,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-28 04:21:10,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} #90#return; {309#true} is VALID [2022-04-28 04:21:10,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {309#true} call #t~ret5 := main(); {309#true} is VALID [2022-04-28 04:21:10,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {309#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {314#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 04:21:10,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {314#(= main_~A~0 main_~r~0)} assume !false; {314#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 04:21:10,042 INFO L272 TraceCheckUtils]: 7: Hoare triple {314#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {309#true} is VALID [2022-04-28 04:21:10,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {309#true} ~cond := #in~cond; {309#true} is VALID [2022-04-28 04:21:10,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {309#true} assume !(0 == ~cond); {309#true} is VALID [2022-04-28 04:21:10,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-28 04:21:10,043 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {309#true} {314#(= main_~A~0 main_~r~0)} #76#return; {314#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 04:21:10,044 INFO L272 TraceCheckUtils]: 12: Hoare triple {314#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {319#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:21:10,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {319#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {320#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:21:10,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {320#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {310#false} is VALID [2022-04-28 04:21:10,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {310#false} assume !false; {310#false} is VALID [2022-04-28 04:21:10,045 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 04:21:10,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:21:10,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258657098] [2022-04-28 04:21:10,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258657098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:21:10,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:21:10,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:21:10,047 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:21:10,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1368806052] [2022-04-28 04:21:10,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1368806052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:21:10,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:21:10,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:21:10,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247577669] [2022-04-28 04:21:10,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:21:10,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-28 04:21:10,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:21:10,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:21:10,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:21:10,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:21:10,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:21:10,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:21:10,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:21:10,071 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:21:10,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:10,469 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-04-28 04:21:10,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:21:10,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-28 04:21:10,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:21:10,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:21:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-28 04:21:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:21:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-28 04:21:10,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 49 transitions. [2022-04-28 04:21:10,520 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 04:21:10,522 INFO L225 Difference]: With dead ends: 41 [2022-04-28 04:21:10,522 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 04:21:10,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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 04:21:10,524 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:21:10,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 40 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:21:10,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 04:21:10,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2022-04-28 04:21:10,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:21:10,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 04:21:10,532 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 04:21:10,533 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 04:21:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:10,536 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-28 04:21:10,536 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2022-04-28 04:21:10,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:21:10,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:21:10,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-28 04:21:10,537 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-28 04:21:10,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:10,540 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-28 04:21:10,540 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2022-04-28 04:21:10,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:21:10,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:21:10,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:21:10,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:21:10,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 04:21:10,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-28 04:21:10,544 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 16 [2022-04-28 04:21:10,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:21:10,544 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-28 04:21:10,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:21:10,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-28 04:21:10,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:21:10,584 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-28 04:21:10,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 04:21:10,586 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:21:10,586 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:21:10,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:21:10,589 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:21:10,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:21:10,590 INFO L85 PathProgramCache]: Analyzing trace with hash 998817914, now seen corresponding path program 1 times [2022-04-28 04:21:10,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:21:10,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [457670241] [2022-04-28 04:21:10,593 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:21:10,593 INFO L85 PathProgramCache]: Analyzing trace with hash 998817914, now seen corresponding path program 2 times [2022-04-28 04:21:10,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:21:10,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371243730] [2022-04-28 04:21:10,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:21:10,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:21:10,617 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:21:10,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1269397507] [2022-04-28 04:21:10,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:21:10,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:21:10,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:21:10,643 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 04:21:10,670 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 04:21:10,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:21:10,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:21:10,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:21:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:21:10,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:21:10,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {556#true} call ULTIMATE.init(); {556#true} is VALID [2022-04-28 04:21:10,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {556#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(8, 2);call #Ultimate.allocInit(12, 3); {556#true} is VALID [2022-04-28 04:21:10,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {556#true} assume true; {556#true} is VALID [2022-04-28 04:21:10,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {556#true} {556#true} #90#return; {556#true} is VALID [2022-04-28 04:21:10,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {556#true} call #t~ret5 := main(); {556#true} is VALID [2022-04-28 04:21:10,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {556#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:21:10,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:21:10,930 INFO L272 TraceCheckUtils]: 7: Hoare triple {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {556#true} is VALID [2022-04-28 04:21:10,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {556#true} ~cond := #in~cond; {556#true} is VALID [2022-04-28 04:21:10,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {556#true} assume !(0 == ~cond); {556#true} is VALID [2022-04-28 04:21:10,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {556#true} assume true; {556#true} is VALID [2022-04-28 04:21:10,932 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {556#true} {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #76#return; {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:21:10,932 INFO L272 TraceCheckUtils]: 12: Hoare triple {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {556#true} is VALID [2022-04-28 04:21:10,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {556#true} ~cond := #in~cond; {556#true} is VALID [2022-04-28 04:21:10,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {556#true} assume !(0 == ~cond); {556#true} is VALID [2022-04-28 04:21:10,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {556#true} assume true; {556#true} is VALID [2022-04-28 04:21:10,933 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {556#true} {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:21:10,934 INFO L272 TraceCheckUtils]: 17: Hoare triple {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {613#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:21:10,934 INFO L290 TraceCheckUtils]: 18: Hoare triple {613#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {617#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:21:10,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {617#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {557#false} is VALID [2022-04-28 04:21:10,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {557#false} assume !false; {557#false} is VALID [2022-04-28 04:21:10,935 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 04:21:10,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:21:10,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:21:10,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371243730] [2022-04-28 04:21:10,936 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:21:10,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269397507] [2022-04-28 04:21:10,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269397507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:21:10,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:21:10,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:21:10,937 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:21:10,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [457670241] [2022-04-28 04:21:10,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [457670241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:21:10,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:21:10,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:21:10,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256050986] [2022-04-28 04:21:10,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:21:10,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 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 21 [2022-04-28 04:21:10,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:21:10,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 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 04:21:10,952 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 04:21:10,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:21:10,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:21:10,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:21:10,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:21:10,953 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 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 04:21:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:11,127 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2022-04-28 04:21:11,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:21:11,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 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 21 [2022-04-28 04:21:11,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:21:11,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 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 04:21:11,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-28 04:21:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 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 04:21:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-28 04:21:11,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2022-04-28 04:21:11,191 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 04:21:11,194 INFO L225 Difference]: With dead ends: 60 [2022-04-28 04:21:11,194 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 04:21:11,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 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 04:21:11,198 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:21:11,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 105 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:21:11,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 04:21:11,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 04:21:11,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:21:11,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 04:21:11,225 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 04:21:11,225 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 04:21:11,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:11,231 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-28 04:21:11,231 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-28 04:21:11,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:21:11,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:21:11,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 46 states. [2022-04-28 04:21:11,234 INFO L87 Difference]: Start difference. First operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 46 states. [2022-04-28 04:21:11,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:11,238 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-28 04:21:11,238 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-28 04:21:11,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:21:11,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:21:11,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:21:11,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:21:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 04:21:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2022-04-28 04:21:11,247 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 21 [2022-04-28 04:21:11,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:21:11,247 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2022-04-28 04:21:11,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 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 04:21:11,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 57 transitions. [2022-04-28 04:21:11,307 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 04:21:11,307 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-28 04:21:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 04:21:11,308 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:21:11,308 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] [2022-04-28 04:21:11,330 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 04:21:11,523 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 04:21:11,524 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:21:11,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:21:11,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1073979732, now seen corresponding path program 1 times [2022-04-28 04:21:11,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:21:11,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1497652987] [2022-04-28 04:21:11,524 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:21:11,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1073979732, now seen corresponding path program 2 times [2022-04-28 04:21:11,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:21:11,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142485024] [2022-04-28 04:21:11,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:21:11,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:21:11,535 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:21:11,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [459547147] [2022-04-28 04:21:11,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:21:11,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:21:11,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:21:11,538 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 04:21:11,540 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 04:21:11,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:21:11,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:21:11,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:21:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:21:11,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:21:14,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {929#true} call ULTIMATE.init(); {929#true} is VALID [2022-04-28 04:21:14,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#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(8, 2);call #Ultimate.allocInit(12, 3); {929#true} is VALID [2022-04-28 04:21:14,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-28 04:21:14,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {929#true} {929#true} #90#return; {929#true} is VALID [2022-04-28 04:21:14,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {929#true} call #t~ret5 := main(); {929#true} is VALID [2022-04-28 04:21:14,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {929#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:21:14,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:21:14,624 INFO L272 TraceCheckUtils]: 7: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {929#true} is VALID [2022-04-28 04:21:14,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {929#true} ~cond := #in~cond; {929#true} is VALID [2022-04-28 04:21:14,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {929#true} assume !(0 == ~cond); {929#true} is VALID [2022-04-28 04:21:14,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-28 04:21:14,625 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {929#true} {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #76#return; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:21:14,625 INFO L272 TraceCheckUtils]: 12: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {929#true} is VALID [2022-04-28 04:21:14,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {929#true} ~cond := #in~cond; {929#true} is VALID [2022-04-28 04:21:14,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {929#true} assume !(0 == ~cond); {929#true} is VALID [2022-04-28 04:21:14,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-28 04:21:14,626 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {929#true} {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #78#return; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:21:14,626 INFO L272 TraceCheckUtils]: 17: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {929#true} is VALID [2022-04-28 04:21:14,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {929#true} ~cond := #in~cond; {929#true} is VALID [2022-04-28 04:21:14,626 INFO L290 TraceCheckUtils]: 19: Hoare triple {929#true} assume !(0 == ~cond); {929#true} is VALID [2022-04-28 04:21:14,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-28 04:21:14,627 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {929#true} {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #80#return; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:21:14,628 INFO L290 TraceCheckUtils]: 22: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:21:14,628 INFO L290 TraceCheckUtils]: 23: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:21:14,629 INFO L272 TraceCheckUtils]: 24: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {1007#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:21:14,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {1007#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1011#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:21:14,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {1011#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {930#false} is VALID [2022-04-28 04:21:14,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {930#false} assume !false; {930#false} is VALID [2022-04-28 04:21:14,630 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 04:21:14,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:21:14,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:21:14,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142485024] [2022-04-28 04:21:14,630 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:21:14,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459547147] [2022-04-28 04:21:14,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459547147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:21:14,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:21:14,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:21:14,631 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:21:14,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1497652987] [2022-04-28 04:21:14,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1497652987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:21:14,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:21:14,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:21:14,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330061457] [2022-04-28 04:21:14,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:21:14,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 04:21:14,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:21:14,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 04:21:14,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:21:14,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:21:14,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:21:14,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:21:14,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:21:14,653 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 04:21:14,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:14,844 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2022-04-28 04:21:14,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:21:14,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 04:21:14,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:21:14,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 04:21:14,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-28 04:21:14,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 04:21:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-28 04:21:14,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2022-04-28 04:21:14,895 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 04:21:14,897 INFO L225 Difference]: With dead ends: 59 [2022-04-28 04:21:14,897 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 04:21:14,898 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 04:21:14,898 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:21:14,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 81 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:21:14,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 04:21:14,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-04-28 04:21:14,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:21:14,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 04:21:14,928 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 04:21:14,928 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 04:21:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:14,930 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-04-28 04:21:14,931 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-04-28 04:21:14,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:21:14,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:21:14,931 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 52 states. [2022-04-28 04:21:14,932 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 52 states. [2022-04-28 04:21:14,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:14,934 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-04-28 04:21:14,934 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-04-28 04:21:14,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:21:14,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:21:14,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:21:14,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:21:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 04:21:14,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2022-04-28 04:21:14,937 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 28 [2022-04-28 04:21:14,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:21:14,937 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2022-04-28 04:21:14,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 04:21:14,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 63 transitions. [2022-04-28 04:21:15,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:21:15,011 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-28 04:21:15,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 04:21:15,012 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:21:15,012 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:21:15,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 04:21:15,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 04:21:15,235 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:21:15,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:21:15,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1568039909, now seen corresponding path program 1 times [2022-04-28 04:21:15,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:21:15,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1573014184] [2022-04-28 04:21:17,631 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:21:17,632 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 04:21:17,632 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:21:17,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1568039909, now seen corresponding path program 2 times [2022-04-28 04:21:17,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:21:17,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147363472] [2022-04-28 04:21:17,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:21:17,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:21:17,643 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:21:17,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [711294761] [2022-04-28 04:21:17,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:21:17,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:21:17,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:21:17,645 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 04:21:17,669 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 04:21:17,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:21:17,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:21:17,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 04:21:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:21:17,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:21:17,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {1343#true} call ULTIMATE.init(); {1343#true} is VALID [2022-04-28 04:21:17,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {1343#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(8, 2);call #Ultimate.allocInit(12, 3); {1343#true} is VALID [2022-04-28 04:21:17,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 04:21:17,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1343#true} {1343#true} #90#return; {1343#true} is VALID [2022-04-28 04:21:17,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {1343#true} call #t~ret5 := main(); {1343#true} is VALID [2022-04-28 04:21:17,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {1343#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:21:17,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:21:17,955 INFO L272 TraceCheckUtils]: 7: Hoare triple {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1343#true} is VALID [2022-04-28 04:21:17,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-28 04:21:17,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-28 04:21:17,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 04:21:17,956 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1343#true} {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #76#return; {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:21:17,957 INFO L272 TraceCheckUtils]: 12: Hoare triple {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1343#true} is VALID [2022-04-28 04:21:17,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-28 04:21:17,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-28 04:21:17,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 04:21:17,958 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1343#true} {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:21:17,958 INFO L272 TraceCheckUtils]: 17: Hoare triple {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1343#true} is VALID [2022-04-28 04:21:17,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-28 04:21:17,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-28 04:21:17,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 04:21:17,961 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1343#true} {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:21:17,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 04:21:17,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} assume !false; {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 04:21:17,962 INFO L272 TraceCheckUtils]: 24: Hoare triple {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1343#true} is VALID [2022-04-28 04:21:17,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-28 04:21:17,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-28 04:21:17,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 04:21:17,964 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1343#true} {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #76#return; {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 04:21:17,965 INFO L272 TraceCheckUtils]: 29: Hoare triple {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1343#true} is VALID [2022-04-28 04:21:17,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-28 04:21:17,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-28 04:21:17,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 04:21:17,980 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1343#true} {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #78#return; {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 04:21:17,981 INFO L272 TraceCheckUtils]: 34: Hoare triple {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1452#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:21:17,981 INFO L290 TraceCheckUtils]: 35: Hoare triple {1452#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1456#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:21:17,982 INFO L290 TraceCheckUtils]: 36: Hoare triple {1456#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1344#false} is VALID [2022-04-28 04:21:17,982 INFO L290 TraceCheckUtils]: 37: Hoare triple {1344#false} assume !false; {1344#false} is VALID [2022-04-28 04:21:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 04:21:17,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:21:18,178 INFO L290 TraceCheckUtils]: 37: Hoare triple {1344#false} assume !false; {1344#false} is VALID [2022-04-28 04:21:18,179 INFO L290 TraceCheckUtils]: 36: Hoare triple {1456#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1344#false} is VALID [2022-04-28 04:21:18,180 INFO L290 TraceCheckUtils]: 35: Hoare triple {1452#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1456#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:21:18,181 INFO L272 TraceCheckUtils]: 34: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1452#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:21:18,182 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1343#true} {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 04:21:18,182 INFO L290 TraceCheckUtils]: 32: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 04:21:18,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-28 04:21:18,183 INFO L290 TraceCheckUtils]: 30: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-28 04:21:18,183 INFO L272 TraceCheckUtils]: 29: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1343#true} is VALID [2022-04-28 04:21:18,183 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1343#true} {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} #76#return; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 04:21:18,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 04:21:18,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-28 04:21:18,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-28 04:21:18,184 INFO L272 TraceCheckUtils]: 24: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1343#true} is VALID [2022-04-28 04:21:18,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !false; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 04:21:18,187 INFO L290 TraceCheckUtils]: 22: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 04:21:18,188 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1343#true} {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 04:21:18,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 04:21:18,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-28 04:21:18,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-28 04:21:18,188 INFO L272 TraceCheckUtils]: 17: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1343#true} is VALID [2022-04-28 04:21:18,189 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1343#true} {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 04:21:18,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 04:21:18,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-28 04:21:18,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-28 04:21:18,189 INFO L272 TraceCheckUtils]: 12: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1343#true} is VALID [2022-04-28 04:21:18,190 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1343#true} {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} #76#return; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 04:21:18,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 04:21:18,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-28 04:21:18,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-28 04:21:18,191 INFO L272 TraceCheckUtils]: 7: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1343#true} is VALID [2022-04-28 04:21:18,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !false; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 04:21:18,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {1343#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 04:21:18,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {1343#true} call #t~ret5 := main(); {1343#true} is VALID [2022-04-28 04:21:18,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1343#true} {1343#true} #90#return; {1343#true} is VALID [2022-04-28 04:21:18,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 04:21:18,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {1343#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(8, 2);call #Ultimate.allocInit(12, 3); {1343#true} is VALID [2022-04-28 04:21:18,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {1343#true} call ULTIMATE.init(); {1343#true} is VALID [2022-04-28 04:21:18,194 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 04:21:18,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:21:18,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147363472] [2022-04-28 04:21:18,194 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:21:18,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711294761] [2022-04-28 04:21:18,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711294761] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 04:21:18,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 04:21:18,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 04:21:18,195 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:21:18,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1573014184] [2022-04-28 04:21:18,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1573014184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:21:18,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:21:18,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:21:18,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462439398] [2022-04-28 04:21:18,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:21:18,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 38 [2022-04-28 04:21:18,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:21:18,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 04:21:18,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:21:18,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:21:18,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:21:18,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:21:18,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 04:21:18,217 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 04:21:19,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:19,606 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2022-04-28 04:21:19,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:21:19,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 38 [2022-04-28 04:21:19,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:21:19,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 04:21:19,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 04:21:19,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 04:21:19,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 04:21:19,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-28 04:21:19,655 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 04:21:19,659 INFO L225 Difference]: With dead ends: 63 [2022-04-28 04:21:19,659 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 04:21:19,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 04:21:19,660 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:21:19,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 89 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:21:19,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 04:21:19,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2022-04-28 04:21:19,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:21:19,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 04:21:19,694 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 04:21:19,695 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 04:21:19,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:19,698 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2022-04-28 04:21:19,698 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2022-04-28 04:21:19,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:21:19,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:21:19,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 61 states. [2022-04-28 04:21:19,701 INFO L87 Difference]: Start difference. First operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 61 states. [2022-04-28 04:21:19,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:19,704 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2022-04-28 04:21:19,704 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2022-04-28 04:21:19,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:21:19,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:21:19,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:21:19,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:21:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 04:21:19,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2022-04-28 04:21:19,709 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 38 [2022-04-28 04:21:19,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:21:19,710 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2022-04-28 04:21:19,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 04:21:19,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 71 transitions. [2022-04-28 04:21:19,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:21:19,799 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-04-28 04:21:19,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 04:21:19,800 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:21:19,801 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] [2022-04-28 04:21:19,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 04:21:20,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:21:20,002 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:21:20,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:21:20,002 INFO L85 PathProgramCache]: Analyzing trace with hash -697745896, now seen corresponding path program 1 times [2022-04-28 04:21:20,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:21:20,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1618996315] [2022-04-28 04:21:24,127 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:21:24,127 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 04:21:24,127 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:21:24,128 INFO L85 PathProgramCache]: Analyzing trace with hash -697745896, now seen corresponding path program 2 times [2022-04-28 04:21:24,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:21:24,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407751717] [2022-04-28 04:21:24,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:21:24,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:21:24,139 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:21:24,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [532286593] [2022-04-28 04:21:24,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:21:24,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:21:24,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:21:24,144 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 04:21:24,152 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 04:21:24,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:21:24,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:21:24,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 04:21:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:21:24,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:21:24,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {1943#true} call ULTIMATE.init(); {1943#true} is VALID [2022-04-28 04:21:24,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {1943#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(8, 2);call #Ultimate.allocInit(12, 3); {1943#true} is VALID [2022-04-28 04:21:24,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 04:21:24,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1943#true} {1943#true} #90#return; {1943#true} is VALID [2022-04-28 04:21:24,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {1943#true} call #t~ret5 := main(); {1943#true} is VALID [2022-04-28 04:21:24,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {1943#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:21:24,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:21:24,742 INFO L272 TraceCheckUtils]: 7: Hoare triple {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 04:21:24,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 04:21:24,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 04:21:24,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 04:21:24,744 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1943#true} {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #76#return; {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:21:24,744 INFO L272 TraceCheckUtils]: 12: Hoare triple {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 04:21:24,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 04:21:24,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 04:21:24,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 04:21:24,745 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1943#true} {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:21:24,745 INFO L272 TraceCheckUtils]: 17: Hoare triple {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 04:21:24,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 04:21:24,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 04:21:24,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 04:21:24,747 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1943#true} {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:21:24,747 INFO L290 TraceCheckUtils]: 22: Hoare triple {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:21:24,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !false; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:21:24,748 INFO L272 TraceCheckUtils]: 24: Hoare triple {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 04:21:24,748 INFO L290 TraceCheckUtils]: 25: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 04:21:24,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 04:21:24,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 04:21:24,749 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1943#true} {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #76#return; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:21:24,749 INFO L272 TraceCheckUtils]: 29: Hoare triple {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 04:21:24,749 INFO L290 TraceCheckUtils]: 30: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 04:21:24,749 INFO L290 TraceCheckUtils]: 31: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 04:21:24,749 INFO L290 TraceCheckUtils]: 32: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 04:21:24,750 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1943#true} {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:21:24,750 INFO L272 TraceCheckUtils]: 34: Hoare triple {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 04:21:24,750 INFO L290 TraceCheckUtils]: 35: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 04:21:24,750 INFO L290 TraceCheckUtils]: 36: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 04:21:24,751 INFO L290 TraceCheckUtils]: 37: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 04:21:24,751 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1943#true} {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:21:24,752 INFO L290 TraceCheckUtils]: 39: Hoare triple {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !(~r~0 >= ~d~0); {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:21:24,752 INFO L290 TraceCheckUtils]: 40: Hoare triple {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !false; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:21:24,753 INFO L272 TraceCheckUtils]: 41: Hoare triple {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 04:21:24,753 INFO L290 TraceCheckUtils]: 42: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 04:21:24,753 INFO L290 TraceCheckUtils]: 43: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 04:21:24,753 INFO L290 TraceCheckUtils]: 44: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 04:21:24,754 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1943#true} {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:21:24,754 INFO L272 TraceCheckUtils]: 46: Hoare triple {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 04:21:24,754 INFO L290 TraceCheckUtils]: 47: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 04:21:24,754 INFO L290 TraceCheckUtils]: 48: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 04:21:24,754 INFO L290 TraceCheckUtils]: 49: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 04:21:24,755 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1943#true} {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #84#return; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:21:24,755 INFO L290 TraceCheckUtils]: 51: Hoare triple {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} 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); {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:21:24,756 INFO L290 TraceCheckUtils]: 52: Hoare triple {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {2106#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-28 04:21:24,757 INFO L290 TraceCheckUtils]: 53: Hoare triple {2106#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} assume !false; {2106#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-28 04:21:24,776 INFO L272 TraceCheckUtils]: 54: Hoare triple {2106#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {2113#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:21:24,776 INFO L290 TraceCheckUtils]: 55: Hoare triple {2113#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2117#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:21:24,777 INFO L290 TraceCheckUtils]: 56: Hoare triple {2117#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1944#false} is VALID [2022-04-28 04:21:24,777 INFO L290 TraceCheckUtils]: 57: Hoare triple {1944#false} assume !false; {1944#false} is VALID [2022-04-28 04:21:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 04:21:24,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:21:26,004 INFO L290 TraceCheckUtils]: 57: Hoare triple {1944#false} assume !false; {1944#false} is VALID [2022-04-28 04:21:26,005 INFO L290 TraceCheckUtils]: 56: Hoare triple {2117#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1944#false} is VALID [2022-04-28 04:21:26,005 INFO L290 TraceCheckUtils]: 55: Hoare triple {2113#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2117#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:21:26,006 INFO L272 TraceCheckUtils]: 54: Hoare triple {2133#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {2113#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:21:26,006 INFO L290 TraceCheckUtils]: 53: Hoare triple {2133#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !false; {2133#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 04:21:26,022 INFO L290 TraceCheckUtils]: 52: Hoare triple {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {2133#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 04:21:26,050 INFO L290 TraceCheckUtils]: 51: Hoare triple {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} 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); {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 04:21:26,051 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1943#true} {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #84#return; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 04:21:26,051 INFO L290 TraceCheckUtils]: 49: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 04:21:26,051 INFO L290 TraceCheckUtils]: 48: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 04:21:26,051 INFO L290 TraceCheckUtils]: 47: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 04:21:26,051 INFO L272 TraceCheckUtils]: 46: Hoare triple {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 04:21:26,056 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1943#true} {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #82#return; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 04:21:26,056 INFO L290 TraceCheckUtils]: 44: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 04:21:26,056 INFO L290 TraceCheckUtils]: 43: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 04:21:26,056 INFO L290 TraceCheckUtils]: 42: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 04:21:26,056 INFO L272 TraceCheckUtils]: 41: Hoare triple {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 04:21:26,057 INFO L290 TraceCheckUtils]: 40: Hoare triple {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !false; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 04:21:26,059 INFO L290 TraceCheckUtils]: 39: Hoare triple {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !(~r~0 >= ~d~0); {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 04:21:26,059 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1943#true} {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #80#return; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 04:21:26,059 INFO L290 TraceCheckUtils]: 37: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 04:21:26,060 INFO L290 TraceCheckUtils]: 36: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 04:21:26,060 INFO L290 TraceCheckUtils]: 35: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 04:21:26,060 INFO L272 TraceCheckUtils]: 34: Hoare triple {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 04:21:26,066 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1943#true} {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #78#return; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 04:21:26,066 INFO L290 TraceCheckUtils]: 32: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 04:21:26,066 INFO L290 TraceCheckUtils]: 31: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 04:21:26,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 04:21:26,066 INFO L272 TraceCheckUtils]: 29: Hoare triple {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 04:21:26,067 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1943#true} {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #76#return; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 04:21:26,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 04:21:26,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 04:21:26,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 04:21:26,068 INFO L272 TraceCheckUtils]: 24: Hoare triple {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 04:21:26,070 INFO L290 TraceCheckUtils]: 23: Hoare triple {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !false; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 04:21:26,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 04:21:26,088 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1943#true} {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #80#return; {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 04:21:26,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 04:21:26,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 04:21:26,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 04:21:26,088 INFO L272 TraceCheckUtils]: 17: Hoare triple {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 04:21:26,089 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1943#true} {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #78#return; {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 04:21:26,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 04:21:26,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 04:21:26,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 04:21:26,089 INFO L272 TraceCheckUtils]: 12: Hoare triple {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 04:21:26,090 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1943#true} {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #76#return; {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 04:21:26,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 04:21:26,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 04:21:26,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 04:21:26,091 INFO L272 TraceCheckUtils]: 7: Hoare triple {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 04:21:26,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume !false; {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 04:21:26,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {1943#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 04:21:26,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {1943#true} call #t~ret5 := main(); {1943#true} is VALID [2022-04-28 04:21:26,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1943#true} {1943#true} #90#return; {1943#true} is VALID [2022-04-28 04:21:26,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 04:21:26,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {1943#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(8, 2);call #Ultimate.allocInit(12, 3); {1943#true} is VALID [2022-04-28 04:21:26,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {1943#true} call ULTIMATE.init(); {1943#true} is VALID [2022-04-28 04:21:26,093 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 04:21:26,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:21:26,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407751717] [2022-04-28 04:21:26,093 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:21:26,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532286593] [2022-04-28 04:21:26,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532286593] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:21:26,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:21:26,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-28 04:21:26,094 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:21:26,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1618996315] [2022-04-28 04:21:26,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1618996315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:21:26,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:21:26,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:21:26,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517931015] [2022-04-28 04:21:26,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:21:26,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 58 [2022-04-28 04:21:26,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:21:26,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 04:21:26,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:21:26,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:21:26,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:21:26,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:21:26,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:21:26,136 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 04:21:26,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:26,781 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2022-04-28 04:21:26,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:21:26,781 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 58 [2022-04-28 04:21:26,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:21:26,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 04:21:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-28 04:21:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 04:21:26,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-28 04:21:26,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2022-04-28 04:21:26,877 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 04:21:26,880 INFO L225 Difference]: With dead ends: 124 [2022-04-28 04:21:26,880 INFO L226 Difference]: Without dead ends: 95 [2022-04-28 04:21:26,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 04:21:26,881 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:21:26,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 142 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:21:26,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-28 04:21:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2022-04-28 04:21:26,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:21:26,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 59 states have internal predecessors, (65), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 04:21:26,938 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 59 states have internal predecessors, (65), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 04:21:26,938 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 59 states have internal predecessors, (65), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 04:21:26,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:26,942 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2022-04-28 04:21:26,942 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2022-04-28 04:21:26,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:21:26,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:21:26,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 59 states have internal predecessors, (65), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) Second operand 95 states. [2022-04-28 04:21:26,943 INFO L87 Difference]: Start difference. First operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 59 states have internal predecessors, (65), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) Second operand 95 states. [2022-04-28 04:21:26,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:26,946 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2022-04-28 04:21:26,947 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2022-04-28 04:21:26,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:21:26,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:21:26,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:21:26,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:21:26,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 59 states have internal predecessors, (65), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 04:21:26,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2022-04-28 04:21:26,951 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 58 [2022-04-28 04:21:26,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:21:26,951 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2022-04-28 04:21:26,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 04:21:26,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 111 transitions. [2022-04-28 04:21:27,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:21:27,084 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2022-04-28 04:21:27,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 04:21:27,085 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:21:27,085 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:21:27,110 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 04:21:27,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:21:27,299 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:21:27,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:21:27,300 INFO L85 PathProgramCache]: Analyzing trace with hash -833392887, now seen corresponding path program 3 times [2022-04-28 04:21:27,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:21:27,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1258882561] [2022-04-28 04:21:31,411 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:21:31,412 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 04:21:31,412 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:21:31,412 INFO L85 PathProgramCache]: Analyzing trace with hash -833392887, now seen corresponding path program 4 times [2022-04-28 04:21:31,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:21:31,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952390137] [2022-04-28 04:21:31,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:21:31,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:21:31,423 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:21:31,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [799438592] [2022-04-28 04:21:31,423 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:21:31,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:21:31,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:21:31,428 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 04:21:31,434 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 04:21:31,488 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:21:31,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:21:31,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 04:21:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:21:31,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:21:40,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {2926#true} call ULTIMATE.init(); {2926#true} is VALID [2022-04-28 04:21:40,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {2926#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(8, 2);call #Ultimate.allocInit(12, 3); {2926#true} is VALID [2022-04-28 04:21:40,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {2926#true} assume true; {2926#true} is VALID [2022-04-28 04:21:40,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2926#true} {2926#true} #90#return; {2926#true} is VALID [2022-04-28 04:21:40,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {2926#true} call #t~ret5 := main(); {2926#true} is VALID [2022-04-28 04:21:40,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {2926#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2926#true} is VALID [2022-04-28 04:21:40,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {2926#true} assume !false; {2926#true} is VALID [2022-04-28 04:21:40,244 INFO L272 TraceCheckUtils]: 7: Hoare triple {2926#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2926#true} is VALID [2022-04-28 04:21:40,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {2926#true} ~cond := #in~cond; {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:21:40,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:21:40,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:21:40,246 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} {2926#true} #76#return; {2966#(= main_~q~0 0)} is VALID [2022-04-28 04:21:40,246 INFO L272 TraceCheckUtils]: 12: Hoare triple {2966#(= main_~q~0 0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2926#true} is VALID [2022-04-28 04:21:40,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {2926#true} ~cond := #in~cond; {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:21:40,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:21:40,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:21:40,248 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} {2966#(= main_~q~0 0)} #78#return; {2982#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:21:40,248 INFO L272 TraceCheckUtils]: 17: Hoare triple {2982#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2926#true} is VALID [2022-04-28 04:21:40,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {2926#true} ~cond := #in~cond; {2926#true} is VALID [2022-04-28 04:21:40,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {2926#true} assume !(0 == ~cond); {2926#true} is VALID [2022-04-28 04:21:40,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {2926#true} assume true; {2926#true} is VALID [2022-04-28 04:21:40,249 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2926#true} {2982#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #80#return; {2982#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:21:40,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {2982#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:21:40,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !false; {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:21:40,251 INFO L272 TraceCheckUtils]: 24: Hoare triple {3001#(and (= main_~A~0 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)); {2926#true} is VALID [2022-04-28 04:21:40,251 INFO L290 TraceCheckUtils]: 25: Hoare triple {2926#true} ~cond := #in~cond; {2926#true} is VALID [2022-04-28 04:21:40,251 INFO L290 TraceCheckUtils]: 26: Hoare triple {2926#true} assume !(0 == ~cond); {2926#true} is VALID [2022-04-28 04:21:40,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {2926#true} assume true; {2926#true} is VALID [2022-04-28 04:21:40,252 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2926#true} {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #76#return; {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:21:40,252 INFO L272 TraceCheckUtils]: 29: Hoare triple {3001#(and (= main_~A~0 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 then 1 else 0)); {2926#true} is VALID [2022-04-28 04:21:40,252 INFO L290 TraceCheckUtils]: 30: Hoare triple {2926#true} ~cond := #in~cond; {2926#true} is VALID [2022-04-28 04:21:40,252 INFO L290 TraceCheckUtils]: 31: Hoare triple {2926#true} assume !(0 == ~cond); {2926#true} is VALID [2022-04-28 04:21:40,252 INFO L290 TraceCheckUtils]: 32: Hoare triple {2926#true} assume true; {2926#true} is VALID [2022-04-28 04:21:40,254 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2926#true} {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #78#return; {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:21:40,254 INFO L272 TraceCheckUtils]: 34: Hoare triple {3001#(and (= main_~A~0 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 * ~p~0 then 1 else 0)); {2926#true} is VALID [2022-04-28 04:21:40,254 INFO L290 TraceCheckUtils]: 35: Hoare triple {2926#true} ~cond := #in~cond; {2926#true} is VALID [2022-04-28 04:21:40,254 INFO L290 TraceCheckUtils]: 36: Hoare triple {2926#true} assume !(0 == ~cond); {2926#true} is VALID [2022-04-28 04:21:40,254 INFO L290 TraceCheckUtils]: 37: Hoare triple {2926#true} assume true; {2926#true} is VALID [2022-04-28 04:21:40,255 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2926#true} {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #80#return; {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:21:40,256 INFO L290 TraceCheckUtils]: 39: Hoare triple {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:21:40,256 INFO L290 TraceCheckUtils]: 40: Hoare triple {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !false; {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:21:40,256 INFO L272 TraceCheckUtils]: 41: Hoare triple {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {2926#true} is VALID [2022-04-28 04:21:40,257 INFO L290 TraceCheckUtils]: 42: Hoare triple {2926#true} ~cond := #in~cond; {2926#true} is VALID [2022-04-28 04:21:40,257 INFO L290 TraceCheckUtils]: 43: Hoare triple {2926#true} assume !(0 == ~cond); {2926#true} is VALID [2022-04-28 04:21:40,257 INFO L290 TraceCheckUtils]: 44: Hoare triple {2926#true} assume true; {2926#true} is VALID [2022-04-28 04:21:40,257 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2926#true} {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #82#return; {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:21:40,258 INFO L272 TraceCheckUtils]: 46: Hoare triple {3001#(and (= main_~A~0 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 * ~p~0 then 1 else 0)); {2926#true} is VALID [2022-04-28 04:21:40,258 INFO L290 TraceCheckUtils]: 47: Hoare triple {2926#true} ~cond := #in~cond; {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:21:40,258 INFO L290 TraceCheckUtils]: 48: Hoare triple {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:21:40,259 INFO L290 TraceCheckUtils]: 49: Hoare triple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:21:40,260 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #84#return; {3086#(and (= main_~A~0 main_~r~0) (= (mod (* main_~B~0 main_~p~0) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:21:40,261 INFO L290 TraceCheckUtils]: 51: Hoare triple {3086#(and (= main_~A~0 main_~r~0) (= (mod (* main_~B~0 main_~p~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); {2982#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:21:40,261 INFO L290 TraceCheckUtils]: 52: Hoare triple {2982#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {3093#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 04:21:40,262 INFO L290 TraceCheckUtils]: 53: Hoare triple {3093#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} assume !false; {3093#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 04:21:40,264 INFO L272 TraceCheckUtils]: 54: Hoare triple {3093#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {2926#true} is VALID [2022-04-28 04:21:40,264 INFO L290 TraceCheckUtils]: 55: Hoare triple {2926#true} ~cond := #in~cond; {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:21:40,265 INFO L290 TraceCheckUtils]: 56: Hoare triple {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:21:40,265 INFO L290 TraceCheckUtils]: 57: Hoare triple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:21:40,267 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} {3093#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #82#return; {3112#(exists ((main_~A~0 Int)) (= (+ (* (- 1) main_~B~0 main_~p~0) main_~A~0) (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 04:21:40,267 INFO L272 TraceCheckUtils]: 59: Hoare triple {3112#(exists ((main_~A~0 Int)) (= (+ (* (- 1) main_~B~0 main_~p~0) main_~A~0) (+ (* (- 1) main_~d~0) main_~A~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3116#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:21:40,268 INFO L290 TraceCheckUtils]: 60: Hoare triple {3116#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3120#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:21:40,268 INFO L290 TraceCheckUtils]: 61: Hoare triple {3120#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2927#false} is VALID [2022-04-28 04:21:40,268 INFO L290 TraceCheckUtils]: 62: Hoare triple {2927#false} assume !false; {2927#false} is VALID [2022-04-28 04:21:40,269 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 49 proven. 37 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 04:21:40,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:22:04,195 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:22:18,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:22:18,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952390137] [2022-04-28 04:22:18,303 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:22:18,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799438592] [2022-04-28 04:22:18,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799438592] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:22:18,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 04:22:18,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 04:22:18,304 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:22:18,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1258882561] [2022-04-28 04:22:18,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1258882561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:22:18,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:22:18,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 04:22:18,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360335677] [2022-04-28 04:22:18,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:22:18,305 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 63 [2022-04-28 04:22:18,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:22:18,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 04:22:18,348 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 04:22:18,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 04:22:18,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:22:18,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 04:22:18,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=219, Unknown=1, NotChecked=0, Total=272 [2022-04-28 04:22:18,349 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 04:22:20,477 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 04:22:22,511 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:22:24,531 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 04:22:26,537 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 04:22:28,578 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 04:22:30,604 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 04:22:36,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:22:36,817 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2022-04-28 04:22:36,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 04:22:36,817 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 63 [2022-04-28 04:22:36,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:22:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 04:22:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2022-04-28 04:22:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 04:22:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2022-04-28 04:22:36,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 76 transitions. [2022-04-28 04:22:36,886 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 04:22:36,888 INFO L225 Difference]: With dead ends: 117 [2022-04-28 04:22:36,889 INFO L226 Difference]: Without dead ends: 105 [2022-04-28 04:22:36,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=81, Invalid=338, Unknown=1, NotChecked=0, Total=420 [2022-04-28 04:22:36,890 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 19 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:22:36,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 136 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 240 Invalid, 6 Unknown, 43 Unchecked, 12.4s Time] [2022-04-28 04:22:36,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-28 04:22:36,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2022-04-28 04:22:36,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:22:36,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 104 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 04:22:36,955 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 104 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 04:22:36,955 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 104 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 04:22:36,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:22:36,959 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2022-04-28 04:22:36,959 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2022-04-28 04:22:36,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:22:36,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:22:36,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 105 states. [2022-04-28 04:22:36,960 INFO L87 Difference]: Start difference. First operand has 104 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 105 states. [2022-04-28 04:22:36,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:22:36,964 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2022-04-28 04:22:36,964 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2022-04-28 04:22:36,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:22:36,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:22:36,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:22:36,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:22:36,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 04:22:36,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2022-04-28 04:22:36,969 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 63 [2022-04-28 04:22:36,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:22:36,969 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2022-04-28 04:22:36,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 04:22:36,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 125 transitions. [2022-04-28 04:22:37,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:22:37,120 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2022-04-28 04:22:37,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 04:22:37,121 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:22:37,121 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:22:37,138 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 04:22:37,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:22:37,327 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:22:37,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:22:37,328 INFO L85 PathProgramCache]: Analyzing trace with hash -711069715, now seen corresponding path program 1 times [2022-04-28 04:22:37,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:22:37,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [929685394] [2022-04-28 04:22:41,429 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:22:41,430 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 04:22:41,430 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:22:41,430 INFO L85 PathProgramCache]: Analyzing trace with hash -711069715, now seen corresponding path program 2 times [2022-04-28 04:22:41,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:22:41,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441227500] [2022-04-28 04:22:41,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:22:41,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:22:41,440 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:22:41,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1854901258] [2022-04-28 04:22:41,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:22:41,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:22:41,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:22:41,448 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 04:22:41,471 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 04:22:41,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:22:41,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:22:41,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 04:22:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:22:41,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:22:42,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2022-04-28 04:22:42,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {3830#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(8, 2);call #Ultimate.allocInit(12, 3); {3830#true} is VALID [2022-04-28 04:22:42,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 04:22:42,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3830#true} {3830#true} #90#return; {3830#true} is VALID [2022-04-28 04:22:42,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {3830#true} call #t~ret5 := main(); {3830#true} is VALID [2022-04-28 04:22:42,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {3830#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:22:42,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:22:42,148 INFO L272 TraceCheckUtils]: 7: Hoare triple {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 04:22:42,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 04:22:42,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 04:22:42,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 04:22:42,149 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3830#true} {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #76#return; {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:22:42,149 INFO L272 TraceCheckUtils]: 12: Hoare triple {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 04:22:42,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 04:22:42,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 04:22:42,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 04:22:42,152 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3830#true} {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:22:42,152 INFO L272 TraceCheckUtils]: 17: Hoare triple {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 04:22:42,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 04:22:42,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 04:22:42,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 04:22:42,153 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3830#true} {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:22:42,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-28 04:22:42,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} assume !false; {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-28 04:22:42,154 INFO L272 TraceCheckUtils]: 24: Hoare triple {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 04:22:42,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 04:22:42,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 04:22:42,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 04:22:42,155 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3830#true} {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #76#return; {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-28 04:22:42,155 INFO L272 TraceCheckUtils]: 29: Hoare triple {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 04:22:42,155 INFO L290 TraceCheckUtils]: 30: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 04:22:42,155 INFO L290 TraceCheckUtils]: 31: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 04:22:42,155 INFO L290 TraceCheckUtils]: 32: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 04:22:42,156 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3830#true} {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #78#return; {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-28 04:22:42,156 INFO L272 TraceCheckUtils]: 34: Hoare triple {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 04:22:42,157 INFO L290 TraceCheckUtils]: 35: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 04:22:42,157 INFO L290 TraceCheckUtils]: 36: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 04:22:42,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 04:22:42,158 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3830#true} {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #80#return; {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-28 04:22:42,158 INFO L290 TraceCheckUtils]: 39: Hoare triple {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} assume !(~r~0 >= ~d~0); {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-28 04:22:42,159 INFO L290 TraceCheckUtils]: 40: Hoare triple {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} assume !false; {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-28 04:22:42,159 INFO L272 TraceCheckUtils]: 41: Hoare triple {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 04:22:42,159 INFO L290 TraceCheckUtils]: 42: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 04:22:42,159 INFO L290 TraceCheckUtils]: 43: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 04:22:42,159 INFO L290 TraceCheckUtils]: 44: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 04:22:42,160 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3830#true} {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #82#return; {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-28 04:22:42,160 INFO L272 TraceCheckUtils]: 46: Hoare triple {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 04:22:42,160 INFO L290 TraceCheckUtils]: 47: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 04:22:42,160 INFO L290 TraceCheckUtils]: 48: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 04:22:42,160 INFO L290 TraceCheckUtils]: 49: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 04:22:42,161 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3830#true} {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #84#return; {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-28 04:22:42,162 INFO L290 TraceCheckUtils]: 51: Hoare triple {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} 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); {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:22:42,163 INFO L290 TraceCheckUtils]: 52: Hoare triple {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {3993#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:22:42,163 INFO L290 TraceCheckUtils]: 53: Hoare triple {3993#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {3993#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:22:42,163 INFO L272 TraceCheckUtils]: 54: Hoare triple {3993#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 04:22:42,164 INFO L290 TraceCheckUtils]: 55: Hoare triple {3830#true} ~cond := #in~cond; {4003#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:22:42,164 INFO L290 TraceCheckUtils]: 56: Hoare triple {4003#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:22:42,164 INFO L290 TraceCheckUtils]: 57: Hoare triple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:22:42,165 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} {3993#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {4014#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:22:42,165 INFO L272 TraceCheckUtils]: 59: Hoare triple {4014#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 04:22:42,166 INFO L290 TraceCheckUtils]: 60: Hoare triple {3830#true} ~cond := #in~cond; {4003#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:22:42,166 INFO L290 TraceCheckUtils]: 61: Hoare triple {4003#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:22:42,166 INFO L290 TraceCheckUtils]: 62: Hoare triple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:22:42,167 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} {4014#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {4030#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~p~0 1))} is VALID [2022-04-28 04:22:42,168 INFO L290 TraceCheckUtils]: 64: Hoare triple {4030#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~p~0 1))} assume !(1 != ~p~0); {4034#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0))} is VALID [2022-04-28 04:22:42,169 INFO L272 TraceCheckUtils]: 65: Hoare triple {4034#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0))} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4038#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:22:42,169 INFO L290 TraceCheckUtils]: 66: Hoare triple {4038#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4042#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:22:42,169 INFO L290 TraceCheckUtils]: 67: Hoare triple {4042#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3831#false} is VALID [2022-04-28 04:22:42,170 INFO L290 TraceCheckUtils]: 68: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2022-04-28 04:22:42,170 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 66 proven. 11 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-04-28 04:22:42,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:22:52,908 INFO L290 TraceCheckUtils]: 68: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2022-04-28 04:22:52,908 INFO L290 TraceCheckUtils]: 67: Hoare triple {4042#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3831#false} is VALID [2022-04-28 04:22:52,909 INFO L290 TraceCheckUtils]: 66: Hoare triple {4038#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4042#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:22:52,909 INFO L272 TraceCheckUtils]: 65: Hoare triple {4058#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4038#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:22:52,910 INFO L290 TraceCheckUtils]: 64: Hoare triple {4062#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} assume !(1 != ~p~0); {4058#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 04:22:52,910 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} {4066#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} #84#return; {4062#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} is VALID [2022-04-28 04:22:52,911 INFO L290 TraceCheckUtils]: 62: Hoare triple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:22:52,911 INFO L290 TraceCheckUtils]: 61: Hoare triple {4076#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:22:52,911 INFO L290 TraceCheckUtils]: 60: Hoare triple {3830#true} ~cond := #in~cond; {4076#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:22:52,911 INFO L272 TraceCheckUtils]: 59: Hoare triple {4066#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 04:22:52,913 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} {3830#true} #82#return; {4066#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} is VALID [2022-04-28 04:22:52,913 INFO L290 TraceCheckUtils]: 57: Hoare triple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:22:52,914 INFO L290 TraceCheckUtils]: 56: Hoare triple {4076#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:22:52,914 INFO L290 TraceCheckUtils]: 55: Hoare triple {3830#true} ~cond := #in~cond; {4076#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:22:52,914 INFO L272 TraceCheckUtils]: 54: Hoare triple {3830#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 04:22:52,914 INFO L290 TraceCheckUtils]: 53: Hoare triple {3830#true} assume !false; {3830#true} is VALID [2022-04-28 04:22:52,914 INFO L290 TraceCheckUtils]: 52: Hoare triple {3830#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {3830#true} is VALID [2022-04-28 04:22:52,914 INFO L290 TraceCheckUtils]: 51: Hoare triple {3830#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); {3830#true} is VALID [2022-04-28 04:22:52,914 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3830#true} {3830#true} #84#return; {3830#true} is VALID [2022-04-28 04:22:52,914 INFO L290 TraceCheckUtils]: 49: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 04:22:52,914 INFO L290 TraceCheckUtils]: 48: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 04:22:52,915 INFO L290 TraceCheckUtils]: 47: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 04:22:52,915 INFO L272 TraceCheckUtils]: 46: Hoare triple {3830#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 04:22:52,915 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3830#true} {3830#true} #82#return; {3830#true} is VALID [2022-04-28 04:22:52,915 INFO L290 TraceCheckUtils]: 44: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 04:22:52,915 INFO L290 TraceCheckUtils]: 43: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 04:22:52,915 INFO L290 TraceCheckUtils]: 42: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 04:22:52,915 INFO L272 TraceCheckUtils]: 41: Hoare triple {3830#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 04:22:52,915 INFO L290 TraceCheckUtils]: 40: Hoare triple {3830#true} assume !false; {3830#true} is VALID [2022-04-28 04:22:52,915 INFO L290 TraceCheckUtils]: 39: Hoare triple {3830#true} assume !(~r~0 >= ~d~0); {3830#true} is VALID [2022-04-28 04:22:52,915 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3830#true} {3830#true} #80#return; {3830#true} is VALID [2022-04-28 04:22:52,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 04:22:52,916 INFO L290 TraceCheckUtils]: 36: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 04:22:52,916 INFO L290 TraceCheckUtils]: 35: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 04:22:52,916 INFO L272 TraceCheckUtils]: 34: Hoare triple {3830#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 04:22:52,916 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3830#true} {3830#true} #78#return; {3830#true} is VALID [2022-04-28 04:22:52,916 INFO L290 TraceCheckUtils]: 32: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 04:22:52,916 INFO L290 TraceCheckUtils]: 31: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 04:22:52,916 INFO L290 TraceCheckUtils]: 30: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 04:22:52,916 INFO L272 TraceCheckUtils]: 29: Hoare triple {3830#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 04:22:52,916 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3830#true} {3830#true} #76#return; {3830#true} is VALID [2022-04-28 04:22:52,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 04:22:52,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 04:22:52,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 04:22:52,917 INFO L272 TraceCheckUtils]: 24: Hoare triple {3830#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 04:22:52,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {3830#true} assume !false; {3830#true} is VALID [2022-04-28 04:22:52,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {3830#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3830#true} is VALID [2022-04-28 04:22:52,917 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3830#true} {3830#true} #80#return; {3830#true} is VALID [2022-04-28 04:22:52,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 04:22:52,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 04:22:52,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 04:22:52,917 INFO L272 TraceCheckUtils]: 17: Hoare triple {3830#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 04:22:52,917 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3830#true} {3830#true} #78#return; {3830#true} is VALID [2022-04-28 04:22:52,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 04:22:52,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 04:22:52,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 04:22:52,918 INFO L272 TraceCheckUtils]: 12: Hoare triple {3830#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 04:22:52,918 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3830#true} {3830#true} #76#return; {3830#true} is VALID [2022-04-28 04:22:52,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 04:22:52,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 04:22:52,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 04:22:52,918 INFO L272 TraceCheckUtils]: 7: Hoare triple {3830#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 04:22:52,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {3830#true} assume !false; {3830#true} is VALID [2022-04-28 04:22:52,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {3830#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3830#true} is VALID [2022-04-28 04:22:52,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {3830#true} call #t~ret5 := main(); {3830#true} is VALID [2022-04-28 04:22:52,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3830#true} {3830#true} #90#return; {3830#true} is VALID [2022-04-28 04:22:52,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 04:22:52,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {3830#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(8, 2);call #Ultimate.allocInit(12, 3); {3830#true} is VALID [2022-04-28 04:22:52,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2022-04-28 04:22:52,919 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-04-28 04:22:52,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:22:52,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441227500] [2022-04-28 04:22:52,920 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:22:52,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854901258] [2022-04-28 04:22:52,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854901258] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:22:52,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:22:52,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-04-28 04:22:52,920 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:22:52,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [929685394] [2022-04-28 04:22:52,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [929685394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:22:52,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:22:52,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 04:22:52,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949182531] [2022-04-28 04:22:52,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:22:52,921 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 69 [2022-04-28 04:22:52,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:22:52,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 04:22:52,975 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 04:22:52,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 04:22:52,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:22:52,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 04:22:52,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-04-28 04:22:52,976 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 04:22:53,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:22:53,805 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2022-04-28 04:22:53,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 04:22:53,806 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 69 [2022-04-28 04:22:53,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:22:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 04:22:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 87 transitions. [2022-04-28 04:22:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 04:22:53,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 87 transitions. [2022-04-28 04:22:53,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 87 transitions. [2022-04-28 04:22:53,891 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 04:22:53,893 INFO L225 Difference]: With dead ends: 132 [2022-04-28 04:22:53,893 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 04:22:53,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-04-28 04:22:53,894 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:22:53,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 127 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 04:22:53,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 04:22:53,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-28 04:22:53,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:22:53,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 04:22:53,940 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 04:22:53,940 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 04:22:53,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:22:53,944 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2022-04-28 04:22:53,944 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2022-04-28 04:22:53,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:22:53,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:22:53,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) Second operand 83 states. [2022-04-28 04:22:53,945 INFO L87 Difference]: Start difference. First operand has 83 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) Second operand 83 states. [2022-04-28 04:22:53,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:22:53,952 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2022-04-28 04:22:53,952 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2022-04-28 04:22:53,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:22:53,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:22:53,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:22:53,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:22:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 04:22:53,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2022-04-28 04:22:53,957 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 69 [2022-04-28 04:22:53,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:22:53,957 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2022-04-28 04:22:53,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 04:22:53,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 97 transitions. [2022-04-28 04:22:54,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:22:54,075 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2022-04-28 04:22:54,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 04:22:54,076 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:22:54,076 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:22:54,096 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 04:22:54,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:22:54,284 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:22:54,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:22:54,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1680019059, now seen corresponding path program 5 times [2022-04-28 04:22:54,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:22:54,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [927722000] [2022-04-28 04:22:56,693 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:22:56,693 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 04:22:56,693 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:22:56,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1680019059, now seen corresponding path program 6 times [2022-04-28 04:22:56,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:22:56,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833401024] [2022-04-28 04:22:56,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:22:56,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:22:56,706 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:22:56,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [905710229] [2022-04-28 04:22:56,706 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:22:56,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:22:56,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:22:56,711 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 04:22:56,723 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 04:22:56,764 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 04:22:56,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:22:56,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 04:22:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:22:56,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:23:02,969 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:23:03,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {4859#true} call ULTIMATE.init(); {4859#true} is VALID [2022-04-28 04:23:03,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {4859#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(8, 2);call #Ultimate.allocInit(12, 3); {4859#true} is VALID [2022-04-28 04:23:03,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-28 04:23:03,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4859#true} {4859#true} #90#return; {4859#true} is VALID [2022-04-28 04:23:03,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {4859#true} call #t~ret5 := main(); {4859#true} is VALID [2022-04-28 04:23:03,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {4859#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:23:03,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !false; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:23:03,358 INFO L272 TraceCheckUtils]: 7: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4859#true} is VALID [2022-04-28 04:23:03,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-28 04:23:03,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-28 04:23:03,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-28 04:23:03,359 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {4859#true} {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #76#return; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:23:03,360 INFO L272 TraceCheckUtils]: 12: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4859#true} is VALID [2022-04-28 04:23:03,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-28 04:23:03,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-28 04:23:03,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-28 04:23:03,361 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4859#true} {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:23:03,361 INFO L272 TraceCheckUtils]: 17: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4859#true} is VALID [2022-04-28 04:23:03,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-28 04:23:03,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-28 04:23:03,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-28 04:23:03,362 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4859#true} {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:23:03,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:23:03,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !false; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:23:03,366 INFO L272 TraceCheckUtils]: 24: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4859#true} is VALID [2022-04-28 04:23:03,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-28 04:23:03,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-28 04:23:03,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-28 04:23:03,368 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4859#true} {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #76#return; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:23:03,368 INFO L272 TraceCheckUtils]: 29: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4859#true} is VALID [2022-04-28 04:23:03,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-28 04:23:03,368 INFO L290 TraceCheckUtils]: 31: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-28 04:23:03,368 INFO L290 TraceCheckUtils]: 32: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-28 04:23:03,369 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4859#true} {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:23:03,369 INFO L272 TraceCheckUtils]: 34: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4859#true} is VALID [2022-04-28 04:23:03,369 INFO L290 TraceCheckUtils]: 35: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-28 04:23:03,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-28 04:23:03,369 INFO L290 TraceCheckUtils]: 37: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-28 04:23:03,370 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4859#true} {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:23:03,371 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:23:03,371 INFO L290 TraceCheckUtils]: 40: Hoare triple {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} assume !false; {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:23:03,372 INFO L272 TraceCheckUtils]: 41: Hoare triple {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4859#true} is VALID [2022-04-28 04:23:03,372 INFO L290 TraceCheckUtils]: 42: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-28 04:23:03,372 INFO L290 TraceCheckUtils]: 43: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-28 04:23:03,372 INFO L290 TraceCheckUtils]: 44: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-28 04:23:03,372 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4859#true} {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} #76#return; {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:23:03,373 INFO L272 TraceCheckUtils]: 46: Hoare triple {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4859#true} is VALID [2022-04-28 04:23:03,374 INFO L290 TraceCheckUtils]: 47: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-28 04:23:03,374 INFO L290 TraceCheckUtils]: 48: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-28 04:23:03,374 INFO L290 TraceCheckUtils]: 49: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-28 04:23:03,374 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4859#true} {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:23:03,374 INFO L272 TraceCheckUtils]: 51: Hoare triple {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4859#true} is VALID [2022-04-28 04:23:03,375 INFO L290 TraceCheckUtils]: 52: Hoare triple {4859#true} ~cond := #in~cond; {5022#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:23:03,375 INFO L290 TraceCheckUtils]: 53: Hoare triple {5022#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5026#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:23:03,375 INFO L290 TraceCheckUtils]: 54: Hoare triple {5026#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5026#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:23:03,376 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5026#(not (= |__VERIFIER_assert_#in~cond| 0))} {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:23:03,377 INFO L290 TraceCheckUtils]: 56: Hoare triple {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} assume !(~r~0 >= ~d~0); {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:23:03,377 INFO L290 TraceCheckUtils]: 57: Hoare triple {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} assume !false; {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:23:03,377 INFO L272 TraceCheckUtils]: 58: Hoare triple {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {4859#true} is VALID [2022-04-28 04:23:03,378 INFO L290 TraceCheckUtils]: 59: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-28 04:23:03,378 INFO L290 TraceCheckUtils]: 60: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-28 04:23:03,378 INFO L290 TraceCheckUtils]: 61: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-28 04:23:03,378 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {4859#true} {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:23:03,378 INFO L272 TraceCheckUtils]: 63: Hoare triple {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4859#true} is VALID [2022-04-28 04:23:03,379 INFO L290 TraceCheckUtils]: 64: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-28 04:23:03,379 INFO L290 TraceCheckUtils]: 65: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-28 04:23:03,379 INFO L290 TraceCheckUtils]: 66: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-28 04:23:03,379 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {4859#true} {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} #84#return; {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:23:03,382 INFO L290 TraceCheckUtils]: 68: Hoare triple {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} 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); {5073#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (exists ((aux_mod_v_main_~p~0_51_22 Int)) (and (<= 0 aux_mod_v_main_~p~0_51_22) (= (div (* main_~B~0 (+ (* main_~p~0 2) aux_mod_v_main_~p~0_51_22)) 2) main_~d~0) (< aux_mod_v_main_~p~0_51_22 2) (= (mod (* main_~B~0 (+ (* main_~p~0 2) aux_mod_v_main_~p~0_51_22)) 2) 0))))} is VALID [2022-04-28 04:23:03,384 INFO L290 TraceCheckUtils]: 69: Hoare triple {5073#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (exists ((aux_mod_v_main_~p~0_51_22 Int)) (and (<= 0 aux_mod_v_main_~p~0_51_22) (= (div (* main_~B~0 (+ (* main_~p~0 2) aux_mod_v_main_~p~0_51_22)) 2) main_~d~0) (< aux_mod_v_main_~p~0_51_22 2) (= (mod (* main_~B~0 (+ (* main_~p~0 2) aux_mod_v_main_~p~0_51_22)) 2) 0))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5077#(and (= main_~B~0 1) (exists ((aux_mod_v_main_~p~0_51_22 Int)) (and (= (mod (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2) 0) (<= 0 aux_mod_v_main_~p~0_51_22) (= (+ (* (- 1) (div (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2)) main_~A~0) main_~r~0) (< aux_mod_v_main_~p~0_51_22 2))))} is VALID [2022-04-28 04:23:03,385 INFO L290 TraceCheckUtils]: 70: Hoare triple {5077#(and (= main_~B~0 1) (exists ((aux_mod_v_main_~p~0_51_22 Int)) (and (= (mod (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2) 0) (<= 0 aux_mod_v_main_~p~0_51_22) (= (+ (* (- 1) (div (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2)) main_~A~0) main_~r~0) (< aux_mod_v_main_~p~0_51_22 2))))} assume !false; {5077#(and (= main_~B~0 1) (exists ((aux_mod_v_main_~p~0_51_22 Int)) (and (= (mod (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2) 0) (<= 0 aux_mod_v_main_~p~0_51_22) (= (+ (* (- 1) (div (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2)) main_~A~0) main_~r~0) (< aux_mod_v_main_~p~0_51_22 2))))} is VALID [2022-04-28 04:23:03,387 INFO L272 TraceCheckUtils]: 71: Hoare triple {5077#(and (= main_~B~0 1) (exists ((aux_mod_v_main_~p~0_51_22 Int)) (and (= (mod (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2) 0) (<= 0 aux_mod_v_main_~p~0_51_22) (= (+ (* (- 1) (div (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2)) main_~A~0) main_~r~0) (< aux_mod_v_main_~p~0_51_22 2))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5084#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:23:03,387 INFO L290 TraceCheckUtils]: 72: Hoare triple {5084#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5088#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:23:03,387 INFO L290 TraceCheckUtils]: 73: Hoare triple {5088#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4860#false} is VALID [2022-04-28 04:23:03,388 INFO L290 TraceCheckUtils]: 74: Hoare triple {4860#false} assume !false; {4860#false} is VALID [2022-04-28 04:23:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 55 proven. 9 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-04-28 04:23:03,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:23:17,102 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:25:17,039 WARN L232 SmtUtils]: Spent 31.68s on a formula simplification. DAG size of input: 69 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 04:25:17,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:25:17,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833401024] [2022-04-28 04:25:17,047 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:25:17,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905710229] [2022-04-28 04:25:17,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905710229] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:25:17,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 04:25:17,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 04:25:17,048 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:25:17,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [927722000] [2022-04-28 04:25:17,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [927722000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:25:17,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:25:17,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 04:25:17,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949824128] [2022-04-28 04:25:17,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:25:17,049 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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 75 [2022-04-28 04:25:17,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:25:17,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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 04:25:17,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:25:17,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 04:25:17,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:25:17,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 04:25:17,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=158, Unknown=1, NotChecked=0, Total=210 [2022-04-28 04:25:17,095 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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 04:25:19,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:25:19,581 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2022-04-28 04:25:19,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 04:25:19,581 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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 75 [2022-04-28 04:25:19,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:25:19,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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 04:25:19,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2022-04-28 04:25:19,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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 04:25:19,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2022-04-28 04:25:19,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 63 transitions. [2022-04-28 04:25:19,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:25:19,663 INFO L225 Difference]: With dead ends: 96 [2022-04-28 04:25:19,663 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 04:25:19,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 36.0s TimeCoverageRelationStatistics Valid=62, Invalid=208, Unknown=2, NotChecked=0, Total=272 [2022-04-28 04:25:19,664 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:25:19,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 104 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 165 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2022-04-28 04:25:19,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 04:25:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-28 04:25:19,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:25:19,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 94 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 61 states have internal predecessors, (64), 23 states have call successors, (23), 14 states have call predecessors, (23), 13 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:25:19,719 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 94 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 61 states have internal predecessors, (64), 23 states have call successors, (23), 14 states have call predecessors, (23), 13 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:25:19,719 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 94 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 61 states have internal predecessors, (64), 23 states have call successors, (23), 14 states have call predecessors, (23), 13 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:25:19,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:25:19,722 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2022-04-28 04:25:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2022-04-28 04:25:19,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:25:19,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:25:19,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 61 states have internal predecessors, (64), 23 states have call successors, (23), 14 states have call predecessors, (23), 13 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) Second operand 94 states. [2022-04-28 04:25:19,723 INFO L87 Difference]: Start difference. First operand has 94 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 61 states have internal predecessors, (64), 23 states have call successors, (23), 14 states have call predecessors, (23), 13 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) Second operand 94 states. [2022-04-28 04:25:19,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:25:19,726 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2022-04-28 04:25:19,726 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2022-04-28 04:25:19,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:25:19,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:25:19,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:25:19,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:25:19,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 61 states have internal predecessors, (64), 23 states have call successors, (23), 14 states have call predecessors, (23), 13 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:25:19,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2022-04-28 04:25:19,729 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 75 [2022-04-28 04:25:19,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:25:19,729 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2022-04-28 04:25:19,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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 04:25:19,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 108 transitions. [2022-04-28 04:25:19,879 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 04:25:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2022-04-28 04:25:19,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 04:25:19,880 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:25:19,880 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:25:19,905 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 04:25:20,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:25:20,081 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:25:20,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:25:20,081 INFO L85 PathProgramCache]: Analyzing trace with hash -576191946, now seen corresponding path program 1 times [2022-04-28 04:25:20,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:25:20,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1961117551] [2022-04-28 04:25:22,270 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:25:22,270 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 04:25:22,270 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:25:22,270 INFO L85 PathProgramCache]: Analyzing trace with hash -576191946, now seen corresponding path program 2 times [2022-04-28 04:25:22,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:25:22,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598592670] [2022-04-28 04:25:22,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:25:22,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:25:22,279 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:25:22,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [406516899] [2022-04-28 04:25:22,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:25:22,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:25:22,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:25:22,285 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 04:25:22,286 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 04:25:22,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:25:22,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:25:22,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 04:25:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:25:22,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:25:24,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {5730#true} call ULTIMATE.init(); {5730#true} is VALID [2022-04-28 04:25:24,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {5730#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(8, 2);call #Ultimate.allocInit(12, 3); {5730#true} is VALID [2022-04-28 04:25:24,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 04:25:24,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5730#true} {5730#true} #90#return; {5730#true} is VALID [2022-04-28 04:25:24,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {5730#true} call #t~ret5 := main(); {5730#true} is VALID [2022-04-28 04:25:24,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {5730#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {5750#(<= 1 main_~d~0)} is VALID [2022-04-28 04:25:24,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {5750#(<= 1 main_~d~0)} assume !false; {5750#(<= 1 main_~d~0)} is VALID [2022-04-28 04:25:24,263 INFO L272 TraceCheckUtils]: 7: Hoare triple {5750#(<= 1 main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5730#true} is VALID [2022-04-28 04:25:24,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-28 04:25:24,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-28 04:25:24,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 04:25:24,264 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {5730#true} {5750#(<= 1 main_~d~0)} #76#return; {5750#(<= 1 main_~d~0)} is VALID [2022-04-28 04:25:24,264 INFO L272 TraceCheckUtils]: 12: Hoare triple {5750#(<= 1 main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5730#true} is VALID [2022-04-28 04:25:24,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-28 04:25:24,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-28 04:25:24,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 04:25:24,265 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5730#true} {5750#(<= 1 main_~d~0)} #78#return; {5750#(<= 1 main_~d~0)} is VALID [2022-04-28 04:25:24,265 INFO L272 TraceCheckUtils]: 17: Hoare triple {5750#(<= 1 main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5730#true} is VALID [2022-04-28 04:25:24,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-28 04:25:24,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-28 04:25:24,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 04:25:24,266 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5730#true} {5750#(<= 1 main_~d~0)} #80#return; {5750#(<= 1 main_~d~0)} is VALID [2022-04-28 04:25:24,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {5750#(<= 1 main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5802#(<= 1 (div main_~d~0 2))} is VALID [2022-04-28 04:25:24,267 INFO L290 TraceCheckUtils]: 23: Hoare triple {5802#(<= 1 (div main_~d~0 2))} assume !false; {5802#(<= 1 (div main_~d~0 2))} is VALID [2022-04-28 04:25:24,267 INFO L272 TraceCheckUtils]: 24: Hoare triple {5802#(<= 1 (div main_~d~0 2))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5730#true} is VALID [2022-04-28 04:25:24,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-28 04:25:24,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-28 04:25:24,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 04:25:24,268 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5730#true} {5802#(<= 1 (div main_~d~0 2))} #76#return; {5802#(<= 1 (div main_~d~0 2))} is VALID [2022-04-28 04:25:24,268 INFO L272 TraceCheckUtils]: 29: Hoare triple {5802#(<= 1 (div main_~d~0 2))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5730#true} is VALID [2022-04-28 04:25:24,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-28 04:25:24,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-28 04:25:24,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 04:25:24,268 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {5730#true} {5802#(<= 1 (div main_~d~0 2))} #78#return; {5802#(<= 1 (div main_~d~0 2))} is VALID [2022-04-28 04:25:24,268 INFO L272 TraceCheckUtils]: 34: Hoare triple {5802#(<= 1 (div main_~d~0 2))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5730#true} is VALID [2022-04-28 04:25:24,269 INFO L290 TraceCheckUtils]: 35: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-28 04:25:24,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-28 04:25:24,269 INFO L290 TraceCheckUtils]: 37: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 04:25:24,269 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5730#true} {5802#(<= 1 (div main_~d~0 2))} #80#return; {5802#(<= 1 (div main_~d~0 2))} is VALID [2022-04-28 04:25:24,270 INFO L290 TraceCheckUtils]: 39: Hoare triple {5802#(<= 1 (div main_~d~0 2))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-28 04:25:24,271 INFO L290 TraceCheckUtils]: 40: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} assume !false; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-28 04:25:24,271 INFO L272 TraceCheckUtils]: 41: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5730#true} is VALID [2022-04-28 04:25:24,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-28 04:25:24,271 INFO L290 TraceCheckUtils]: 43: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-28 04:25:24,271 INFO L290 TraceCheckUtils]: 44: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 04:25:24,272 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5730#true} {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} #76#return; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-28 04:25:24,272 INFO L272 TraceCheckUtils]: 46: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5730#true} is VALID [2022-04-28 04:25:24,272 INFO L290 TraceCheckUtils]: 47: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-28 04:25:24,272 INFO L290 TraceCheckUtils]: 48: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-28 04:25:24,272 INFO L290 TraceCheckUtils]: 49: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 04:25:24,272 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5730#true} {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} #78#return; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-28 04:25:24,273 INFO L272 TraceCheckUtils]: 51: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5730#true} is VALID [2022-04-28 04:25:24,273 INFO L290 TraceCheckUtils]: 52: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-28 04:25:24,273 INFO L290 TraceCheckUtils]: 53: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-28 04:25:24,273 INFO L290 TraceCheckUtils]: 54: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 04:25:24,273 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5730#true} {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} #80#return; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-28 04:25:24,274 INFO L290 TraceCheckUtils]: 56: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} assume !(~r~0 >= ~d~0); {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-28 04:25:24,274 INFO L290 TraceCheckUtils]: 57: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} assume !false; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-28 04:25:24,274 INFO L272 TraceCheckUtils]: 58: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5730#true} is VALID [2022-04-28 04:25:24,274 INFO L290 TraceCheckUtils]: 59: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-28 04:25:24,275 INFO L290 TraceCheckUtils]: 60: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-28 04:25:24,275 INFO L290 TraceCheckUtils]: 61: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 04:25:24,275 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {5730#true} {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} #82#return; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-28 04:25:24,275 INFO L272 TraceCheckUtils]: 63: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5730#true} is VALID [2022-04-28 04:25:24,275 INFO L290 TraceCheckUtils]: 64: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-28 04:25:24,275 INFO L290 TraceCheckUtils]: 65: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-28 04:25:24,276 INFO L290 TraceCheckUtils]: 66: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 04:25:24,276 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {5730#true} {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} #84#return; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-28 04:25:24,277 INFO L290 TraceCheckUtils]: 68: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} 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); {5942#(and (< 0 (div main_~r~0 2)) (< main_~d~0 (+ main_~r~0 1)))} is VALID [2022-04-28 04:25:24,278 INFO L290 TraceCheckUtils]: 69: Hoare triple {5942#(and (< 0 (div main_~r~0 2)) (< main_~d~0 (+ main_~r~0 1)))} assume !(~r~0 >= ~d~0); {5731#false} is VALID [2022-04-28 04:25:24,278 INFO L290 TraceCheckUtils]: 70: Hoare triple {5731#false} assume !false; {5731#false} is VALID [2022-04-28 04:25:24,278 INFO L272 TraceCheckUtils]: 71: Hoare triple {5731#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5731#false} is VALID [2022-04-28 04:25:24,278 INFO L290 TraceCheckUtils]: 72: Hoare triple {5731#false} ~cond := #in~cond; {5731#false} is VALID [2022-04-28 04:25:24,278 INFO L290 TraceCheckUtils]: 73: Hoare triple {5731#false} assume !(0 == ~cond); {5731#false} is VALID [2022-04-28 04:25:24,278 INFO L290 TraceCheckUtils]: 74: Hoare triple {5731#false} assume true; {5731#false} is VALID [2022-04-28 04:25:24,278 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {5731#false} {5731#false} #82#return; {5731#false} is VALID [2022-04-28 04:25:24,278 INFO L272 TraceCheckUtils]: 76: Hoare triple {5731#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5731#false} is VALID [2022-04-28 04:25:24,279 INFO L290 TraceCheckUtils]: 77: Hoare triple {5731#false} ~cond := #in~cond; {5731#false} is VALID [2022-04-28 04:25:24,279 INFO L290 TraceCheckUtils]: 78: Hoare triple {5731#false} assume 0 == ~cond; {5731#false} is VALID [2022-04-28 04:25:24,279 INFO L290 TraceCheckUtils]: 79: Hoare triple {5731#false} assume !false; {5731#false} is VALID [2022-04-28 04:25:24,279 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-04-28 04:25:24,279 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:25:24,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:25:24,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598592670] [2022-04-28 04:25:24,279 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:25:24,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406516899] [2022-04-28 04:25:24,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406516899] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:25:24,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:25:24,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:25:24,280 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:25:24,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1961117551] [2022-04-28 04:25:24,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1961117551] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:25:24,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:25:24,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:25:24,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356553844] [2022-04-28 04:25:24,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:25:24,281 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 80 [2022-04-28 04:25:24,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:25:24,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 04:25:24,331 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 04:25:24,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:25:24,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:25:24,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:25:24,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:25:24,332 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 04:25:24,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:25:24,840 INFO L93 Difference]: Finished difference Result 122 states and 147 transitions. [2022-04-28 04:25:24,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:25:24,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 80 [2022-04-28 04:25:24,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:25:24,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 04:25:24,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-04-28 04:25:24,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 04:25:24,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-04-28 04:25:24,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 95 transitions. [2022-04-28 04:25:24,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:25:24,920 INFO L225 Difference]: With dead ends: 122 [2022-04-28 04:25:24,920 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 04:25:24,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-28 04:25:24,921 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 8 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:25:24,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 114 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:25:24,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 04:25:24,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2022-04-28 04:25:24,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:25:24,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 82 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:25:24,991 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 82 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:25:24,991 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 82 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:25:24,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:25:24,993 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-04-28 04:25:24,993 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2022-04-28 04:25:24,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:25:24,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:25:24,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 92 states. [2022-04-28 04:25:24,994 INFO L87 Difference]: Start difference. First operand has 82 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 92 states. [2022-04-28 04:25:24,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:25:24,997 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-04-28 04:25:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2022-04-28 04:25:24,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:25:24,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:25:24,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:25:24,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:25:24,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:25:24,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2022-04-28 04:25:24,999 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 80 [2022-04-28 04:25:25,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:25:25,000 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2022-04-28 04:25:25,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 04:25:25,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 90 transitions. [2022-04-28 04:25:25,136 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 04:25:25,136 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-04-28 04:25:25,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 04:25:25,137 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:25:25,137 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 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] [2022-04-28 04:25:25,162 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 04:25:25,338 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,SelfDestructingSolverStorable9 [2022-04-28 04:25:25,338 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:25:25,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:25:25,338 INFO L85 PathProgramCache]: Analyzing trace with hash -182652584, now seen corresponding path program 3 times [2022-04-28 04:25:25,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:25:25,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1807907734] [2022-04-28 04:25:27,696 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:25:27,696 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 04:25:27,696 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:25:27,696 INFO L85 PathProgramCache]: Analyzing trace with hash -182652584, now seen corresponding path program 4 times [2022-04-28 04:25:27,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:25:27,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900229047] [2022-04-28 04:25:27,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:25:27,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:25:27,706 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:25:27,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1023046633] [2022-04-28 04:25:27,706 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:25:27,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:25:27,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:25:27,716 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 04:25:27,735 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 04:25:27,765 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:25:27,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:25:27,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 04:25:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:25:27,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:25:28,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {6569#true} call ULTIMATE.init(); {6569#true} is VALID [2022-04-28 04:25:28,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {6569#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(8, 2);call #Ultimate.allocInit(12, 3); {6569#true} is VALID [2022-04-28 04:25:28,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6569#true} {6569#true} #90#return; {6569#true} is VALID [2022-04-28 04:25:28,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {6569#true} call #t~ret5 := main(); {6569#true} is VALID [2022-04-28 04:25:28,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {6569#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {6569#true} is VALID [2022-04-28 04:25:28,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {6569#true} assume !false; {6569#true} is VALID [2022-04-28 04:25:28,732 INFO L272 TraceCheckUtils]: 7: Hoare triple {6569#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,732 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6569#true} {6569#true} #76#return; {6569#true} is VALID [2022-04-28 04:25:28,733 INFO L272 TraceCheckUtils]: 12: Hoare triple {6569#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,733 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6569#true} {6569#true} #78#return; {6569#true} is VALID [2022-04-28 04:25:28,733 INFO L272 TraceCheckUtils]: 17: Hoare triple {6569#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,733 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6569#true} {6569#true} #80#return; {6569#true} is VALID [2022-04-28 04:25:28,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {6569#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 04:25:28,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {6640#(= (mod main_~p~0 2) 0)} assume !false; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 04:25:28,736 INFO L272 TraceCheckUtils]: 24: Hoare triple {6640#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,737 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6569#true} {6640#(= (mod main_~p~0 2) 0)} #76#return; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 04:25:28,737 INFO L272 TraceCheckUtils]: 29: Hoare triple {6640#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,737 INFO L290 TraceCheckUtils]: 32: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,738 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6569#true} {6640#(= (mod main_~p~0 2) 0)} #78#return; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 04:25:28,738 INFO L272 TraceCheckUtils]: 34: Hoare triple {6640#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,738 INFO L290 TraceCheckUtils]: 35: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,738 INFO L290 TraceCheckUtils]: 36: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,738 INFO L290 TraceCheckUtils]: 37: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,739 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6569#true} {6640#(= (mod main_~p~0 2) 0)} #80#return; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 04:25:28,740 INFO L290 TraceCheckUtils]: 39: Hoare triple {6640#(= (mod main_~p~0 2) 0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:25:28,741 INFO L290 TraceCheckUtils]: 40: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !false; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:25:28,741 INFO L272 TraceCheckUtils]: 41: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,741 INFO L290 TraceCheckUtils]: 42: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,741 INFO L290 TraceCheckUtils]: 43: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,741 INFO L290 TraceCheckUtils]: 44: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,741 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6569#true} {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #76#return; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:25:28,742 INFO L272 TraceCheckUtils]: 46: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,742 INFO L290 TraceCheckUtils]: 47: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,742 INFO L290 TraceCheckUtils]: 48: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,742 INFO L290 TraceCheckUtils]: 49: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,742 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6569#true} {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #78#return; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:25:28,743 INFO L272 TraceCheckUtils]: 51: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,743 INFO L290 TraceCheckUtils]: 52: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,743 INFO L290 TraceCheckUtils]: 53: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,743 INFO L290 TraceCheckUtils]: 54: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,743 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6569#true} {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #80#return; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:25:28,744 INFO L290 TraceCheckUtils]: 56: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:25:28,744 INFO L290 TraceCheckUtils]: 57: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !false; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:25:28,744 INFO L272 TraceCheckUtils]: 58: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,744 INFO L290 TraceCheckUtils]: 59: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,745 INFO L290 TraceCheckUtils]: 60: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,745 INFO L290 TraceCheckUtils]: 61: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,745 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {6569#true} {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #82#return; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:25:28,745 INFO L272 TraceCheckUtils]: 63: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,745 INFO L290 TraceCheckUtils]: 64: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,746 INFO L290 TraceCheckUtils]: 65: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,746 INFO L290 TraceCheckUtils]: 66: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,746 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {6569#true} {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #84#return; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:25:28,747 INFO L290 TraceCheckUtils]: 68: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 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); {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 04:25:28,748 INFO L290 TraceCheckUtils]: 69: Hoare triple {6640#(= (mod main_~p~0 2) 0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 04:25:28,748 INFO L290 TraceCheckUtils]: 70: Hoare triple {6640#(= (mod main_~p~0 2) 0)} assume !false; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 04:25:28,748 INFO L272 TraceCheckUtils]: 71: Hoare triple {6640#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,748 INFO L290 TraceCheckUtils]: 72: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,748 INFO L290 TraceCheckUtils]: 73: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,749 INFO L290 TraceCheckUtils]: 74: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,749 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {6569#true} {6640#(= (mod main_~p~0 2) 0)} #82#return; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 04:25:28,749 INFO L272 TraceCheckUtils]: 76: Hoare triple {6640#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,749 INFO L290 TraceCheckUtils]: 77: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,749 INFO L290 TraceCheckUtils]: 78: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,750 INFO L290 TraceCheckUtils]: 79: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,750 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6569#true} {6640#(= (mod main_~p~0 2) 0)} #84#return; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 04:25:28,750 INFO L290 TraceCheckUtils]: 81: Hoare triple {6640#(= (mod main_~p~0 2) 0)} assume !(1 != ~p~0); {6570#false} is VALID [2022-04-28 04:25:28,751 INFO L272 TraceCheckUtils]: 82: Hoare triple {6570#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {6570#false} is VALID [2022-04-28 04:25:28,751 INFO L290 TraceCheckUtils]: 83: Hoare triple {6570#false} ~cond := #in~cond; {6570#false} is VALID [2022-04-28 04:25:28,751 INFO L290 TraceCheckUtils]: 84: Hoare triple {6570#false} assume 0 == ~cond; {6570#false} is VALID [2022-04-28 04:25:28,751 INFO L290 TraceCheckUtils]: 85: Hoare triple {6570#false} assume !false; {6570#false} is VALID [2022-04-28 04:25:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 41 proven. 4 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 04:25:28,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:25:28,971 INFO L290 TraceCheckUtils]: 85: Hoare triple {6570#false} assume !false; {6570#false} is VALID [2022-04-28 04:25:28,972 INFO L290 TraceCheckUtils]: 84: Hoare triple {6570#false} assume 0 == ~cond; {6570#false} is VALID [2022-04-28 04:25:28,972 INFO L290 TraceCheckUtils]: 83: Hoare triple {6570#false} ~cond := #in~cond; {6570#false} is VALID [2022-04-28 04:25:28,972 INFO L272 TraceCheckUtils]: 82: Hoare triple {6570#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {6570#false} is VALID [2022-04-28 04:25:28,972 INFO L290 TraceCheckUtils]: 81: Hoare triple {6843#(not (= main_~p~0 1))} assume !(1 != ~p~0); {6570#false} is VALID [2022-04-28 04:25:28,973 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6569#true} {6843#(not (= main_~p~0 1))} #84#return; {6843#(not (= main_~p~0 1))} is VALID [2022-04-28 04:25:28,973 INFO L290 TraceCheckUtils]: 79: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,973 INFO L290 TraceCheckUtils]: 78: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,973 INFO L290 TraceCheckUtils]: 77: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,973 INFO L272 TraceCheckUtils]: 76: Hoare triple {6843#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,973 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {6569#true} {6843#(not (= main_~p~0 1))} #82#return; {6843#(not (= main_~p~0 1))} is VALID [2022-04-28 04:25:28,973 INFO L290 TraceCheckUtils]: 74: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,973 INFO L290 TraceCheckUtils]: 73: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,973 INFO L290 TraceCheckUtils]: 72: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,974 INFO L272 TraceCheckUtils]: 71: Hoare triple {6843#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,974 INFO L290 TraceCheckUtils]: 70: Hoare triple {6843#(not (= main_~p~0 1))} assume !false; {6843#(not (= main_~p~0 1))} is VALID [2022-04-28 04:25:28,974 INFO L290 TraceCheckUtils]: 69: Hoare triple {6843#(not (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {6843#(not (= main_~p~0 1))} is VALID [2022-04-28 04:25:28,975 INFO L290 TraceCheckUtils]: 68: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} 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); {6843#(not (= main_~p~0 1))} is VALID [2022-04-28 04:25:28,975 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {6569#true} {6883#(not (= (div main_~p~0 2) 1))} #84#return; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 04:25:28,975 INFO L290 TraceCheckUtils]: 66: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,975 INFO L290 TraceCheckUtils]: 65: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,976 INFO L290 TraceCheckUtils]: 64: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,976 INFO L272 TraceCheckUtils]: 63: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,979 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {6569#true} {6883#(not (= (div main_~p~0 2) 1))} #82#return; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 04:25:28,979 INFO L290 TraceCheckUtils]: 61: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,980 INFO L290 TraceCheckUtils]: 60: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,980 INFO L290 TraceCheckUtils]: 59: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,980 INFO L272 TraceCheckUtils]: 58: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,980 INFO L290 TraceCheckUtils]: 57: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} assume !false; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 04:25:28,980 INFO L290 TraceCheckUtils]: 56: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} assume !(~r~0 >= ~d~0); {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 04:25:28,981 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6569#true} {6883#(not (= (div main_~p~0 2) 1))} #80#return; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 04:25:28,981 INFO L290 TraceCheckUtils]: 54: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,981 INFO L290 TraceCheckUtils]: 53: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,981 INFO L290 TraceCheckUtils]: 52: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,981 INFO L272 TraceCheckUtils]: 51: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,981 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6569#true} {6883#(not (= (div main_~p~0 2) 1))} #78#return; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 04:25:28,981 INFO L290 TraceCheckUtils]: 49: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,981 INFO L290 TraceCheckUtils]: 48: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,981 INFO L290 TraceCheckUtils]: 47: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,982 INFO L272 TraceCheckUtils]: 46: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,983 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6569#true} {6883#(not (= (div main_~p~0 2) 1))} #76#return; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 04:25:28,983 INFO L290 TraceCheckUtils]: 44: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,983 INFO L290 TraceCheckUtils]: 43: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,984 INFO L290 TraceCheckUtils]: 42: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,984 INFO L272 TraceCheckUtils]: 41: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} assume !false; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 04:25:28,985 INFO L290 TraceCheckUtils]: 39: Hoare triple {6843#(not (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 04:25:28,985 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6569#true} {6843#(not (= main_~p~0 1))} #80#return; {6843#(not (= main_~p~0 1))} is VALID [2022-04-28 04:25:28,985 INFO L290 TraceCheckUtils]: 37: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,986 INFO L290 TraceCheckUtils]: 36: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,986 INFO L290 TraceCheckUtils]: 35: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,986 INFO L272 TraceCheckUtils]: 34: Hoare triple {6843#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,986 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6569#true} {6843#(not (= main_~p~0 1))} #78#return; {6843#(not (= main_~p~0 1))} is VALID [2022-04-28 04:25:28,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,986 INFO L290 TraceCheckUtils]: 31: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,987 INFO L272 TraceCheckUtils]: 29: Hoare triple {6843#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,987 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6569#true} {6843#(not (= main_~p~0 1))} #76#return; {6843#(not (= main_~p~0 1))} is VALID [2022-04-28 04:25:28,987 INFO L290 TraceCheckUtils]: 27: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,987 INFO L290 TraceCheckUtils]: 26: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,987 INFO L290 TraceCheckUtils]: 25: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,987 INFO L272 TraceCheckUtils]: 24: Hoare triple {6843#(not (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {6843#(not (= main_~p~0 1))} assume !false; {6843#(not (= main_~p~0 1))} is VALID [2022-04-28 04:25:28,988 INFO L290 TraceCheckUtils]: 22: Hoare triple {6569#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6843#(not (= main_~p~0 1))} is VALID [2022-04-28 04:25:28,988 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6569#true} {6569#true} #80#return; {6569#true} is VALID [2022-04-28 04:25:28,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,989 INFO L272 TraceCheckUtils]: 17: Hoare triple {6569#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,989 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6569#true} {6569#true} #78#return; {6569#true} is VALID [2022-04-28 04:25:28,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,989 INFO L272 TraceCheckUtils]: 12: Hoare triple {6569#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,989 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6569#true} {6569#true} #76#return; {6569#true} is VALID [2022-04-28 04:25:28,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 04:25:28,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 04:25:28,989 INFO L272 TraceCheckUtils]: 7: Hoare triple {6569#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 04:25:28,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {6569#true} assume !false; {6569#true} is VALID [2022-04-28 04:25:28,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {6569#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {6569#true} is VALID [2022-04-28 04:25:28,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {6569#true} call #t~ret5 := main(); {6569#true} is VALID [2022-04-28 04:25:28,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6569#true} {6569#true} #90#return; {6569#true} is VALID [2022-04-28 04:25:28,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 04:25:28,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {6569#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(8, 2);call #Ultimate.allocInit(12, 3); {6569#true} is VALID [2022-04-28 04:25:28,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {6569#true} call ULTIMATE.init(); {6569#true} is VALID [2022-04-28 04:25:28,990 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 04:25:28,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:25:28,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900229047] [2022-04-28 04:25:28,991 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:25:28,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023046633] [2022-04-28 04:25:28,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023046633] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:25:28,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:25:28,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-04-28 04:25:28,991 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:25:28,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1807907734] [2022-04-28 04:25:28,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1807907734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:25:28,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:25:28,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:25:28,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646582700] [2022-04-28 04:25:28,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:25:28,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 86 [2022-04-28 04:25:28,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:25:28,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 04:25:29,040 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 04:25:29,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 04:25:29,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:25:29,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 04:25:29,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:25:29,041 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 04:25:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:25:29,213 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-04-28 04:25:29,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 04:25:29,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 86 [2022-04-28 04:25:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:25:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 04:25:29,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-28 04:25:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 04:25:29,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-28 04:25:29,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2022-04-28 04:25:29,269 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 04:25:29,270 INFO L225 Difference]: With dead ends: 91 [2022-04-28 04:25:29,270 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 04:25:29,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 165 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:25:29,271 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:25:29,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 105 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:25:29,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 04:25:29,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-28 04:25:29,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:25:29,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:25:29,352 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:25:29,352 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:25:29,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:25:29,354 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-04-28 04:25:29,354 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-28 04:25:29,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:25:29,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:25:29,354 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 83 states. [2022-04-28 04:25:29,355 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 83 states. [2022-04-28 04:25:29,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:25:29,357 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-04-28 04:25:29,357 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-28 04:25:29,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:25:29,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:25:29,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:25:29,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:25:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:25:29,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2022-04-28 04:25:29,359 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 86 [2022-04-28 04:25:29,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:25:29,359 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2022-04-28 04:25:29,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 04:25:29,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 91 transitions. [2022-04-28 04:25:29,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:25:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-28 04:25:29,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-28 04:25:29,535 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:25:29,535 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:25:29,556 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 04:25:29,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:25:29,739 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:25:29,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:25:29,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1256657556, now seen corresponding path program 7 times [2022-04-28 04:25:29,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:25:29,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1663510602] [2022-04-28 04:25:31,837 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:25:31,837 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 04:25:31,838 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:25:31,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1256657556, now seen corresponding path program 8 times [2022-04-28 04:25:31,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:25:31,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674087617] [2022-04-28 04:25:31,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:25:31,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:25:31,858 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:25:31,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [502067729] [2022-04-28 04:25:31,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:25:31,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:25:31,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:25:31,860 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 04:25:31,887 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 04:25:31,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:25:31,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:25:31,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 04:25:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:25:31,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:25:32,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {7604#true} call ULTIMATE.init(); {7604#true} is VALID [2022-04-28 04:25:32,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {7604#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(8, 2);call #Ultimate.allocInit(12, 3); {7604#true} is VALID [2022-04-28 04:25:32,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:32,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7604#true} {7604#true} #90#return; {7604#true} is VALID [2022-04-28 04:25:32,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {7604#true} call #t~ret5 := main(); {7604#true} is VALID [2022-04-28 04:25:32,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {7604#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:25:32,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:25:32,611 INFO L272 TraceCheckUtils]: 7: Hoare triple {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:32,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:32,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:32,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:32,612 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {7604#true} {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #76#return; {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:25:32,612 INFO L272 TraceCheckUtils]: 12: Hoare triple {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:32,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:32,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:32,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:32,613 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7604#true} {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:25:32,613 INFO L272 TraceCheckUtils]: 17: Hoare triple {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:32,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:32,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:32,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:32,613 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7604#true} {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:25:32,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:25:32,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !false; {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:25:32,614 INFO L272 TraceCheckUtils]: 24: Hoare triple {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:32,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:32,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:32,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:32,624 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7604#true} {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #76#return; {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:25:32,624 INFO L272 TraceCheckUtils]: 29: Hoare triple {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:32,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:32,624 INFO L290 TraceCheckUtils]: 31: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:32,624 INFO L290 TraceCheckUtils]: 32: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:32,625 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7604#true} {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:25:32,625 INFO L272 TraceCheckUtils]: 34: Hoare triple {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:32,625 INFO L290 TraceCheckUtils]: 35: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:32,625 INFO L290 TraceCheckUtils]: 36: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:32,625 INFO L290 TraceCheckUtils]: 37: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:32,626 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7604#true} {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:25:32,626 INFO L290 TraceCheckUtils]: 39: Hoare triple {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 04:25:32,627 INFO L290 TraceCheckUtils]: 40: Hoare triple {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !false; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 04:25:32,627 INFO L272 TraceCheckUtils]: 41: Hoare triple {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:32,627 INFO L290 TraceCheckUtils]: 42: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:32,627 INFO L290 TraceCheckUtils]: 43: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:32,627 INFO L290 TraceCheckUtils]: 44: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:32,628 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7604#true} {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #76#return; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 04:25:32,628 INFO L272 TraceCheckUtils]: 46: Hoare triple {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:32,628 INFO L290 TraceCheckUtils]: 47: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:32,628 INFO L290 TraceCheckUtils]: 48: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:32,628 INFO L290 TraceCheckUtils]: 49: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:32,629 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7604#true} {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #78#return; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 04:25:32,629 INFO L272 TraceCheckUtils]: 51: Hoare triple {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:32,629 INFO L290 TraceCheckUtils]: 52: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:32,629 INFO L290 TraceCheckUtils]: 53: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:32,630 INFO L290 TraceCheckUtils]: 54: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:32,630 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7604#true} {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #80#return; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 04:25:32,631 INFO L290 TraceCheckUtils]: 56: Hoare triple {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !(~r~0 >= ~d~0); {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 04:25:32,631 INFO L290 TraceCheckUtils]: 57: Hoare triple {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !false; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 04:25:32,631 INFO L272 TraceCheckUtils]: 58: Hoare triple {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:32,631 INFO L290 TraceCheckUtils]: 59: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:32,632 INFO L290 TraceCheckUtils]: 60: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:32,632 INFO L290 TraceCheckUtils]: 61: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:32,632 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {7604#true} {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #82#return; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 04:25:32,632 INFO L272 TraceCheckUtils]: 63: Hoare triple {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:32,633 INFO L290 TraceCheckUtils]: 64: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:32,633 INFO L290 TraceCheckUtils]: 65: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:32,633 INFO L290 TraceCheckUtils]: 66: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:32,633 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {7604#true} {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #84#return; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 04:25:32,634 INFO L290 TraceCheckUtils]: 68: Hoare triple {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= 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); {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:25:32,635 INFO L290 TraceCheckUtils]: 69: Hoare triple {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7819#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 04:25:32,635 INFO L290 TraceCheckUtils]: 70: Hoare triple {7819#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} assume !false; {7819#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 04:25:32,635 INFO L272 TraceCheckUtils]: 71: Hoare triple {7819#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:32,635 INFO L290 TraceCheckUtils]: 72: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:32,635 INFO L290 TraceCheckUtils]: 73: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:32,635 INFO L290 TraceCheckUtils]: 74: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:32,636 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {7604#true} {7819#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #82#return; {7819#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 04:25:32,636 INFO L272 TraceCheckUtils]: 76: Hoare triple {7819#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:32,636 INFO L290 TraceCheckUtils]: 77: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:32,636 INFO L290 TraceCheckUtils]: 78: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:32,636 INFO L290 TraceCheckUtils]: 79: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:32,637 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7604#true} {7819#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #84#return; {7819#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 04:25:32,638 INFO L290 TraceCheckUtils]: 81: Hoare triple {7819#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~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); {7856#(and (= main_~p~0 (div main_~q~0 2)) (= main_~q~0 2) (= (+ (* (- 2) main_~B~0) main_~A~0) main_~r~0) (= (div (* main_~B~0 2) 2) main_~d~0) (= main_~B~0 1))} is VALID [2022-04-28 04:25:32,639 INFO L290 TraceCheckUtils]: 82: Hoare triple {7856#(and (= main_~p~0 (div main_~q~0 2)) (= main_~q~0 2) (= (+ (* (- 2) main_~B~0) main_~A~0) main_~r~0) (= (div (* main_~B~0 2) 2) main_~d~0) (= main_~B~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7860#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} is VALID [2022-04-28 04:25:32,640 INFO L290 TraceCheckUtils]: 83: Hoare triple {7860#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} assume !false; {7860#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} is VALID [2022-04-28 04:25:32,641 INFO L272 TraceCheckUtils]: 84: Hoare triple {7860#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7867#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:25:32,641 INFO L290 TraceCheckUtils]: 85: Hoare triple {7867#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7871#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:25:32,641 INFO L290 TraceCheckUtils]: 86: Hoare triple {7871#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7605#false} is VALID [2022-04-28 04:25:32,642 INFO L290 TraceCheckUtils]: 87: Hoare triple {7605#false} assume !false; {7605#false} is VALID [2022-04-28 04:25:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 26 proven. 24 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 04:25:32,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:25:57,904 INFO L290 TraceCheckUtils]: 87: Hoare triple {7605#false} assume !false; {7605#false} is VALID [2022-04-28 04:25:57,905 INFO L290 TraceCheckUtils]: 86: Hoare triple {7871#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7605#false} is VALID [2022-04-28 04:25:57,905 INFO L290 TraceCheckUtils]: 85: Hoare triple {7867#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7871#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:25:57,906 INFO L272 TraceCheckUtils]: 84: Hoare triple {7887#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7867#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:25:57,906 INFO L290 TraceCheckUtils]: 83: Hoare triple {7887#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !false; {7887#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 04:25:57,920 INFO L290 TraceCheckUtils]: 82: Hoare triple {7894#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7887#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 04:25:57,942 INFO L290 TraceCheckUtils]: 81: Hoare triple {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} 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); {7894#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 04:25:57,943 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7604#true} {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #84#return; {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 04:25:57,943 INFO L290 TraceCheckUtils]: 79: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:57,943 INFO L290 TraceCheckUtils]: 78: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:57,943 INFO L290 TraceCheckUtils]: 77: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:57,943 INFO L272 TraceCheckUtils]: 76: Hoare triple {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:57,944 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {7604#true} {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #82#return; {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 04:25:57,944 INFO L290 TraceCheckUtils]: 74: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:57,944 INFO L290 TraceCheckUtils]: 73: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:57,944 INFO L290 TraceCheckUtils]: 72: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:57,944 INFO L272 TraceCheckUtils]: 71: Hoare triple {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:57,946 INFO L290 TraceCheckUtils]: 70: Hoare triple {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !false; {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 04:25:57,979 INFO L290 TraceCheckUtils]: 69: Hoare triple {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 04:25:58,319 INFO L290 TraceCheckUtils]: 68: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ 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))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) 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 (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ 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))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (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))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) 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 (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 04:25:58,320 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {7604#true} {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ 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))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) 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 (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ 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))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (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))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) 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 (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #84#return; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ 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))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) 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 (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ 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))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (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))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) 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 (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 04:25:58,320 INFO L290 TraceCheckUtils]: 66: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:58,320 INFO L290 TraceCheckUtils]: 65: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:58,320 INFO L290 TraceCheckUtils]: 64: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:58,321 INFO L272 TraceCheckUtils]: 63: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ 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))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) 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 (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ 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))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (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))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) 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 (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:58,322 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {7604#true} {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ 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))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) 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 (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ 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))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (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))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) 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 (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #82#return; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ 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))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) 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 (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ 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))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (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))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) 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 (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 04:25:58,322 INFO L290 TraceCheckUtils]: 61: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:58,322 INFO L290 TraceCheckUtils]: 60: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:58,322 INFO L290 TraceCheckUtils]: 59: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:58,322 INFO L272 TraceCheckUtils]: 58: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ 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))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) 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 (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ 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))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (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))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) 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 (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:58,327 INFO L290 TraceCheckUtils]: 57: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ 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))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) 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 (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ 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))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (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))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) 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 (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !false; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ 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))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) 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 (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ 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))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (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))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) 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 (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 04:25:58,331 INFO L290 TraceCheckUtils]: 56: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ 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))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) 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 (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ 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))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (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))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) 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 (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !(~r~0 >= ~d~0); {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ 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))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) 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 (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ 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))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (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))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) 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 (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 04:25:58,332 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7604#true} {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ 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))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) 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 (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ 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))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (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))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) 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 (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #80#return; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ 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))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) 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 (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ 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))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (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))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) 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 (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 04:25:58,332 INFO L290 TraceCheckUtils]: 54: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:58,332 INFO L290 TraceCheckUtils]: 53: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:58,332 INFO L290 TraceCheckUtils]: 52: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:58,333 INFO L272 TraceCheckUtils]: 51: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ 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))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) 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 (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ 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))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (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))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) 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 (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:58,334 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7604#true} {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ 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))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) 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 (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ 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))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (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))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) 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 (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #78#return; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ 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))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) 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 (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ 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))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (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))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) 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 (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 04:25:58,334 INFO L290 TraceCheckUtils]: 49: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:58,334 INFO L290 TraceCheckUtils]: 48: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:58,334 INFO L290 TraceCheckUtils]: 47: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:58,334 INFO L272 TraceCheckUtils]: 46: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ 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))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) 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 (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ 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))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (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))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) 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 (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:58,335 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7604#true} {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ 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))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) 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 (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ 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))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (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))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) 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 (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #76#return; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ 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))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) 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 (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ 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))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (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))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) 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 (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 04:25:58,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:58,335 INFO L290 TraceCheckUtils]: 43: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:58,335 INFO L290 TraceCheckUtils]: 42: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:58,336 INFO L272 TraceCheckUtils]: 41: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ 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))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) 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 (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ 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))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (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))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) 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 (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:58,340 INFO L290 TraceCheckUtils]: 40: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ 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))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) 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 (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ 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))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (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))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) 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 (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !false; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ 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))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) 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 (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ 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))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (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))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) 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 (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 04:25:58,619 INFO L290 TraceCheckUtils]: 39: Hoare triple {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ 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))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) 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 (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ 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))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (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))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) 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 (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 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)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 04:25:58,620 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7604#true} {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #80#return; {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 04:25:58,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:58,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:58,620 INFO L290 TraceCheckUtils]: 35: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:58,620 INFO L272 TraceCheckUtils]: 34: Hoare triple {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:58,621 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7604#true} {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #78#return; {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 04:25:58,621 INFO L290 TraceCheckUtils]: 32: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:58,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:58,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:58,622 INFO L272 TraceCheckUtils]: 29: Hoare triple {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:58,622 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7604#true} {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #76#return; {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 04:25:58,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:58,623 INFO L290 TraceCheckUtils]: 26: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:58,623 INFO L290 TraceCheckUtils]: 25: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:58,623 INFO L272 TraceCheckUtils]: 24: Hoare triple {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:58,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !false; {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 04:25:58,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 04:25:58,653 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7604#true} {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #80#return; {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 04:25:58,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:58,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:58,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:58,653 INFO L272 TraceCheckUtils]: 17: Hoare triple {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:58,653 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7604#true} {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #78#return; {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 04:25:58,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:58,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:58,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:58,654 INFO L272 TraceCheckUtils]: 12: Hoare triple {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:58,654 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {7604#true} {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #76#return; {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 04:25:58,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:58,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 04:25:58,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 04:25:58,654 INFO L272 TraceCheckUtils]: 7: Hoare triple {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 04:25:58,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} assume !false; {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 04:25:58,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {7604#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 04:25:58,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {7604#true} call #t~ret5 := main(); {7604#true} is VALID [2022-04-28 04:25:58,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7604#true} {7604#true} #90#return; {7604#true} is VALID [2022-04-28 04:25:58,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 04:25:58,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {7604#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(8, 2);call #Ultimate.allocInit(12, 3); {7604#true} is VALID [2022-04-28 04:25:58,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {7604#true} call ULTIMATE.init(); {7604#true} is VALID [2022-04-28 04:25:58,657 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 26 proven. 19 refuted. 5 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 04:25:58,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:25:58,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674087617] [2022-04-28 04:25:58,657 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:25:58,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502067729] [2022-04-28 04:25:58,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502067729] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:25:58,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:25:58,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-28 04:25:58,657 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:25:58,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1663510602] [2022-04-28 04:25:58,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1663510602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:25:58,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:25:58,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 04:25:58,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138787303] [2022-04-28 04:25:58,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:25:58,658 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 88 [2022-04-28 04:25:58,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:25:58,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 04:25:58,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:25:58,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 04:25:58,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:25:58,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 04:25:58,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=179, Unknown=1, NotChecked=0, Total=240 [2022-04-28 04:25:58,704 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 04:25:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:25:59,820 INFO L93 Difference]: Finished difference Result 152 states and 176 transitions. [2022-04-28 04:25:59,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 04:25:59,821 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 88 [2022-04-28 04:25:59,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:25:59,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 04:25:59,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2022-04-28 04:25:59,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 04:25:59,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2022-04-28 04:25:59,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 115 transitions. [2022-04-28 04:25:59,953 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 04:25:59,955 INFO L225 Difference]: With dead ends: 152 [2022-04-28 04:25:59,955 INFO L226 Difference]: Without dead ends: 133 [2022-04-28 04:25:59,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 158 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=64, Invalid=207, Unknown=1, NotChecked=0, Total=272 [2022-04-28 04:25:59,956 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:25:59,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 219 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 04:25:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-28 04:26:00,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2022-04-28 04:26:00,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:26:00,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 131 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 84 states have internal predecessors, (90), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 04:26:00,079 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 131 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 84 states have internal predecessors, (90), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 04:26:00,079 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 131 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 84 states have internal predecessors, (90), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 04:26:00,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:26:00,082 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2022-04-28 04:26:00,082 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2022-04-28 04:26:00,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:26:00,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:26:00,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 84 states have internal predecessors, (90), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 133 states. [2022-04-28 04:26:00,083 INFO L87 Difference]: Start difference. First operand has 131 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 84 states have internal predecessors, (90), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 133 states. [2022-04-28 04:26:00,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:26:00,086 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2022-04-28 04:26:00,086 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2022-04-28 04:26:00,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:26:00,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:26:00,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:26:00,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:26:00,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 84 states have internal predecessors, (90), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 04:26:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 144 transitions. [2022-04-28 04:26:00,090 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 144 transitions. Word has length 88 [2022-04-28 04:26:00,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:26:00,090 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 144 transitions. [2022-04-28 04:26:00,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 04:26:00,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 144 transitions. [2022-04-28 04:26:00,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:26:00,307 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2022-04-28 04:26:00,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 04:26:00,308 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:26:00,308 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:26:00,324 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 04:26:00,508 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,SelfDestructingSolverStorable11 [2022-04-28 04:26:00,509 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:26:00,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:26:00,509 INFO L85 PathProgramCache]: Analyzing trace with hash 921896973, now seen corresponding path program 9 times [2022-04-28 04:26:00,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:26:00,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1186780261] [2022-04-28 04:26:03,825 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:26:03,826 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 04:26:03,826 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:26:03,826 INFO L85 PathProgramCache]: Analyzing trace with hash 921896973, now seen corresponding path program 10 times [2022-04-28 04:26:03,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:26:03,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113510880] [2022-04-28 04:26:03,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:26:03,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:26:03,836 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:26:03,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1543544671] [2022-04-28 04:26:03,836 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:26:03,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:26:03,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:26:03,839 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 04:26:03,839 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 04:26:03,918 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:26:03,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:26:03,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 04:26:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:26:03,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:26:06,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {8981#true} call ULTIMATE.init(); {8981#true} is VALID [2022-04-28 04:26:06,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {8981#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(8, 2);call #Ultimate.allocInit(12, 3); {8981#true} is VALID [2022-04-28 04:26:06,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-28 04:26:06,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8981#true} {8981#true} #90#return; {8981#true} is VALID [2022-04-28 04:26:06,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {8981#true} call #t~ret5 := main(); {8981#true} is VALID [2022-04-28 04:26:06,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {8981#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {8981#true} is VALID [2022-04-28 04:26:06,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {8981#true} assume !false; {8981#true} is VALID [2022-04-28 04:26:06,740 INFO L272 TraceCheckUtils]: 7: Hoare triple {8981#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 04:26:06,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-28 04:26:06,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-28 04:26:06,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-28 04:26:06,740 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {8981#true} {8981#true} #76#return; {8981#true} is VALID [2022-04-28 04:26:06,741 INFO L272 TraceCheckUtils]: 12: Hoare triple {8981#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 04:26:06,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-28 04:26:06,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-28 04:26:06,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-28 04:26:06,741 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8981#true} {8981#true} #78#return; {8981#true} is VALID [2022-04-28 04:26:06,741 INFO L272 TraceCheckUtils]: 17: Hoare triple {8981#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 04:26:06,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-28 04:26:06,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-28 04:26:06,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-28 04:26:06,741 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8981#true} {8981#true} #80#return; {8981#true} is VALID [2022-04-28 04:26:06,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {8981#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9052#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 04:26:06,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {9052#(= (mod main_~p~0 2) 0)} assume !false; {9052#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 04:26:06,742 INFO L272 TraceCheckUtils]: 24: Hoare triple {9052#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 04:26:06,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {8981#true} ~cond := #in~cond; {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:26:06,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:26:06,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:26:06,743 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} {9052#(= (mod main_~p~0 2) 0)} #76#return; {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:26:06,743 INFO L272 TraceCheckUtils]: 29: Hoare triple {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 04:26:06,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-28 04:26:06,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-28 04:26:06,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-28 04:26:06,744 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {8981#true} {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #78#return; {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:26:06,744 INFO L272 TraceCheckUtils]: 34: Hoare triple {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 04:26:06,744 INFO L290 TraceCheckUtils]: 35: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-28 04:26:06,744 INFO L290 TraceCheckUtils]: 36: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-28 04:26:06,744 INFO L290 TraceCheckUtils]: 37: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-28 04:26:06,745 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8981#true} {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #80#return; {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:26:06,746 INFO L290 TraceCheckUtils]: 39: Hoare triple {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:26:06,746 INFO L290 TraceCheckUtils]: 40: Hoare triple {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !false; {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:26:06,746 INFO L272 TraceCheckUtils]: 41: Hoare triple {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 04:26:06,746 INFO L290 TraceCheckUtils]: 42: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-28 04:26:06,746 INFO L290 TraceCheckUtils]: 43: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-28 04:26:06,747 INFO L290 TraceCheckUtils]: 44: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-28 04:26:06,747 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8981#true} {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #76#return; {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:26:06,747 INFO L272 TraceCheckUtils]: 46: Hoare triple {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 04:26:06,747 INFO L290 TraceCheckUtils]: 47: Hoare triple {8981#true} ~cond := #in~cond; {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:26:06,748 INFO L290 TraceCheckUtils]: 48: Hoare triple {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:26:06,748 INFO L290 TraceCheckUtils]: 49: Hoare triple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:26:06,749 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #78#return; {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:26:06,749 INFO L272 TraceCheckUtils]: 51: Hoare triple {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 04:26:06,749 INFO L290 TraceCheckUtils]: 52: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-28 04:26:06,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-28 04:26:06,749 INFO L290 TraceCheckUtils]: 54: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-28 04:26:06,749 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8981#true} {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #80#return; {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:26:06,750 INFO L290 TraceCheckUtils]: 56: Hoare triple {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:26:06,750 INFO L290 TraceCheckUtils]: 57: Hoare triple {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !false; {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:26:06,750 INFO L272 TraceCheckUtils]: 58: Hoare triple {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 04:26:06,750 INFO L290 TraceCheckUtils]: 59: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-28 04:26:06,750 INFO L290 TraceCheckUtils]: 60: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-28 04:26:06,750 INFO L290 TraceCheckUtils]: 61: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-28 04:26:06,751 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {8981#true} {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #82#return; {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:26:06,751 INFO L272 TraceCheckUtils]: 63: Hoare triple {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 04:26:06,751 INFO L290 TraceCheckUtils]: 64: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-28 04:26:06,751 INFO L290 TraceCheckUtils]: 65: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-28 04:26:06,751 INFO L290 TraceCheckUtils]: 66: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-28 04:26:06,752 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {8981#true} {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #84#return; {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 04:26:06,753 INFO L290 TraceCheckUtils]: 68: Hoare triple {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 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); {9196#(and (= main_~A~0 main_~r~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~q~0 0))} is VALID [2022-04-28 04:26:06,753 INFO L290 TraceCheckUtils]: 69: Hoare triple {9196#(and (= main_~A~0 main_~r~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~q~0 0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 04:26:06,754 INFO L290 TraceCheckUtils]: 70: Hoare triple {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} assume !false; {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 04:26:06,754 INFO L272 TraceCheckUtils]: 71: Hoare triple {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 04:26:06,754 INFO L290 TraceCheckUtils]: 72: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-28 04:26:06,754 INFO L290 TraceCheckUtils]: 73: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-28 04:26:06,754 INFO L290 TraceCheckUtils]: 74: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-28 04:26:06,755 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {8981#true} {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #82#return; {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 04:26:06,755 INFO L272 TraceCheckUtils]: 76: Hoare triple {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 04:26:06,755 INFO L290 TraceCheckUtils]: 77: Hoare triple {8981#true} ~cond := #in~cond; {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:26:06,755 INFO L290 TraceCheckUtils]: 78: Hoare triple {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:26:06,755 INFO L290 TraceCheckUtils]: 79: Hoare triple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:26:06,757 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #84#return; {9234#(and (= main_~q~0 main_~p~0) (= main_~r~0 (+ main_~A~0 (* (- 1) (* main_~B~0 main_~p~0)))) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)))} is VALID [2022-04-28 04:26:06,758 INFO L290 TraceCheckUtils]: 81: Hoare triple {9234#(and (= main_~q~0 main_~p~0) (= main_~r~0 (+ main_~A~0 (* (- 1) (* main_~B~0 main_~p~0)))) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)))} 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); {9238#(and (= main_~p~0 (div main_~q~0 2)) (< (div (* (- 1) main_~q~0) (- 2)) (+ (div main_~q~0 2) 1)) (= (+ main_~A~0 (* (- 1) (* main_~B~0 main_~q~0))) main_~r~0))} is VALID [2022-04-28 04:26:06,761 INFO L290 TraceCheckUtils]: 82: Hoare triple {9238#(and (= main_~p~0 (div main_~q~0 2)) (< (div (* (- 1) main_~q~0) (- 2)) (+ (div main_~q~0 2) 1)) (= (+ main_~A~0 (* (- 1) (* main_~B~0 main_~q~0))) main_~r~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {9242#(and (< (div (+ main_~p~0 (* (- 1) main_~q~0)) (- 2)) (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1)) (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= main_~r~0 (+ (* (- 1) main_~d~0) (* (- 1) (* main_~B~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~A~0)))} is VALID [2022-04-28 04:26:06,761 INFO L290 TraceCheckUtils]: 83: Hoare triple {9242#(and (< (div (+ main_~p~0 (* (- 1) main_~q~0)) (- 2)) (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1)) (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= main_~r~0 (+ (* (- 1) main_~d~0) (* (- 1) (* main_~B~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~A~0)))} assume !false; {9242#(and (< (div (+ main_~p~0 (* (- 1) main_~q~0)) (- 2)) (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1)) (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= main_~r~0 (+ (* (- 1) main_~d~0) (* (- 1) (* main_~B~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~A~0)))} is VALID [2022-04-28 04:26:06,761 INFO L272 TraceCheckUtils]: 84: Hoare triple {9242#(and (< (div (+ main_~p~0 (* (- 1) main_~q~0)) (- 2)) (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1)) (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= main_~r~0 (+ (* (- 1) main_~d~0) (* (- 1) (* main_~B~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~A~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 04:26:06,761 INFO L290 TraceCheckUtils]: 85: Hoare triple {8981#true} ~cond := #in~cond; {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:26:06,762 INFO L290 TraceCheckUtils]: 86: Hoare triple {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:26:06,762 INFO L290 TraceCheckUtils]: 87: Hoare triple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:26:06,765 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} {9242#(and (< (div (+ main_~p~0 (* (- 1) main_~q~0)) (- 2)) (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1)) (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= main_~r~0 (+ (* (- 1) main_~d~0) (* (- 1) (* main_~B~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~A~0)))} #82#return; {9261#(exists ((aux_div_aux_mod_aux_mod_main_~q~0_41_59_77 Int) (aux_div_main_~q~0_41 Int) (aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77 Int)) (and (<= (+ (* 2 aux_div_main_~q~0_41) aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77) (* 2 aux_div_aux_mod_aux_mod_main_~q~0_41_59_77)) (<= (+ (* main_~p~0 2) aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77) (* 2 aux_div_aux_mod_aux_mod_main_~q~0_41_59_77)) (= (* main_~B~0 main_~p~0) main_~d~0) (<= 0 aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77) (< (* 2 aux_div_aux_mod_aux_mod_main_~q~0_41_59_77) (+ (* main_~p~0 2) 2 aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77)) (< aux_div_aux_mod_aux_mod_main_~q~0_41_59_77 (+ aux_div_main_~q~0_41 1))))} is VALID [2022-04-28 04:26:06,766 INFO L272 TraceCheckUtils]: 89: Hoare triple {9261#(exists ((aux_div_aux_mod_aux_mod_main_~q~0_41_59_77 Int) (aux_div_main_~q~0_41 Int) (aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77 Int)) (and (<= (+ (* 2 aux_div_main_~q~0_41) aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77) (* 2 aux_div_aux_mod_aux_mod_main_~q~0_41_59_77)) (<= (+ (* main_~p~0 2) aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77) (* 2 aux_div_aux_mod_aux_mod_main_~q~0_41_59_77)) (= (* main_~B~0 main_~p~0) main_~d~0) (<= 0 aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77) (< (* 2 aux_div_aux_mod_aux_mod_main_~q~0_41_59_77) (+ (* main_~p~0 2) 2 aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77)) (< aux_div_aux_mod_aux_mod_main_~q~0_41_59_77 (+ aux_div_main_~q~0_41 1))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9265#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:26:06,766 INFO L290 TraceCheckUtils]: 90: Hoare triple {9265#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9269#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:26:06,766 INFO L290 TraceCheckUtils]: 91: Hoare triple {9269#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8982#false} is VALID [2022-04-28 04:26:06,766 INFO L290 TraceCheckUtils]: 92: Hoare triple {8982#false} assume !false; {8982#false} is VALID [2022-04-28 04:26:06,767 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 126 proven. 48 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2022-04-28 04:26:06,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:26:35,147 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:26:45,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:26:45,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113510880] [2022-04-28 04:26:45,006 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:26:45,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543544671] [2022-04-28 04:26:45,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543544671] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:26:45,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 04:26:45,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-28 04:26:45,007 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:26:45,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1186780261] [2022-04-28 04:26:45,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1186780261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:26:45,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:26:45,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 04:26:45,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530133177] [2022-04-28 04:26:45,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:26:45,007 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) Word has length 93 [2022-04-28 04:26:45,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:26:45,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 04:26:45,068 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 04:26:45,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 04:26:45,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:26:45,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 04:26:45,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-04-28 04:26:45,069 INFO L87 Difference]: Start difference. First operand 131 states and 144 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 04:26:52,543 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 04:26:54,550 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:26:56,552 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 04:26:58,555 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 04:26:59,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:26:59,400 INFO L93 Difference]: Finished difference Result 150 states and 171 transitions. [2022-04-28 04:26:59,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 04:26:59,400 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) Word has length 93 [2022-04-28 04:26:59,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:26:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 04:26:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 83 transitions. [2022-04-28 04:26:59,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 04:26:59,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 83 transitions. [2022-04-28 04:26:59,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 83 transitions. [2022-04-28 04:26:59,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:26:59,532 INFO L225 Difference]: With dead ends: 150 [2022-04-28 04:26:59,532 INFO L226 Difference]: Without dead ends: 148 [2022-04-28 04:26:59,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2022-04-28 04:26:59,532 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 19 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 28 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:26:59,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 198 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 399 Invalid, 4 Unknown, 59 Unchecked, 9.0s Time] [2022-04-28 04:26:59,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-04-28 04:26:59,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2022-04-28 04:26:59,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:26:59,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 144 states, 90 states have (on average 1.0888888888888888) internal successors, (98), 94 states have internal predecessors, (98), 33 states have call successors, (33), 21 states have call predecessors, (33), 20 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 04:26:59,656 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 144 states, 90 states have (on average 1.0888888888888888) internal successors, (98), 94 states have internal predecessors, (98), 33 states have call successors, (33), 21 states have call predecessors, (33), 20 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 04:26:59,657 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 144 states, 90 states have (on average 1.0888888888888888) internal successors, (98), 94 states have internal predecessors, (98), 33 states have call successors, (33), 21 states have call predecessors, (33), 20 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 04:26:59,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:26:59,660 INFO L93 Difference]: Finished difference Result 148 states and 169 transitions. [2022-04-28 04:26:59,660 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 169 transitions. [2022-04-28 04:26:59,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:26:59,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:26:59,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 90 states have (on average 1.0888888888888888) internal successors, (98), 94 states have internal predecessors, (98), 33 states have call successors, (33), 21 states have call predecessors, (33), 20 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) Second operand 148 states. [2022-04-28 04:26:59,661 INFO L87 Difference]: Start difference. First operand has 144 states, 90 states have (on average 1.0888888888888888) internal successors, (98), 94 states have internal predecessors, (98), 33 states have call successors, (33), 21 states have call predecessors, (33), 20 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) Second operand 148 states. [2022-04-28 04:26:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:26:59,665 INFO L93 Difference]: Finished difference Result 148 states and 169 transitions. [2022-04-28 04:26:59,665 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 169 transitions. [2022-04-28 04:26:59,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:26:59,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:26:59,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:26:59,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:26:59,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 90 states have (on average 1.0888888888888888) internal successors, (98), 94 states have internal predecessors, (98), 33 states have call successors, (33), 21 states have call predecessors, (33), 20 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 04:26:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 162 transitions. [2022-04-28 04:26:59,669 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 162 transitions. Word has length 93 [2022-04-28 04:26:59,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:26:59,669 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 162 transitions. [2022-04-28 04:26:59,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 04:26:59,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 162 transitions. [2022-04-28 04:27:00,016 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 04:27:00,017 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 162 transitions. [2022-04-28 04:27:00,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 04:27:00,017 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:27:00,018 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:27:00,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-28 04:27:00,231 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,SelfDestructingSolverStorable12 [2022-04-28 04:27:00,231 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:27:00,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:27:00,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2013246961, now seen corresponding path program 5 times [2022-04-28 04:27:00,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:27:00,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [967889385] [2022-04-28 04:27:03,998 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:27:03,998 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 04:27:03,998 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:27:03,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2013246961, now seen corresponding path program 6 times [2022-04-28 04:27:03,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:27:03,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798508583] [2022-04-28 04:27:03,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:27:03,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:27:04,007 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:27:04,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1998540767] [2022-04-28 04:27:04,007 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:27:04,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:27:04,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:27:04,012 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 04:27:04,012 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 04:27:04,060 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 04:27:04,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:27:04,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 04:27:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:27:04,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:27:04,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {10211#true} call ULTIMATE.init(); {10211#true} is VALID [2022-04-28 04:27:04,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {10211#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(8, 2);call #Ultimate.allocInit(12, 3); {10211#true} is VALID [2022-04-28 04:27:04,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:04,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10211#true} {10211#true} #90#return; {10211#true} is VALID [2022-04-28 04:27:04,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {10211#true} call #t~ret5 := main(); {10211#true} is VALID [2022-04-28 04:27:04,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {10211#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {10231#(= main_~B~0 1)} assume !false; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,320 INFO L272 TraceCheckUtils]: 7: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:04,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:04,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:04,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:04,320 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #76#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,321 INFO L272 TraceCheckUtils]: 12: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:04,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:04,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:04,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:04,321 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #78#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,321 INFO L272 TraceCheckUtils]: 17: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:04,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:04,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:04,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:04,322 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #80#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {10231#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {10231#(= main_~B~0 1)} assume !false; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,322 INFO L272 TraceCheckUtils]: 24: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:04,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:04,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:04,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:04,323 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #76#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,323 INFO L272 TraceCheckUtils]: 29: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:04,323 INFO L290 TraceCheckUtils]: 30: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:04,323 INFO L290 TraceCheckUtils]: 31: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:04,323 INFO L290 TraceCheckUtils]: 32: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:04,324 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #78#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,324 INFO L272 TraceCheckUtils]: 34: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:04,324 INFO L290 TraceCheckUtils]: 35: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:04,324 INFO L290 TraceCheckUtils]: 36: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:04,324 INFO L290 TraceCheckUtils]: 37: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:04,324 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #80#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,324 INFO L290 TraceCheckUtils]: 39: Hoare triple {10231#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,325 INFO L290 TraceCheckUtils]: 40: Hoare triple {10231#(= main_~B~0 1)} assume !false; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,325 INFO L272 TraceCheckUtils]: 41: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:04,325 INFO L290 TraceCheckUtils]: 42: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:04,325 INFO L290 TraceCheckUtils]: 43: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:04,325 INFO L290 TraceCheckUtils]: 44: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:04,325 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #76#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,325 INFO L272 TraceCheckUtils]: 46: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:04,325 INFO L290 TraceCheckUtils]: 47: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:04,325 INFO L290 TraceCheckUtils]: 48: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:04,326 INFO L290 TraceCheckUtils]: 49: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:04,326 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #78#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,326 INFO L272 TraceCheckUtils]: 51: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:04,326 INFO L290 TraceCheckUtils]: 52: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:04,326 INFO L290 TraceCheckUtils]: 53: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:04,326 INFO L290 TraceCheckUtils]: 54: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:04,327 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #80#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,327 INFO L290 TraceCheckUtils]: 56: Hoare triple {10231#(= main_~B~0 1)} assume !(~r~0 >= ~d~0); {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,327 INFO L290 TraceCheckUtils]: 57: Hoare triple {10231#(= main_~B~0 1)} assume !false; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,327 INFO L272 TraceCheckUtils]: 58: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:04,327 INFO L290 TraceCheckUtils]: 59: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:04,327 INFO L290 TraceCheckUtils]: 60: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:04,327 INFO L290 TraceCheckUtils]: 61: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:04,328 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #82#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,328 INFO L272 TraceCheckUtils]: 63: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:04,328 INFO L290 TraceCheckUtils]: 64: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:04,328 INFO L290 TraceCheckUtils]: 65: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:04,328 INFO L290 TraceCheckUtils]: 66: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:04,329 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #84#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,329 INFO L290 TraceCheckUtils]: 68: Hoare triple {10231#(= main_~B~0 1)} 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); {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,329 INFO L290 TraceCheckUtils]: 69: Hoare triple {10231#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,329 INFO L290 TraceCheckUtils]: 70: Hoare triple {10231#(= main_~B~0 1)} assume !false; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,329 INFO L272 TraceCheckUtils]: 71: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:04,330 INFO L290 TraceCheckUtils]: 72: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:04,330 INFO L290 TraceCheckUtils]: 73: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:04,330 INFO L290 TraceCheckUtils]: 74: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:04,330 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #82#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,330 INFO L272 TraceCheckUtils]: 76: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:04,330 INFO L290 TraceCheckUtils]: 77: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:04,330 INFO L290 TraceCheckUtils]: 78: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:04,330 INFO L290 TraceCheckUtils]: 79: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:04,331 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #84#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,331 INFO L290 TraceCheckUtils]: 81: Hoare triple {10231#(= main_~B~0 1)} 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); {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,331 INFO L290 TraceCheckUtils]: 82: Hoare triple {10231#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,331 INFO L290 TraceCheckUtils]: 83: Hoare triple {10231#(= main_~B~0 1)} assume !false; {10231#(= main_~B~0 1)} is VALID [2022-04-28 04:27:04,332 INFO L272 TraceCheckUtils]: 84: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:04,332 INFO L290 TraceCheckUtils]: 85: Hoare triple {10211#true} ~cond := #in~cond; {10472#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:27:04,332 INFO L290 TraceCheckUtils]: 86: Hoare triple {10472#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:27:04,332 INFO L290 TraceCheckUtils]: 87: Hoare triple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:27:04,333 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} {10231#(= main_~B~0 1)} #82#return; {10483#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-28 04:27:04,333 INFO L272 TraceCheckUtils]: 89: Hoare triple {10483#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:04,333 INFO L290 TraceCheckUtils]: 90: Hoare triple {10211#true} ~cond := #in~cond; {10472#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:27:04,334 INFO L290 TraceCheckUtils]: 91: Hoare triple {10472#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:27:04,334 INFO L290 TraceCheckUtils]: 92: Hoare triple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:27:04,335 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} {10483#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} #84#return; {10499#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 main_~p~0))} is VALID [2022-04-28 04:27:04,335 INFO L290 TraceCheckUtils]: 94: Hoare triple {10499#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 main_~p~0))} assume !(1 != ~p~0); {10503#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1))} is VALID [2022-04-28 04:27:04,336 INFO L272 TraceCheckUtils]: 95: Hoare triple {10503#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1))} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {10507#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:27:04,336 INFO L290 TraceCheckUtils]: 96: Hoare triple {10507#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10511#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:27:04,336 INFO L290 TraceCheckUtils]: 97: Hoare triple {10511#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10212#false} is VALID [2022-04-28 04:27:04,337 INFO L290 TraceCheckUtils]: 98: Hoare triple {10212#false} assume !false; {10212#false} is VALID [2022-04-28 04:27:04,337 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 108 proven. 4 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-04-28 04:27:04,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:27:20,277 INFO L290 TraceCheckUtils]: 98: Hoare triple {10212#false} assume !false; {10212#false} is VALID [2022-04-28 04:27:20,278 INFO L290 TraceCheckUtils]: 97: Hoare triple {10511#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10212#false} is VALID [2022-04-28 04:27:20,278 INFO L290 TraceCheckUtils]: 96: Hoare triple {10507#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10511#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:27:20,279 INFO L272 TraceCheckUtils]: 95: Hoare triple {10527#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {10507#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:27:20,283 INFO L290 TraceCheckUtils]: 94: Hoare triple {10531#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} assume !(1 != ~p~0); {10527#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 04:27:20,285 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} {10535#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #84#return; {10531#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} is VALID [2022-04-28 04:27:20,285 INFO L290 TraceCheckUtils]: 92: Hoare triple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:27:20,286 INFO L290 TraceCheckUtils]: 91: Hoare triple {10545#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:27:20,286 INFO L290 TraceCheckUtils]: 90: Hoare triple {10211#true} ~cond := #in~cond; {10545#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:27:20,286 INFO L272 TraceCheckUtils]: 89: Hoare triple {10535#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:20,287 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} {10211#true} #82#return; {10535#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 04:27:20,287 INFO L290 TraceCheckUtils]: 87: Hoare triple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:27:20,287 INFO L290 TraceCheckUtils]: 86: Hoare triple {10545#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:27:20,288 INFO L290 TraceCheckUtils]: 85: Hoare triple {10211#true} ~cond := #in~cond; {10545#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:27:20,288 INFO L272 TraceCheckUtils]: 84: Hoare triple {10211#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:20,288 INFO L290 TraceCheckUtils]: 83: Hoare triple {10211#true} assume !false; {10211#true} is VALID [2022-04-28 04:27:20,288 INFO L290 TraceCheckUtils]: 82: Hoare triple {10211#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10211#true} is VALID [2022-04-28 04:27:20,288 INFO L290 TraceCheckUtils]: 81: Hoare triple {10211#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); {10211#true} is VALID [2022-04-28 04:27:20,288 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {10211#true} {10211#true} #84#return; {10211#true} is VALID [2022-04-28 04:27:20,288 INFO L290 TraceCheckUtils]: 79: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:20,288 INFO L290 TraceCheckUtils]: 78: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:20,288 INFO L290 TraceCheckUtils]: 77: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:20,288 INFO L272 TraceCheckUtils]: 76: Hoare triple {10211#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:20,288 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {10211#true} {10211#true} #82#return; {10211#true} is VALID [2022-04-28 04:27:20,288 INFO L290 TraceCheckUtils]: 74: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:20,288 INFO L290 TraceCheckUtils]: 73: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:20,288 INFO L290 TraceCheckUtils]: 72: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:20,288 INFO L272 TraceCheckUtils]: 71: Hoare triple {10211#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:20,288 INFO L290 TraceCheckUtils]: 70: Hoare triple {10211#true} assume !false; {10211#true} is VALID [2022-04-28 04:27:20,288 INFO L290 TraceCheckUtils]: 69: Hoare triple {10211#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10211#true} is VALID [2022-04-28 04:27:20,289 INFO L290 TraceCheckUtils]: 68: Hoare triple {10211#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); {10211#true} is VALID [2022-04-28 04:27:20,289 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {10211#true} {10211#true} #84#return; {10211#true} is VALID [2022-04-28 04:27:20,289 INFO L290 TraceCheckUtils]: 66: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:20,289 INFO L290 TraceCheckUtils]: 65: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:20,289 INFO L290 TraceCheckUtils]: 64: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:20,289 INFO L272 TraceCheckUtils]: 63: Hoare triple {10211#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:20,289 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10211#true} {10211#true} #82#return; {10211#true} is VALID [2022-04-28 04:27:20,289 INFO L290 TraceCheckUtils]: 61: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:20,289 INFO L290 TraceCheckUtils]: 60: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:20,289 INFO L290 TraceCheckUtils]: 59: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:20,289 INFO L272 TraceCheckUtils]: 58: Hoare triple {10211#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:20,289 INFO L290 TraceCheckUtils]: 57: Hoare triple {10211#true} assume !false; {10211#true} is VALID [2022-04-28 04:27:20,289 INFO L290 TraceCheckUtils]: 56: Hoare triple {10211#true} assume !(~r~0 >= ~d~0); {10211#true} is VALID [2022-04-28 04:27:20,289 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10211#true} {10211#true} #80#return; {10211#true} is VALID [2022-04-28 04:27:20,290 INFO L290 TraceCheckUtils]: 54: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:20,290 INFO L290 TraceCheckUtils]: 53: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:20,290 INFO L290 TraceCheckUtils]: 52: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:20,290 INFO L272 TraceCheckUtils]: 51: Hoare triple {10211#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:20,290 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10211#true} {10211#true} #78#return; {10211#true} is VALID [2022-04-28 04:27:20,290 INFO L290 TraceCheckUtils]: 49: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:20,290 INFO L290 TraceCheckUtils]: 48: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:20,290 INFO L290 TraceCheckUtils]: 47: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:20,290 INFO L272 TraceCheckUtils]: 46: Hoare triple {10211#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:20,290 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10211#true} {10211#true} #76#return; {10211#true} is VALID [2022-04-28 04:27:20,290 INFO L290 TraceCheckUtils]: 44: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:20,290 INFO L290 TraceCheckUtils]: 43: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:20,291 INFO L290 TraceCheckUtils]: 42: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:20,291 INFO L272 TraceCheckUtils]: 41: Hoare triple {10211#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:20,291 INFO L290 TraceCheckUtils]: 40: Hoare triple {10211#true} assume !false; {10211#true} is VALID [2022-04-28 04:27:20,291 INFO L290 TraceCheckUtils]: 39: Hoare triple {10211#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10211#true} is VALID [2022-04-28 04:27:20,291 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10211#true} {10211#true} #80#return; {10211#true} is VALID [2022-04-28 04:27:20,291 INFO L290 TraceCheckUtils]: 37: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:20,291 INFO L290 TraceCheckUtils]: 36: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:20,291 INFO L290 TraceCheckUtils]: 35: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:20,291 INFO L272 TraceCheckUtils]: 34: Hoare triple {10211#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:20,291 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {10211#true} {10211#true} #78#return; {10211#true} is VALID [2022-04-28 04:27:20,291 INFO L290 TraceCheckUtils]: 32: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:20,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:20,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:20,292 INFO L272 TraceCheckUtils]: 29: Hoare triple {10211#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:20,292 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10211#true} {10211#true} #76#return; {10211#true} is VALID [2022-04-28 04:27:20,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:20,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:20,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:20,292 INFO L272 TraceCheckUtils]: 24: Hoare triple {10211#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:20,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {10211#true} assume !false; {10211#true} is VALID [2022-04-28 04:27:20,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {10211#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10211#true} is VALID [2022-04-28 04:27:20,292 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10211#true} {10211#true} #80#return; {10211#true} is VALID [2022-04-28 04:27:20,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:20,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:20,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:20,293 INFO L272 TraceCheckUtils]: 17: Hoare triple {10211#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:20,293 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10211#true} {10211#true} #78#return; {10211#true} is VALID [2022-04-28 04:27:20,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:20,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:20,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:20,293 INFO L272 TraceCheckUtils]: 12: Hoare triple {10211#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:20,293 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {10211#true} {10211#true} #76#return; {10211#true} is VALID [2022-04-28 04:27:20,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:20,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 04:27:20,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 04:27:20,293 INFO L272 TraceCheckUtils]: 7: Hoare triple {10211#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 04:27:20,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {10211#true} assume !false; {10211#true} is VALID [2022-04-28 04:27:20,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {10211#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {10211#true} is VALID [2022-04-28 04:27:20,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {10211#true} call #t~ret5 := main(); {10211#true} is VALID [2022-04-28 04:27:20,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10211#true} {10211#true} #90#return; {10211#true} is VALID [2022-04-28 04:27:20,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 04:27:20,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {10211#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(8, 2);call #Ultimate.allocInit(12, 3); {10211#true} is VALID [2022-04-28 04:27:20,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {10211#true} call ULTIMATE.init(); {10211#true} is VALID [2022-04-28 04:27:20,294 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-04-28 04:27:20,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:27:20,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798508583] [2022-04-28 04:27:20,294 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:27:20,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998540767] [2022-04-28 04:27:20,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998540767] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:27:20,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:27:20,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2022-04-28 04:27:20,295 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:27:20,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [967889385] [2022-04-28 04:27:20,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [967889385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:27:20,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:27:20,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 04:27:20,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709810332] [2022-04-28 04:27:20,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:27:20,295 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2022-04-28 04:27:20,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:27:20,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 04:27:20,323 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 04:27:20,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 04:27:20,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:27:20,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 04:27:20,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 04:27:20,324 INFO L87 Difference]: Start difference. First operand 144 states and 162 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 04:27:20,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:27:20,852 INFO L93 Difference]: Finished difference Result 144 states and 162 transitions. [2022-04-28 04:27:20,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:27:20,852 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2022-04-28 04:27:20,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:27:20,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 04:27:20,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 04:27:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 04:27:20,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 04:27:20,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-28 04:27:20,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:27:20,898 INFO L225 Difference]: With dead ends: 144 [2022-04-28 04:27:20,898 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 04:27:20,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-04-28 04:27:20,899 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:27:20,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 70 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:27:20,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 04:27:20,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 04:27:20,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:27:20,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:27:20,900 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:27:20,900 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:27:20,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:27:20,900 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:27:20,900 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:27:20,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:27:20,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:27:20,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 04:27:20,900 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 04:27:20,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:27:20,900 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:27:20,900 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:27:20,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:27:20,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:27:20,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:27:20,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:27:20,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:27:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 04:27:20,900 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2022-04-28 04:27:20,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:27:20,901 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 04:27:20,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 04:27:20,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 04:27:20,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:27:20,901 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:27:20,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:27:20,903 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 04:27:20,924 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 04:27:21,119 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,SelfDestructingSolverStorable13 [2022-04-28 04:27:21,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 04:27:25,660 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-28 04:27:25,660 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-28 04:27:25,660 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-28 04:27:25,660 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 11 13) no Hoare annotation was computed. [2022-04-28 04:27:25,660 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-28 04:27:25,660 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-28 04:27:25,660 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-28 04:27:25,660 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 41) the Hoare annotation is: (let ((.cse0 (= main_~q~0 0)) (.cse1 (= main_~B~0 1)) (.cse2 (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))) (or (and .cse0 .cse1 .cse2 (= main_~B~0 main_~d~0) (= main_~p~0 1)) (let ((.cse3 (div main_~d~0 2))) (and (= (* main_~B~0 main_~p~0) main_~d~0) (<= .cse3 main_~r~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) .cse0 .cse1 (= (mod main_~p~0 2) 0) (<= 1 (div .cse3 2)) .cse2)) (and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) .cse0 .cse1 .cse2))) [2022-04-28 04:27:25,660 INFO L902 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: true [2022-04-28 04:27:25,660 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 22 60) the Hoare annotation is: true [2022-04-28 04:27:25,660 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 22 60) the Hoare annotation is: true [2022-04-28 04:27:25,660 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (and (= main_~d~0 main_~p~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)) [2022-04-28 04:27:25,661 INFO L895 garLoopResultBuilder]: At program point L44-1(line 44) the Hoare annotation is: (and (= main_~d~0 main_~p~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)) [2022-04-28 04:27:25,661 INFO L895 garLoopResultBuilder]: At program point L36(lines 33 41) the Hoare annotation is: (let ((.cse0 (= main_~q~0 0)) (.cse1 (= main_~B~0 1)) (.cse2 (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))) (or (and .cse0 .cse1 .cse2 (= main_~B~0 main_~d~0) (= main_~p~0 1)) (let ((.cse3 (div main_~d~0 2))) (and (= (* main_~B~0 main_~p~0) main_~d~0) (<= .cse3 main_~r~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) .cse0 .cse1 (= (mod main_~p~0 2) 0) (<= 1 (div .cse3 2)) .cse2)) (and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) .cse0 .cse1 .cse2))) [2022-04-28 04:27:25,661 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse0 (= main_~q~0 0)) (.cse1 (= main_~B~0 1)) (.cse2 (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))) (or (and .cse0 .cse1 .cse2 (= main_~B~0 main_~d~0) (= main_~p~0 1)) (let ((.cse3 (div main_~d~0 2))) (and (= (* main_~B~0 main_~p~0) main_~d~0) (<= .cse3 main_~r~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) .cse0 .cse1 (= (mod main_~p~0 2) 0) (<= 1 (div .cse3 2)) .cse2)) (and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) .cse0 .cse1 .cse2))) [2022-04-28 04:27:25,661 INFO L895 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse0 (= main_~q~0 0)) (.cse1 (= main_~B~0 1)) (.cse2 (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))) (or (and .cse0 .cse1 .cse2 (= main_~B~0 main_~d~0) (= main_~p~0 1)) (let ((.cse3 (div main_~d~0 2))) (and (= (* main_~B~0 main_~p~0) main_~d~0) (<= .cse3 main_~r~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) .cse0 .cse1 (= (mod main_~p~0 2) 0) (<= 1 (div .cse3 2)) .cse2)) (and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) .cse0 .cse1 .cse2))) [2022-04-28 04:27:25,661 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 60) the Hoare annotation is: true [2022-04-28 04:27:25,661 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1)) [2022-04-28 04:27:25,661 INFO L895 garLoopResultBuilder]: At program point L51(lines 51 54) the Hoare annotation is: (and (= main_~d~0 main_~p~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)) [2022-04-28 04:27:25,661 INFO L895 garLoopResultBuilder]: At program point L51-2(lines 22 60) the Hoare annotation is: (and (= main_~d~0 main_~p~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)) [2022-04-28 04:27:25,661 INFO L895 garLoopResultBuilder]: At program point L45(lines 43 55) the Hoare annotation is: (and (= main_~d~0 main_~p~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)) [2022-04-28 04:27:25,661 INFO L895 garLoopResultBuilder]: At program point L43-1(lines 43 55) the Hoare annotation is: (and (= main_~d~0 main_~p~0) (= main_~d~0 1) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)) [2022-04-28 04:27:25,661 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (= main_~q~0 0)) (.cse1 (= main_~B~0 1)) (.cse2 (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))) (or (and .cse0 .cse1 .cse2 (= main_~B~0 main_~d~0) (= main_~p~0 1)) (let ((.cse3 (div main_~d~0 2))) (and (= (* main_~B~0 main_~p~0) main_~d~0) (<= .cse3 main_~r~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) .cse0 .cse1 (= (mod main_~p~0 2) 0) (<= 1 (div .cse3 2)) .cse2)) (and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) .cse0 .cse1 .cse2))) [2022-04-28 04:27:25,661 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 04:27:25,661 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 04:27:25,661 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 04:27:25,661 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 04:27:25,661 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 04:27:25,661 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 04:27:25,661 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 04:27:25,662 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 04:27:25,662 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 04:27:25,662 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-28 04:27:25,662 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 04:27:25,662 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 04:27:25,662 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 04:27:25,664 INFO L356 BasicCegarLoop]: Path program histogram: [10, 6, 2, 2, 2, 2, 2, 2] [2022-04-28 04:27:25,665 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 04:27:25,668 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 04:27:25,669 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 04:27:25,670 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 04:27:25,670 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 04:27:25,670 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 04:27:25,675 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-28 04:27:25,699 INFO L163 areAnnotationChecker]: CFG has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 04:27:25,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 04:27:25 BoogieIcfgContainer [2022-04-28 04:27:25,715 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 04:27:25,715 INFO L158 Benchmark]: Toolchain (without parser) took 377604.64ms. Allocated memory was 208.7MB in the beginning and 257.9MB in the end (delta: 49.3MB). Free memory was 159.1MB in the beginning and 198.9MB in the end (delta: -39.8MB). Peak memory consumption was 131.1MB. Max. memory is 8.0GB. [2022-04-28 04:27:25,716 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 208.7MB. Free memory was 175.5MB in the beginning and 175.4MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:27:25,716 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.74ms. Allocated memory is still 208.7MB. Free memory was 158.9MB in the beginning and 183.4MB in the end (delta: -24.5MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-04-28 04:27:25,716 INFO L158 Benchmark]: Boogie Preprocessor took 23.00ms. Allocated memory is still 208.7MB. Free memory was 183.4MB in the beginning and 181.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 04:27:25,716 INFO L158 Benchmark]: RCFGBuilder took 238.30ms. Allocated memory is still 208.7MB. Free memory was 181.8MB in the beginning and 170.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 04:27:25,717 INFO L158 Benchmark]: TraceAbstraction took 377134.90ms. Allocated memory was 208.7MB in the beginning and 257.9MB in the end (delta: 49.3MB). Free memory was 169.8MB in the beginning and 198.9MB in the end (delta: -29.1MB). Peak memory consumption was 142.2MB. Max. memory is 8.0GB. [2022-04-28 04:27:25,717 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 208.7MB. Free memory was 175.5MB in the beginning and 175.4MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.74ms. Allocated memory is still 208.7MB. Free memory was 158.9MB in the beginning and 183.4MB in the end (delta: -24.5MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.00ms. Allocated memory is still 208.7MB. Free memory was 183.4MB in the beginning and 181.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 238.30ms. Allocated memory is still 208.7MB. Free memory was 181.8MB in the beginning and 170.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 377134.90ms. Allocated memory was 208.7MB in the beginning and 257.9MB in the end (delta: 49.3MB). Free memory was 169.8MB in the beginning and 198.9MB in the end (delta: -29.1MB). Peak memory consumption was 142.2MB. 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 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 377.0s, OverallIterations: 14, TraceHistogramMax: 16, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 43.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 271 SdHoareTripleChecker+Valid, 23.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 219 mSDsluCounter, 1578 SdHoareTripleChecker+Invalid, 23.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 135 IncrementalHoareTripleChecker+Unchecked, 1114 mSDsCounter, 215 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2330 IncrementalHoareTripleChecker+Invalid, 2690 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 215 mSolverCounterUnsat, 464 mSDtfsCounter, 2330 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1316 GetRequests, 1146 SyntacticMatches, 18 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 50.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=13, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 37 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 563 PreInvPairs, 795 NumberOfFragments, 582 HoareAnnotationTreeSize, 563 FomulaSimplifications, 1034 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 29 FomulaSimplificationsInter, 3734 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((q == 0 && B == 1) && B * q + r == A) && B == d) && p == 1) || (((((((B * p == d && d / 2 <= r) && -p / -2 % 2 == 0) && q == 0) && B == 1) && p % 2 == 0) && 1 <= d / 2 / 2) && B * q + r == A)) || ((((B * 2 == d && p == 2) && q == 0) && B == 1) && B * q + r == A) - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-28 04:27:25,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...