/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:47:14,811 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:47:14,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:47:14,863 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:47:14,864 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:47:14,865 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:47:14,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:47:14,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:47:14,869 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:47:14,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:47:14,870 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:47:14,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:47:14,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:47:14,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:47:14,873 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:47:14,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:47:14,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:47:14,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:47:14,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:47:14,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:47:14,879 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:47:14,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:47:14,884 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:47:14,885 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:47:14,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:47:14,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:47:14,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:47:14,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:47:14,889 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:47:14,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:47:14,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:47:14,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:47:14,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:47:14,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:47:14,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:47:14,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:47:14,893 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:47:14,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:47:14,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:47:14,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:47:14,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:47:14,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:47:14,900 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 13:47:14,917 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:47:14,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:47:14,917 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:47:14,917 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:47:14,918 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:47:14,918 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:47:14,918 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:47:14,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:47:14,919 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:47:14,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:47:14,919 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:47:14,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:47:14,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:47:14,920 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:47:14,920 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:47:14,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:47:14,920 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:47:14,920 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:47:14,920 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:47:14,920 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:47:14,921 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:47:14,921 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:47:14,921 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:47:14,921 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:47:14,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:47:14,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:47:14,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:47:14,922 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:47:14,922 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:47:14,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:47:14,922 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:47:14,922 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:47:14,922 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:47:14,923 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 13:47:15,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:47:15,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:47:15,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:47:15,148 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:47:15,151 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:47:15,152 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound5.c [2022-04-27 13:47:15,203 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43a47b3a/7c5a9ac937e3495c9ddcde47296b3660/FLAG29d2e52d5 [2022-04-27 13:47:15,567 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:47:15,568 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound5.c [2022-04-27 13:47:15,574 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43a47b3a/7c5a9ac937e3495c9ddcde47296b3660/FLAG29d2e52d5 [2022-04-27 13:47:15,960 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43a47b3a/7c5a9ac937e3495c9ddcde47296b3660 [2022-04-27 13:47:15,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:47:15,964 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:47:15,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:47:15,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:47:15,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:47:15,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:47:15" (1/1) ... [2022-04-27 13:47:15,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb3f7a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:47:15, skipping insertion in model container [2022-04-27 13:47:15,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:47:15" (1/1) ... [2022-04-27 13:47:15,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:47:15,994 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:47:16,119 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound5.c[526,539] [2022-04-27 13:47:16,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:47:16,150 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:47:16,160 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound5.c[526,539] [2022-04-27 13:47:16,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:47:16,177 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:47:16,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:47:16 WrapperNode [2022-04-27 13:47:16,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:47:16,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:47:16,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:47:16,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:47:16,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:47:16" (1/1) ... [2022-04-27 13:47:16,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:47:16" (1/1) ... [2022-04-27 13:47:16,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:47:16" (1/1) ... [2022-04-27 13:47:16,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:47:16" (1/1) ... [2022-04-27 13:47:16,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:47:16" (1/1) ... [2022-04-27 13:47:16,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:47:16" (1/1) ... [2022-04-27 13:47:16,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:47:16" (1/1) ... [2022-04-27 13:47:16,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:47:16,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:47:16,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:47:16,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:47:16,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:47:16" (1/1) ... [2022-04-27 13:47:16,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:47:16,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:47:16,228 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 13:47:16,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 13:47:16,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:47:16,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:47:16,268 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:47:16,269 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:47:16,270 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:47:16,271 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:47:16,271 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:47:16,271 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:47:16,272 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:47:16,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:47:16,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:47:16,272 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:47:16,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:47:16,275 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:47:16,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:47:16,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:47:16,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:47:16,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:47:16,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:47:16,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:47:16,323 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:47:16,324 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:47:16,513 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:47:16,519 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:47:16,519 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 13:47:16,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:47:16 BoogieIcfgContainer [2022-04-27 13:47:16,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:47:16,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:47:16,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:47:16,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:47:16,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:47:15" (1/3) ... [2022-04-27 13:47:16,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d4e093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:47:16, skipping insertion in model container [2022-04-27 13:47:16,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:47:16" (2/3) ... [2022-04-27 13:47:16,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d4e093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:47:16, skipping insertion in model container [2022-04-27 13:47:16,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:47:16" (3/3) ... [2022-04-27 13:47:16,528 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound5.c [2022-04-27 13:47:16,539 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:47:16,540 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:47:16,578 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:47:16,584 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2424b027, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@9cefe20 [2022-04-27 13:47:16,584 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:47:16,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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-27 13:47:16,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 13:47:16,597 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:47:16,597 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:47:16,598 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:47:16,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:47:16,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 1 times [2022-04-27 13:47:16,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:47:16,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420831193] [2022-04-27 13:47:16,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:16,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:47:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:16,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:47:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:16,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-27 13:47:16,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 13:47:16,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-27 13:47:16,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:47:16,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-27 13:47:16,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 13:47:16,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-27 13:47:16,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret7 := main(); {34#true} is VALID [2022-04-27 13:47:16,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#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; {34#true} is VALID [2022-04-27 13:47:16,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-27 13:47:16,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#false} assume !true; {35#false} is VALID [2022-04-27 13:47:16,741 INFO L272 TraceCheckUtils]: 8: Hoare triple {35#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35#false} is VALID [2022-04-27 13:47:16,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-27 13:47:16,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-27 13:47:16,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-27 13:47:16,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:47:16,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:47:16,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420831193] [2022-04-27 13:47:16,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420831193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:47:16,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:47:16,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:47:16,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189765673] [2022-04-27 13:47:16,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:47:16,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-27 13:47:16,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:47:16,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-27 13:47:16,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:16,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:47:16,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:47:16,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:47:16,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:47:16,789 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-27 13:47:16,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:16,941 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2022-04-27 13:47:16,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:47:16,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-27 13:47:16,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:47:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-27 13:47:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-27 13:47:16,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-27 13:47:16,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-27 13:47:16,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-04-27 13:47:17,052 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-27 13:47:17,060 INFO L225 Difference]: With dead ends: 57 [2022-04-27 13:47:17,060 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 13:47:17,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:47:17,066 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:47:17,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:47:17,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 13:47:17,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-27 13:47:17,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:47:17,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:47:17,093 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:47:17,094 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:47:17,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:17,098 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-27 13:47:17,098 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-27 13:47:17,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:17,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:17,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-27 13:47:17,099 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-27 13:47:17,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:17,102 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-27 13:47:17,102 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-27 13:47:17,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:17,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:17,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:47:17,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:47:17,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:47:17,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-04-27 13:47:17,107 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 12 [2022-04-27 13:47:17,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:47:17,107 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-04-27 13:47:17,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-27 13:47:17,108 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-04-27 13:47:17,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 13:47:17,113 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:47:17,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:47:17,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:47:17,114 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:47:17,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:47:17,115 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 1 times [2022-04-27 13:47:17,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:47:17,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729714906] [2022-04-27 13:47:17,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:17,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:47:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:17,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:47:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:17,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {223#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {215#true} is VALID [2022-04-27 13:47:17,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#true} assume true; {215#true} is VALID [2022-04-27 13:47:17,241 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {215#true} {215#true} #92#return; {215#true} is VALID [2022-04-27 13:47:17,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {215#true} call ULTIMATE.init(); {223#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:47:17,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {223#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {215#true} is VALID [2022-04-27 13:47:17,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2022-04-27 13:47:17,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #92#return; {215#true} is VALID [2022-04-27 13:47:17,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret7 := main(); {215#true} is VALID [2022-04-27 13:47:17,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {215#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; {220#(= main_~q~0 0)} is VALID [2022-04-27 13:47:17,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {220#(= main_~q~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {220#(= main_~q~0 0)} is VALID [2022-04-27 13:47:17,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {220#(= main_~q~0 0)} assume !!(#t~post5 < 5);havoc #t~post5; {220#(= main_~q~0 0)} is VALID [2022-04-27 13:47:17,245 INFO L272 TraceCheckUtils]: 8: Hoare triple {220#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {221#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:47:17,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {221#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {222#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:47:17,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {222#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {216#false} is VALID [2022-04-27 13:47:17,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {216#false} assume !false; {216#false} is VALID [2022-04-27 13:47:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:47:17,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:47:17,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729714906] [2022-04-27 13:47:17,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729714906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:47:17,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:47:17,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:47:17,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658616904] [2022-04-27 13:47:17,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:47:17,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-27 13:47:17,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:47:17,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-27 13:47:17,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:17,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:47:17,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:47:17,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:47:17,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:47:17,281 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-27 13:47:17,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:17,563 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-04-27 13:47:17,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:47:17,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-27 13:47:17,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:47:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-27 13:47:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-27 13:47:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-27 13:47:17,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-27 13:47:17,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-27 13:47:17,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:17,623 INFO L225 Difference]: With dead ends: 41 [2022-04-27 13:47:17,623 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 13:47:17,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:47:17,625 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:47:17,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:47:17,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 13:47:17,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-04-27 13:47:17,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:47:17,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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-27 13:47:17,632 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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-27 13:47:17,632 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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-27 13:47:17,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:17,635 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-27 13:47:17,636 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-27 13:47:17,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:17,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:17,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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 39 states. [2022-04-27 13:47:17,637 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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 39 states. [2022-04-27 13:47:17,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:17,640 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-27 13:47:17,640 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-27 13:47:17,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:17,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:17,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:47:17,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:47:17,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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-27 13:47:17,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-27 13:47:17,644 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-04-27 13:47:17,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:47:17,644 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-27 13:47:17,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-27 13:47:17,645 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-27 13:47:17,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 13:47:17,645 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:47:17,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:47:17,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 13:47:17,646 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:47:17,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:47:17,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 1 times [2022-04-27 13:47:17,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:47:17,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384697785] [2022-04-27 13:47:17,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:17,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:47:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:17,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:47:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:17,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {423#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:17,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {421#(<= ~counter~0 0)} assume true; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:17,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {421#(<= ~counter~0 0)} {416#true} #92#return; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:17,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {416#true} call ULTIMATE.init(); {423#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:47:17,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:17,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {421#(<= ~counter~0 0)} assume true; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:17,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {421#(<= ~counter~0 0)} {416#true} #92#return; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:17,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {421#(<= ~counter~0 0)} call #t~ret7 := main(); {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:17,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {421#(<= ~counter~0 0)} 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; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:17,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {421#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {422#(<= |main_#t~post5| 0)} is VALID [2022-04-27 13:47:17,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {422#(<= |main_#t~post5| 0)} assume !(#t~post5 < 5);havoc #t~post5; {417#false} is VALID [2022-04-27 13:47:17,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {417#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {417#false} is VALID [2022-04-27 13:47:17,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#false} assume !(#t~post6 < 5);havoc #t~post6; {417#false} is VALID [2022-04-27 13:47:17,725 INFO L272 TraceCheckUtils]: 10: Hoare triple {417#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {417#false} is VALID [2022-04-27 13:47:17,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {417#false} ~cond := #in~cond; {417#false} is VALID [2022-04-27 13:47:17,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {417#false} assume 0 == ~cond; {417#false} is VALID [2022-04-27 13:47:17,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {417#false} assume !false; {417#false} is VALID [2022-04-27 13:47:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:47:17,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:47:17,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384697785] [2022-04-27 13:47:17,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384697785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:47:17,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:47:17,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:47:17,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117765041] [2022-04-27 13:47:17,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:47:17,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 13:47:17,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:47:17,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 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-27 13:47:17,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:17,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:47:17,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:47:17,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:47:17,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:47:17,741 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 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-27 13:47:17,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:17,897 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-04-27 13:47:17,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:47:17,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 13:47:17,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:47:17,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 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-27 13:47:17,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-27 13:47:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 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-27 13:47:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-27 13:47:17,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-04-27 13:47:17,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:17,953 INFO L225 Difference]: With dead ends: 46 [2022-04-27 13:47:17,953 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 13:47:17,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:47:17,955 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:47:17,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:47:17,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 13:47:17,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 13:47:17,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:47:17,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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-27 13:47:17,962 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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-27 13:47:17,963 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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-27 13:47:17,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:17,965 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 13:47:17,965 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:47:17,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:17,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:17,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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 32 states. [2022-04-27 13:47:17,966 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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 32 states. [2022-04-27 13:47:17,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:17,968 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 13:47:17,969 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:47:17,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:17,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:17,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:47:17,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:47:17,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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-27 13:47:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-27 13:47:17,972 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 14 [2022-04-27 13:47:17,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:47:17,972 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-27 13:47:17,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 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-27 13:47:17,972 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:47:17,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 13:47:17,973 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:47:17,973 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:47:17,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 13:47:17,973 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:47:17,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:47:17,974 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 1 times [2022-04-27 13:47:17,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:47:17,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714926671] [2022-04-27 13:47:17,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:17,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:47:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:18,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:47:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:18,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {617#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {605#true} is VALID [2022-04-27 13:47:18,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:47:18,039 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {605#true} {605#true} #92#return; {605#true} is VALID [2022-04-27 13:47:18,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-27 13:47:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:18,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {605#true} ~cond := #in~cond; {605#true} is VALID [2022-04-27 13:47:18,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#true} assume !(0 == ~cond); {605#true} is VALID [2022-04-27 13:47:18,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:47:18,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {605#true} {610#(= main_~A~0 main_~r~0)} #78#return; {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:47:18,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {605#true} call ULTIMATE.init(); {617#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:47:18,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {617#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {605#true} is VALID [2022-04-27 13:47:18,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:47:18,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {605#true} {605#true} #92#return; {605#true} is VALID [2022-04-27 13:47:18,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {605#true} call #t~ret7 := main(); {605#true} is VALID [2022-04-27 13:47:18,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {605#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; {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:47:18,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {610#(= main_~A~0 main_~r~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:47:18,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {610#(= main_~A~0 main_~r~0)} assume !!(#t~post5 < 5);havoc #t~post5; {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:47:18,049 INFO L272 TraceCheckUtils]: 8: Hoare triple {610#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {605#true} is VALID [2022-04-27 13:47:18,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {605#true} ~cond := #in~cond; {605#true} is VALID [2022-04-27 13:47:18,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {605#true} assume !(0 == ~cond); {605#true} is VALID [2022-04-27 13:47:18,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:47:18,050 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {605#true} {610#(= main_~A~0 main_~r~0)} #78#return; {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:47:18,051 INFO L272 TraceCheckUtils]: 13: Hoare triple {610#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {615#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:47:18,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {615#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {616#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:47:18,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {616#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {606#false} is VALID [2022-04-27 13:47:18,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {606#false} assume !false; {606#false} is VALID [2022-04-27 13:47:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:47:18,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:47:18,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714926671] [2022-04-27 13:47:18,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714926671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:47:18,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:47:18,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:47:18,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762341337] [2022-04-27 13:47:18,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:47:18,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-27 13:47:18,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:47:18,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:47:18,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:18,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:47:18,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:47:18,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:47:18,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:47:18,069 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:47:18,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:18,343 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-27 13:47:18,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:47:18,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-27 13:47:18,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:47:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:47:18,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-27 13:47:18,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:47:18,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-27 13:47:18,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-27 13:47:18,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:18,403 INFO L225 Difference]: With dead ends: 46 [2022-04-27 13:47:18,404 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 13:47:18,404 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-27 13:47:18,414 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:47:18,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 78 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:47:18,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 13:47:18,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-04-27 13:47:18,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:47:18,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 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-27 13:47:18,430 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 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-27 13:47:18,431 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 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-27 13:47:18,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:18,433 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-27 13:47:18,433 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-27 13:47:18,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:18,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:18,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 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 44 states. [2022-04-27 13:47:18,435 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 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 44 states. [2022-04-27 13:47:18,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:18,437 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-27 13:47:18,437 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-27 13:47:18,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:18,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:18,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:47:18,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:47:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 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-27 13:47:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-04-27 13:47:18,447 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2022-04-27 13:47:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:47:18,447 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-04-27 13:47:18,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:47:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-27 13:47:18,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 13:47:18,448 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:47:18,448 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:47:18,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 13:47:18,448 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:47:18,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:47:18,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 1 times [2022-04-27 13:47:18,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:47:18,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640296728] [2022-04-27 13:47:18,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:18,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:47:18,492 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:47:18,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1483328267] [2022-04-27 13:47:18,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:18,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:47:18,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:47:18,495 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:47:18,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 13:47:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:18,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:47:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:18,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:47:18,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {834#true} call ULTIMATE.init(); {834#true} is VALID [2022-04-27 13:47:18,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {834#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);~counter~0 := 0; {834#true} is VALID [2022-04-27 13:47:18,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-27 13:47:18,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {834#true} {834#true} #92#return; {834#true} is VALID [2022-04-27 13:47:18,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {834#true} call #t~ret7 := main(); {834#true} is VALID [2022-04-27 13:47:18,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {834#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; {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:47:18,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:47:18,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:47:18,888 INFO L272 TraceCheckUtils]: 8: Hoare triple {854#(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)); {834#true} is VALID [2022-04-27 13:47:18,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {834#true} ~cond := #in~cond; {834#true} is VALID [2022-04-27 13:47:18,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {834#true} assume !(0 == ~cond); {834#true} is VALID [2022-04-27 13:47:18,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-27 13:47:18,900 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {834#true} {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:47:18,900 INFO L272 TraceCheckUtils]: 13: Hoare triple {854#(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)); {834#true} is VALID [2022-04-27 13:47:18,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {834#true} ~cond := #in~cond; {834#true} is VALID [2022-04-27 13:47:18,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {834#true} assume !(0 == ~cond); {834#true} is VALID [2022-04-27 13:47:18,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-27 13:47:18,901 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {834#true} {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:47:18,902 INFO L272 TraceCheckUtils]: 18: Hoare triple {854#(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)); {894#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:47:18,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {894#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {898#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:47:18,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {898#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {835#false} is VALID [2022-04-27 13:47:18,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {835#false} assume !false; {835#false} is VALID [2022-04-27 13:47:18,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:47:18,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:47:18,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:47:18,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640296728] [2022-04-27 13:47:18,904 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:47:18,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483328267] [2022-04-27 13:47:18,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483328267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:47:18,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:47:18,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:47:18,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932297557] [2022-04-27 13:47:18,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:47:18,906 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, (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 22 [2022-04-27 13:47:18,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:47:18,906 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, (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-27 13:47:18,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:18,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:47:18,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:47:18,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:47:18,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:47:18,923 INFO L87 Difference]: Start difference. First operand 36 states and 44 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, (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-27 13:47:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:19,117 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-27 13:47:19,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:47:19,118 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, (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 22 [2022-04-27 13:47:19,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:47:19,118 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, (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-27 13:47:19,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-27 13:47:19,120 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, (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-27 13:47:19,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-27 13:47:19,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2022-04-27 13:47:19,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:19,203 INFO L225 Difference]: With dead ends: 65 [2022-04-27 13:47:19,203 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 13:47:19,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:47:19,207 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 121 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.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:47:19,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:47:19,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 13:47:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-27 13:47:19,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:47:19,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 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-27 13:47:19,224 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 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-27 13:47:19,225 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 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-27 13:47:19,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:19,228 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:47:19,228 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:47:19,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:19,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:19,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 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 50 states. [2022-04-27 13:47:19,230 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 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 50 states. [2022-04-27 13:47:19,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:19,234 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:47:19,235 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:47:19,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:19,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:19,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:47:19,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:47:19,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 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-27 13:47:19,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-27 13:47:19,241 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 22 [2022-04-27 13:47:19,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:47:19,244 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-27 13:47:19,244 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, (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-27 13:47:19,246 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:47:19,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 13:47:19,247 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:47:19,247 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:47:19,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 13:47:19,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:47:19,471 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:47:19,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:47:19,471 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 1 times [2022-04-27 13:47:19,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:47:19,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584506270] [2022-04-27 13:47:19,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:19,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:47:19,483 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:47:19,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [682604903] [2022-04-27 13:47:19,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:19,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:47:19,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:47:19,484 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:47:19,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 13:47:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:19,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:47:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:19,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:47:19,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} call ULTIMATE.init(); {1173#true} is VALID [2022-04-27 13:47:19,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#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);~counter~0 := 0; {1181#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:19,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {1181#(<= ~counter~0 0)} assume true; {1181#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:19,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1181#(<= ~counter~0 0)} {1173#true} #92#return; {1181#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:19,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {1181#(<= ~counter~0 0)} call #t~ret7 := main(); {1181#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:19,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {1181#(<= ~counter~0 0)} 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; {1181#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:19,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {1181#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:19,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {1197#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:19,715 INFO L272 TraceCheckUtils]: 8: Hoare triple {1197#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:19,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {1197#(<= ~counter~0 1)} ~cond := #in~cond; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:19,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {1197#(<= ~counter~0 1)} assume !(0 == ~cond); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:19,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {1197#(<= ~counter~0 1)} assume true; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:19,719 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1197#(<= ~counter~0 1)} {1197#(<= ~counter~0 1)} #78#return; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:19,719 INFO L272 TraceCheckUtils]: 13: Hoare triple {1197#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:19,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {1197#(<= ~counter~0 1)} ~cond := #in~cond; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:19,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {1197#(<= ~counter~0 1)} assume !(0 == ~cond); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:19,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {1197#(<= ~counter~0 1)} assume true; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:19,721 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1197#(<= ~counter~0 1)} {1197#(<= ~counter~0 1)} #80#return; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:19,721 INFO L272 TraceCheckUtils]: 18: Hoare triple {1197#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:19,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {1197#(<= ~counter~0 1)} ~cond := #in~cond; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:19,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {1197#(<= ~counter~0 1)} assume !(0 == ~cond); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:19,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {1197#(<= ~counter~0 1)} assume true; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:19,723 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1197#(<= ~counter~0 1)} {1197#(<= ~counter~0 1)} #82#return; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:19,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {1197#(<= ~counter~0 1)} assume !(~r~0 >= ~d~0); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:19,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {1197#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1252#(<= |main_#t~post6| 1)} is VALID [2022-04-27 13:47:19,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {1252#(<= |main_#t~post6| 1)} assume !(#t~post6 < 5);havoc #t~post6; {1174#false} is VALID [2022-04-27 13:47:19,726 INFO L272 TraceCheckUtils]: 26: Hoare triple {1174#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {1174#false} is VALID [2022-04-27 13:47:19,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {1174#false} ~cond := #in~cond; {1174#false} is VALID [2022-04-27 13:47:19,728 INFO L290 TraceCheckUtils]: 28: Hoare triple {1174#false} assume 0 == ~cond; {1174#false} is VALID [2022-04-27 13:47:19,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-27 13:47:19,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:47:19,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:47:19,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:47:19,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584506270] [2022-04-27 13:47:19,741 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:47:19,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682604903] [2022-04-27 13:47:19,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682604903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:47:19,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:47:19,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:47:19,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481843188] [2022-04-27 13:47:19,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:47:19,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-27 13:47:19,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:47:19,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:47:19,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:19,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:47:19,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:47:19,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:47:19,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:47:19,761 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:47:19,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:19,853 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-04-27 13:47:19,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:47:19,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-27 13:47:19,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:47:19,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:47:19,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:47:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:47:19,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:47:19,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-27 13:47:19,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:19,907 INFO L225 Difference]: With dead ends: 70 [2022-04-27 13:47:19,907 INFO L226 Difference]: Without dead ends: 63 [2022-04-27 13:47:19,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:47:19,909 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:47:19,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:47:19,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-27 13:47:19,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-27 13:47:19,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:47:19,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:47:19,930 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:47:19,930 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:47:19,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:19,933 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-27 13:47:19,933 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-27 13:47:19,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:19,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:19,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-27 13:47:19,935 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-27 13:47:19,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:19,937 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-27 13:47:19,937 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-27 13:47:19,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:19,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:19,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:47:19,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:47:19,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:47:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-04-27 13:47:19,941 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 30 [2022-04-27 13:47:19,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:47:19,941 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-04-27 13:47:19,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:47:19,942 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-04-27 13:47:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 13:47:19,942 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:47:19,942 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:47:19,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 13:47:20,165 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,SelfDestructingSolverStorable5 [2022-04-27 13:47:20,165 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:47:20,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:47:20,166 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 1 times [2022-04-27 13:47:20,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:47:20,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129731980] [2022-04-27 13:47:20,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:20,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:47:20,178 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:47:20,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [716304385] [2022-04-27 13:47:20,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:20,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:47:20,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:47:20,180 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:47:20,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 13:47:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:20,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:47:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:20,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:47:21,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {1580#true} call ULTIMATE.init(); {1580#true} is VALID [2022-04-27 13:47:21,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {1580#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);~counter~0 := 0; {1580#true} is VALID [2022-04-27 13:47:21,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-27 13:47:21,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1580#true} {1580#true} #92#return; {1580#true} is VALID [2022-04-27 13:47:21,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {1580#true} call #t~ret7 := main(); {1580#true} is VALID [2022-04-27 13:47:21,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {1580#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; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:47:21,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:47:21,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:47:21,279 INFO L272 TraceCheckUtils]: 8: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1580#true} is VALID [2022-04-27 13:47:21,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {1580#true} ~cond := #in~cond; {1580#true} is VALID [2022-04-27 13:47:21,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {1580#true} assume !(0 == ~cond); {1580#true} is VALID [2022-04-27 13:47:21,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-27 13:47:21,280 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1580#true} {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #78#return; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:47:21,280 INFO L272 TraceCheckUtils]: 13: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1580#true} is VALID [2022-04-27 13:47:21,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {1580#true} ~cond := #in~cond; {1580#true} is VALID [2022-04-27 13:47:21,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {1580#true} assume !(0 == ~cond); {1580#true} is VALID [2022-04-27 13:47:21,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-27 13:47:21,281 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1580#true} {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #80#return; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:47:21,281 INFO L272 TraceCheckUtils]: 18: Hoare triple {1600#(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)); {1580#true} is VALID [2022-04-27 13:47:21,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {1580#true} ~cond := #in~cond; {1580#true} is VALID [2022-04-27 13:47:21,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {1580#true} assume !(0 == ~cond); {1580#true} is VALID [2022-04-27 13:47:21,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-27 13:47:21,282 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1580#true} {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #82#return; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:47:21,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:47:21,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:47:21,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:47:21,284 INFO L272 TraceCheckUtils]: 26: Hoare triple {1600#(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)); {1664#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:47:21,285 INFO L290 TraceCheckUtils]: 27: Hoare triple {1664#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1668#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:47:21,285 INFO L290 TraceCheckUtils]: 28: Hoare triple {1668#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1581#false} is VALID [2022-04-27 13:47:21,285 INFO L290 TraceCheckUtils]: 29: Hoare triple {1581#false} assume !false; {1581#false} is VALID [2022-04-27 13:47:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:47:21,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:47:21,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:47:21,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129731980] [2022-04-27 13:47:21,286 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:47:21,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716304385] [2022-04-27 13:47:21,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716304385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:47:21,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:47:21,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:47:21,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139379964] [2022-04-27 13:47:21,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:47:21,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-27 13:47:21,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:47:21,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:47:21,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:21,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:47:21,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:47:21,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:47:21,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:47:21,306 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:47:21,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:21,514 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-27 13:47:21,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:47:21,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-27 13:47:21,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:47:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:47:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-27 13:47:21,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:47:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-27 13:47:21,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-27 13:47:21,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:21,568 INFO L225 Difference]: With dead ends: 76 [2022-04-27 13:47:21,568 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 13:47:21,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:47:21,569 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 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.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:47:21,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:47:21,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 13:47:21,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-27 13:47:21,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:47:21,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:47:21,594 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:47:21,595 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:47:21,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:21,597 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-27 13:47:21,597 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-27 13:47:21,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:21,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:21,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-27 13:47:21,598 INFO L87 Difference]: Start difference. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-27 13:47:21,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:21,600 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-27 13:47:21,600 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-27 13:47:21,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:21,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:21,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:47:21,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:47:21,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:47:21,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-04-27 13:47:21,603 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 30 [2022-04-27 13:47:21,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:47:21,603 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-04-27 13:47:21,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:47:21,604 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-27 13:47:21,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 13:47:21,604 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:47:21,604 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:47:21,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 13:47:21,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:47:21,828 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:47:21,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:47:21,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 1 times [2022-04-27 13:47:21,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:47:21,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830610391] [2022-04-27 13:47:21,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:21,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:47:21,842 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:47:21,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [620648102] [2022-04-27 13:47:21,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:21,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:47:21,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:47:21,844 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:47:21,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 13:47:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:21,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:47:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:21,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:47:22,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {2000#true} call ULTIMATE.init(); {2000#true} is VALID [2022-04-27 13:47:22,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {2000#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);~counter~0 := 0; {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:22,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {2008#(<= ~counter~0 0)} assume true; {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:22,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2008#(<= ~counter~0 0)} {2000#true} #92#return; {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:22,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {2008#(<= ~counter~0 0)} call #t~ret7 := main(); {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:22,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {2008#(<= ~counter~0 0)} 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; {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:22,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {2008#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:22,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {2024#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:22,085 INFO L272 TraceCheckUtils]: 8: Hoare triple {2024#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:22,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {2024#(<= ~counter~0 1)} ~cond := #in~cond; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:22,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {2024#(<= ~counter~0 1)} assume !(0 == ~cond); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:22,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {2024#(<= ~counter~0 1)} assume true; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:22,086 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2024#(<= ~counter~0 1)} {2024#(<= ~counter~0 1)} #78#return; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:22,087 INFO L272 TraceCheckUtils]: 13: Hoare triple {2024#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:22,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {2024#(<= ~counter~0 1)} ~cond := #in~cond; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:22,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {2024#(<= ~counter~0 1)} assume !(0 == ~cond); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:22,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {2024#(<= ~counter~0 1)} assume true; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:22,088 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2024#(<= ~counter~0 1)} {2024#(<= ~counter~0 1)} #80#return; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:22,089 INFO L272 TraceCheckUtils]: 18: Hoare triple {2024#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:22,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {2024#(<= ~counter~0 1)} ~cond := #in~cond; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:22,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {2024#(<= ~counter~0 1)} assume !(0 == ~cond); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:22,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {2024#(<= ~counter~0 1)} assume true; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:22,091 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2024#(<= ~counter~0 1)} {2024#(<= ~counter~0 1)} #82#return; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:22,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {2024#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:22,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {2024#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2079#(<= |main_#t~post5| 1)} is VALID [2022-04-27 13:47:22,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {2079#(<= |main_#t~post5| 1)} assume !(#t~post5 < 5);havoc #t~post5; {2001#false} is VALID [2022-04-27 13:47:22,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {2001#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2001#false} is VALID [2022-04-27 13:47:22,092 INFO L290 TraceCheckUtils]: 27: Hoare triple {2001#false} assume !(#t~post6 < 5);havoc #t~post6; {2001#false} is VALID [2022-04-27 13:47:22,092 INFO L272 TraceCheckUtils]: 28: Hoare triple {2001#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2001#false} is VALID [2022-04-27 13:47:22,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {2001#false} ~cond := #in~cond; {2001#false} is VALID [2022-04-27 13:47:22,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {2001#false} assume !(0 == ~cond); {2001#false} is VALID [2022-04-27 13:47:22,093 INFO L290 TraceCheckUtils]: 31: Hoare triple {2001#false} assume true; {2001#false} is VALID [2022-04-27 13:47:22,093 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2001#false} {2001#false} #88#return; {2001#false} is VALID [2022-04-27 13:47:22,093 INFO L272 TraceCheckUtils]: 33: Hoare triple {2001#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {2001#false} is VALID [2022-04-27 13:47:22,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {2001#false} ~cond := #in~cond; {2001#false} is VALID [2022-04-27 13:47:22,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {2001#false} assume 0 == ~cond; {2001#false} is VALID [2022-04-27 13:47:22,093 INFO L290 TraceCheckUtils]: 36: Hoare triple {2001#false} assume !false; {2001#false} is VALID [2022-04-27 13:47:22,093 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 13:47:22,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:47:22,301 INFO L290 TraceCheckUtils]: 36: Hoare triple {2001#false} assume !false; {2001#false} is VALID [2022-04-27 13:47:22,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {2001#false} assume 0 == ~cond; {2001#false} is VALID [2022-04-27 13:47:22,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {2001#false} ~cond := #in~cond; {2001#false} is VALID [2022-04-27 13:47:22,301 INFO L272 TraceCheckUtils]: 33: Hoare triple {2001#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {2001#false} is VALID [2022-04-27 13:47:22,301 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2000#true} {2001#false} #88#return; {2001#false} is VALID [2022-04-27 13:47:22,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-27 13:47:22,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-27 13:47:22,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-27 13:47:22,306 INFO L272 TraceCheckUtils]: 28: Hoare triple {2001#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2000#true} is VALID [2022-04-27 13:47:22,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {2001#false} assume !(#t~post6 < 5);havoc #t~post6; {2001#false} is VALID [2022-04-27 13:47:22,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {2001#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2001#false} is VALID [2022-04-27 13:47:22,307 INFO L290 TraceCheckUtils]: 25: Hoare triple {2149#(< |main_#t~post5| 5)} assume !(#t~post5 < 5);havoc #t~post5; {2001#false} is VALID [2022-04-27 13:47:22,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {2153#(< ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2149#(< |main_#t~post5| 5)} is VALID [2022-04-27 13:47:22,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {2153#(< ~counter~0 5)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2153#(< ~counter~0 5)} is VALID [2022-04-27 13:47:22,308 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2000#true} {2153#(< ~counter~0 5)} #82#return; {2153#(< ~counter~0 5)} is VALID [2022-04-27 13:47:22,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-27 13:47:22,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-27 13:47:22,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-27 13:47:22,309 INFO L272 TraceCheckUtils]: 18: Hoare triple {2153#(< ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2000#true} is VALID [2022-04-27 13:47:22,309 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2000#true} {2153#(< ~counter~0 5)} #80#return; {2153#(< ~counter~0 5)} is VALID [2022-04-27 13:47:22,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-27 13:47:22,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-27 13:47:22,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-27 13:47:22,310 INFO L272 TraceCheckUtils]: 13: Hoare triple {2153#(< ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2000#true} is VALID [2022-04-27 13:47:22,310 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2000#true} {2153#(< ~counter~0 5)} #78#return; {2153#(< ~counter~0 5)} is VALID [2022-04-27 13:47:22,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-27 13:47:22,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-27 13:47:22,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-27 13:47:22,311 INFO L272 TraceCheckUtils]: 8: Hoare triple {2153#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2000#true} is VALID [2022-04-27 13:47:22,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {2153#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {2153#(< ~counter~0 5)} is VALID [2022-04-27 13:47:22,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {2208#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2153#(< ~counter~0 5)} is VALID [2022-04-27 13:47:22,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {2208#(< ~counter~0 4)} 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; {2208#(< ~counter~0 4)} is VALID [2022-04-27 13:47:22,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {2208#(< ~counter~0 4)} call #t~ret7 := main(); {2208#(< ~counter~0 4)} is VALID [2022-04-27 13:47:22,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2208#(< ~counter~0 4)} {2000#true} #92#return; {2208#(< ~counter~0 4)} is VALID [2022-04-27 13:47:22,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {2208#(< ~counter~0 4)} assume true; {2208#(< ~counter~0 4)} is VALID [2022-04-27 13:47:22,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {2000#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);~counter~0 := 0; {2208#(< ~counter~0 4)} is VALID [2022-04-27 13:47:22,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {2000#true} call ULTIMATE.init(); {2000#true} is VALID [2022-04-27 13:47:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:47:22,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:47:22,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830610391] [2022-04-27 13:47:22,316 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:47:22,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620648102] [2022-04-27 13:47:22,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620648102] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:47:22,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:47:22,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 13:47:22,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179780497] [2022-04-27 13:47:22,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:47:22,317 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 37 [2022-04-27 13:47:22,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:47:22,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-27 13:47:22,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:22,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 13:47:22,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:47:22,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 13:47:22,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:47:22,360 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-27 13:47:22,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:22,625 INFO L93 Difference]: Finished difference Result 144 states and 177 transitions. [2022-04-27 13:47:22,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:47:22,625 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 37 [2022-04-27 13:47:22,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:47:22,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-27 13:47:22,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-27 13:47:22,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-27 13:47:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-27 13:47:22,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-27 13:47:22,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:22,721 INFO L225 Difference]: With dead ends: 144 [2022-04-27 13:47:22,721 INFO L226 Difference]: Without dead ends: 119 [2022-04-27 13:47:22,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:47:22,722 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 41 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:47:22,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 149 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:47:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-27 13:47:22,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2022-04-27 13:47:22,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:47:22,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 112 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 13:47:22,750 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 112 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 13:47:22,751 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 112 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 13:47:22,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:22,755 INFO L93 Difference]: Finished difference Result 119 states and 139 transitions. [2022-04-27 13:47:22,755 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2022-04-27 13:47:22,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:22,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:22,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 119 states. [2022-04-27 13:47:22,756 INFO L87 Difference]: Start difference. First operand has 112 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 119 states. [2022-04-27 13:47:22,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:22,760 INFO L93 Difference]: Finished difference Result 119 states and 139 transitions. [2022-04-27 13:47:22,760 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2022-04-27 13:47:22,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:22,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:22,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:47:22,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:47:22,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 13:47:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2022-04-27 13:47:22,765 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 37 [2022-04-27 13:47:22,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:47:22,765 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2022-04-27 13:47:22,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-27 13:47:22,766 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-04-27 13:47:22,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 13:47:22,766 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:47:22,766 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:47:22,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 13:47:22,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:47:22,992 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:47:22,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:47:22,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1057559728, now seen corresponding path program 1 times [2022-04-27 13:47:22,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:47:22,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928135053] [2022-04-27 13:47:22,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:22,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:47:23,002 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:47:23,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [266935434] [2022-04-27 13:47:23,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:23,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:47:23,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:47:23,004 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:47:23,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 13:47:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:23,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:47:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:23,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:47:23,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {2830#true} call ULTIMATE.init(); {2830#true} is VALID [2022-04-27 13:47:23,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {2830#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);~counter~0 := 0; {2830#true} is VALID [2022-04-27 13:47:23,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:47:23,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2830#true} {2830#true} #92#return; {2830#true} is VALID [2022-04-27 13:47:23,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {2830#true} call #t~ret7 := main(); {2830#true} is VALID [2022-04-27 13:47:23,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {2830#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; {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:47:23,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:47:23,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:47:23,293 INFO L272 TraceCheckUtils]: 8: Hoare triple {2850#(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)); {2830#true} is VALID [2022-04-27 13:47:23,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:47:23,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:47:23,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:47:23,294 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2830#true} {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:47:23,294 INFO L272 TraceCheckUtils]: 13: Hoare triple {2850#(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)); {2830#true} is VALID [2022-04-27 13:47:23,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:47:23,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:47:23,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:47:23,295 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2830#true} {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:47:23,295 INFO L272 TraceCheckUtils]: 18: Hoare triple {2850#(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)); {2830#true} is VALID [2022-04-27 13:47:23,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:47:23,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:47:23,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:47:23,297 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2830#true} {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:47:23,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {2850#(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; {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 13:47:23,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 13:47:23,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 13:47:23,301 INFO L272 TraceCheckUtils]: 26: Hoare triple {2905#(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)); {2830#true} is VALID [2022-04-27 13:47:23,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:47:23,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:47:23,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:47:23,303 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2830#true} {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #78#return; {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 13:47:23,303 INFO L272 TraceCheckUtils]: 31: Hoare triple {2905#(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)); {2830#true} is VALID [2022-04-27 13:47:23,303 INFO L290 TraceCheckUtils]: 32: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:47:23,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:47:23,303 INFO L290 TraceCheckUtils]: 34: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:47:23,304 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2830#true} {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #80#return; {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 13:47:23,304 INFO L272 TraceCheckUtils]: 36: Hoare triple {2905#(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)); {2945#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:47:23,305 INFO L290 TraceCheckUtils]: 37: Hoare triple {2945#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2949#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:47:23,305 INFO L290 TraceCheckUtils]: 38: Hoare triple {2949#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2831#false} is VALID [2022-04-27 13:47:23,305 INFO L290 TraceCheckUtils]: 39: Hoare triple {2831#false} assume !false; {2831#false} is VALID [2022-04-27 13:47:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 13:47:23,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:47:23,489 INFO L290 TraceCheckUtils]: 39: Hoare triple {2831#false} assume !false; {2831#false} is VALID [2022-04-27 13:47:23,490 INFO L290 TraceCheckUtils]: 38: Hoare triple {2949#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2831#false} is VALID [2022-04-27 13:47:23,490 INFO L290 TraceCheckUtils]: 37: Hoare triple {2945#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2949#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:47:23,491 INFO L272 TraceCheckUtils]: 36: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2945#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:47:23,492 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2830#true} {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:47:23,492 INFO L290 TraceCheckUtils]: 34: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:47:23,492 INFO L290 TraceCheckUtils]: 33: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:47:23,492 INFO L290 TraceCheckUtils]: 32: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:47:23,492 INFO L272 TraceCheckUtils]: 31: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2830#true} is VALID [2022-04-27 13:47:23,493 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2830#true} {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:47:23,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:47:23,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:47:23,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:47:23,493 INFO L272 TraceCheckUtils]: 26: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2830#true} is VALID [2022-04-27 13:47:23,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 5);havoc #t~post5; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:47:23,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:47:23,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:47:23,498 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2830#true} {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} #82#return; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:47:23,498 INFO L290 TraceCheckUtils]: 21: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:47:23,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:47:23,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:47:23,498 INFO L272 TraceCheckUtils]: 18: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2830#true} is VALID [2022-04-27 13:47:23,503 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2830#true} {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:47:23,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:47:23,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:47:23,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:47:23,504 INFO L272 TraceCheckUtils]: 13: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2830#true} is VALID [2022-04-27 13:47:23,504 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2830#true} {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:47:23,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:47:23,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:47:23,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:47:23,505 INFO L272 TraceCheckUtils]: 8: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2830#true} is VALID [2022-04-27 13:47:23,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 5);havoc #t~post5; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:47:23,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:47:23,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {2830#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; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:47:23,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {2830#true} call #t~ret7 := main(); {2830#true} is VALID [2022-04-27 13:47:23,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2830#true} {2830#true} #92#return; {2830#true} is VALID [2022-04-27 13:47:23,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:47:23,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {2830#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);~counter~0 := 0; {2830#true} is VALID [2022-04-27 13:47:23,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {2830#true} call ULTIMATE.init(); {2830#true} is VALID [2022-04-27 13:47:23,509 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-27 13:47:23,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:47:23,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928135053] [2022-04-27 13:47:23,509 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:47:23,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266935434] [2022-04-27 13:47:23,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266935434] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:47:23,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:47:23,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 13:47:23,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821104835] [2022-04-27 13:47:23,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:47:23,510 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 40 [2022-04-27 13:47:23,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:47:23,511 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-27 13:47:23,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:23,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:47:23,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:47:23,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:47:23,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 13:47:23,529 INFO L87 Difference]: Start difference. First operand 112 states and 133 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-27 13:47:25,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:25,792 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2022-04-27 13:47:25,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:47:25,792 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 40 [2022-04-27 13:47:25,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:47:25,793 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-27 13:47:25,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-27 13:47:25,794 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-27 13:47:25,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-27 13:47:25,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-27 13:47:25,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:25,861 INFO L225 Difference]: With dead ends: 129 [2022-04-27 13:47:25,861 INFO L226 Difference]: Without dead ends: 125 [2022-04-27 13:47:25,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 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-27 13:47:25,862 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 103 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-27 13:47:25,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 103 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:47:25,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-27 13:47:25,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2022-04-27 13:47:25,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:47:25,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 122 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 81 states have internal predecessors, (92), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 13:47:25,903 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 122 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 81 states have internal predecessors, (92), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 13:47:25,905 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 122 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 81 states have internal predecessors, (92), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 13:47:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:25,914 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2022-04-27 13:47:25,914 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2022-04-27 13:47:25,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:25,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:25,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 81 states have internal predecessors, (92), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 125 states. [2022-04-27 13:47:25,916 INFO L87 Difference]: Start difference. First operand has 122 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 81 states have internal predecessors, (92), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 125 states. [2022-04-27 13:47:25,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:25,919 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2022-04-27 13:47:25,919 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2022-04-27 13:47:25,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:25,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:25,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:47:25,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:47:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 81 states have internal predecessors, (92), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 13:47:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2022-04-27 13:47:25,923 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 40 [2022-04-27 13:47:25,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:47:25,924 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2022-04-27 13:47:25,924 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-27 13:47:25,924 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2022-04-27 13:47:25,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-27 13:47:25,925 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:47:25,925 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:47:25,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 13:47:26,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:47:26,149 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:47:26,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:47:26,150 INFO L85 PathProgramCache]: Analyzing trace with hash 529029787, now seen corresponding path program 1 times [2022-04-27 13:47:26,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:47:26,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724702110] [2022-04-27 13:47:26,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:26,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:47:26,169 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:47:26,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [390999342] [2022-04-27 13:47:26,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:26,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:47:26,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:47:26,174 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:47:26,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 13:47:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:26,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:47:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:26,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:47:26,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {3681#true} call ULTIMATE.init(); {3681#true} is VALID [2022-04-27 13:47:26,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {3681#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);~counter~0 := 0; {3689#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:26,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {3689#(<= ~counter~0 0)} assume true; {3689#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:26,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3689#(<= ~counter~0 0)} {3681#true} #92#return; {3689#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:26,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {3689#(<= ~counter~0 0)} call #t~ret7 := main(); {3689#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:26,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {3689#(<= ~counter~0 0)} 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; {3689#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:26,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {3689#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:26,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {3705#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:26,496 INFO L272 TraceCheckUtils]: 8: Hoare triple {3705#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:26,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {3705#(<= ~counter~0 1)} ~cond := #in~cond; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:26,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {3705#(<= ~counter~0 1)} assume !(0 == ~cond); {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:26,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {3705#(<= ~counter~0 1)} assume true; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:26,498 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3705#(<= ~counter~0 1)} {3705#(<= ~counter~0 1)} #78#return; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:26,498 INFO L272 TraceCheckUtils]: 13: Hoare triple {3705#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:26,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {3705#(<= ~counter~0 1)} ~cond := #in~cond; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:26,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {3705#(<= ~counter~0 1)} assume !(0 == ~cond); {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:26,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {3705#(<= ~counter~0 1)} assume true; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:26,499 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3705#(<= ~counter~0 1)} {3705#(<= ~counter~0 1)} #80#return; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:26,500 INFO L272 TraceCheckUtils]: 18: Hoare triple {3705#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:26,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {3705#(<= ~counter~0 1)} ~cond := #in~cond; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:26,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {3705#(<= ~counter~0 1)} assume !(0 == ~cond); {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:26,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {3705#(<= ~counter~0 1)} assume true; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:26,501 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3705#(<= ~counter~0 1)} {3705#(<= ~counter~0 1)} #82#return; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:26,501 INFO L290 TraceCheckUtils]: 23: Hoare triple {3705#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:26,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {3705#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:26,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {3760#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:26,502 INFO L272 TraceCheckUtils]: 26: Hoare triple {3760#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:26,503 INFO L290 TraceCheckUtils]: 27: Hoare triple {3760#(<= ~counter~0 2)} ~cond := #in~cond; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:26,503 INFO L290 TraceCheckUtils]: 28: Hoare triple {3760#(<= ~counter~0 2)} assume !(0 == ~cond); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:26,503 INFO L290 TraceCheckUtils]: 29: Hoare triple {3760#(<= ~counter~0 2)} assume true; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:26,504 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3760#(<= ~counter~0 2)} {3760#(<= ~counter~0 2)} #78#return; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:26,504 INFO L272 TraceCheckUtils]: 31: Hoare triple {3760#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:26,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {3760#(<= ~counter~0 2)} ~cond := #in~cond; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:26,505 INFO L290 TraceCheckUtils]: 33: Hoare triple {3760#(<= ~counter~0 2)} assume !(0 == ~cond); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:26,505 INFO L290 TraceCheckUtils]: 34: Hoare triple {3760#(<= ~counter~0 2)} assume true; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:26,505 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3760#(<= ~counter~0 2)} {3760#(<= ~counter~0 2)} #80#return; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:26,506 INFO L272 TraceCheckUtils]: 36: Hoare triple {3760#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:26,506 INFO L290 TraceCheckUtils]: 37: Hoare triple {3760#(<= ~counter~0 2)} ~cond := #in~cond; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:26,506 INFO L290 TraceCheckUtils]: 38: Hoare triple {3760#(<= ~counter~0 2)} assume !(0 == ~cond); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:26,507 INFO L290 TraceCheckUtils]: 39: Hoare triple {3760#(<= ~counter~0 2)} assume true; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:26,508 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3760#(<= ~counter~0 2)} {3760#(<= ~counter~0 2)} #82#return; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:26,508 INFO L290 TraceCheckUtils]: 41: Hoare triple {3760#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:26,508 INFO L290 TraceCheckUtils]: 42: Hoare triple {3760#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3815#(<= |main_#t~post6| 2)} is VALID [2022-04-27 13:47:26,509 INFO L290 TraceCheckUtils]: 43: Hoare triple {3815#(<= |main_#t~post6| 2)} assume !(#t~post6 < 5);havoc #t~post6; {3682#false} is VALID [2022-04-27 13:47:26,509 INFO L272 TraceCheckUtils]: 44: Hoare triple {3682#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {3682#false} is VALID [2022-04-27 13:47:26,509 INFO L290 TraceCheckUtils]: 45: Hoare triple {3682#false} ~cond := #in~cond; {3682#false} is VALID [2022-04-27 13:47:26,509 INFO L290 TraceCheckUtils]: 46: Hoare triple {3682#false} assume !(0 == ~cond); {3682#false} is VALID [2022-04-27 13:47:26,509 INFO L290 TraceCheckUtils]: 47: Hoare triple {3682#false} assume true; {3682#false} is VALID [2022-04-27 13:47:26,509 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3682#false} {3682#false} #88#return; {3682#false} is VALID [2022-04-27 13:47:26,509 INFO L272 TraceCheckUtils]: 49: Hoare triple {3682#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {3682#false} is VALID [2022-04-27 13:47:26,509 INFO L290 TraceCheckUtils]: 50: Hoare triple {3682#false} ~cond := #in~cond; {3682#false} is VALID [2022-04-27 13:47:26,509 INFO L290 TraceCheckUtils]: 51: Hoare triple {3682#false} assume 0 == ~cond; {3682#false} is VALID [2022-04-27 13:47:26,509 INFO L290 TraceCheckUtils]: 52: Hoare triple {3682#false} assume !false; {3682#false} is VALID [2022-04-27 13:47:26,510 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 13:47:26,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:47:26,750 INFO L290 TraceCheckUtils]: 52: Hoare triple {3682#false} assume !false; {3682#false} is VALID [2022-04-27 13:47:26,750 INFO L290 TraceCheckUtils]: 51: Hoare triple {3682#false} assume 0 == ~cond; {3682#false} is VALID [2022-04-27 13:47:26,750 INFO L290 TraceCheckUtils]: 50: Hoare triple {3682#false} ~cond := #in~cond; {3682#false} is VALID [2022-04-27 13:47:26,750 INFO L272 TraceCheckUtils]: 49: Hoare triple {3682#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {3682#false} is VALID [2022-04-27 13:47:26,750 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3681#true} {3682#false} #88#return; {3682#false} is VALID [2022-04-27 13:47:26,750 INFO L290 TraceCheckUtils]: 47: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:47:26,750 INFO L290 TraceCheckUtils]: 46: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:47:26,750 INFO L290 TraceCheckUtils]: 45: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:47:26,750 INFO L272 TraceCheckUtils]: 44: Hoare triple {3682#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:47:26,751 INFO L290 TraceCheckUtils]: 43: Hoare triple {3873#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {3682#false} is VALID [2022-04-27 13:47:26,751 INFO L290 TraceCheckUtils]: 42: Hoare triple {3877#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3873#(< |main_#t~post6| 5)} is VALID [2022-04-27 13:47:26,751 INFO L290 TraceCheckUtils]: 41: Hoare triple {3877#(< ~counter~0 5)} assume !(~r~0 >= ~d~0); {3877#(< ~counter~0 5)} is VALID [2022-04-27 13:47:26,752 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3681#true} {3877#(< ~counter~0 5)} #82#return; {3877#(< ~counter~0 5)} is VALID [2022-04-27 13:47:26,752 INFO L290 TraceCheckUtils]: 39: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:47:26,752 INFO L290 TraceCheckUtils]: 38: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:47:26,752 INFO L290 TraceCheckUtils]: 37: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:47:26,752 INFO L272 TraceCheckUtils]: 36: Hoare triple {3877#(< ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:47:26,753 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3681#true} {3877#(< ~counter~0 5)} #80#return; {3877#(< ~counter~0 5)} is VALID [2022-04-27 13:47:26,753 INFO L290 TraceCheckUtils]: 34: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:47:26,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:47:26,753 INFO L290 TraceCheckUtils]: 32: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:47:26,753 INFO L272 TraceCheckUtils]: 31: Hoare triple {3877#(< ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:47:26,758 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3681#true} {3877#(< ~counter~0 5)} #78#return; {3877#(< ~counter~0 5)} is VALID [2022-04-27 13:47:26,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:47:26,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:47:26,758 INFO L290 TraceCheckUtils]: 27: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:47:26,758 INFO L272 TraceCheckUtils]: 26: Hoare triple {3877#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:47:26,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {3877#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {3877#(< ~counter~0 5)} is VALID [2022-04-27 13:47:26,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {3932#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3877#(< ~counter~0 5)} is VALID [2022-04-27 13:47:26,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {3932#(< ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3932#(< ~counter~0 4)} is VALID [2022-04-27 13:47:26,761 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3681#true} {3932#(< ~counter~0 4)} #82#return; {3932#(< ~counter~0 4)} is VALID [2022-04-27 13:47:26,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:47:26,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:47:26,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:47:26,761 INFO L272 TraceCheckUtils]: 18: Hoare triple {3932#(< ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:47:26,762 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3681#true} {3932#(< ~counter~0 4)} #80#return; {3932#(< ~counter~0 4)} is VALID [2022-04-27 13:47:26,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:47:26,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:47:26,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:47:26,762 INFO L272 TraceCheckUtils]: 13: Hoare triple {3932#(< ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:47:26,763 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3681#true} {3932#(< ~counter~0 4)} #78#return; {3932#(< ~counter~0 4)} is VALID [2022-04-27 13:47:26,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:47:26,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:47:26,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:47:26,763 INFO L272 TraceCheckUtils]: 8: Hoare triple {3932#(< ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:47:26,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {3932#(< ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {3932#(< ~counter~0 4)} is VALID [2022-04-27 13:47:26,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {3760#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3932#(< ~counter~0 4)} is VALID [2022-04-27 13:47:26,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {3760#(<= ~counter~0 2)} 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; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:26,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {3760#(<= ~counter~0 2)} call #t~ret7 := main(); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:26,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3760#(<= ~counter~0 2)} {3681#true} #92#return; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:26,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {3760#(<= ~counter~0 2)} assume true; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:26,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {3681#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);~counter~0 := 0; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:26,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {3681#true} call ULTIMATE.init(); {3681#true} is VALID [2022-04-27 13:47:26,767 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 13:47:26,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:47:26,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724702110] [2022-04-27 13:47:26,767 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:47:26,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390999342] [2022-04-27 13:47:26,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390999342] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:47:26,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:47:26,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-27 13:47:26,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677863123] [2022-04-27 13:47:26,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:47:26,769 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 53 [2022-04-27 13:47:26,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:47:26,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-27 13:47:26,815 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-27 13:47:26,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:47:26,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:47:26,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:47:26,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:47:26,816 INFO L87 Difference]: Start difference. First operand 122 states and 143 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-27 13:47:27,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:27,179 INFO L93 Difference]: Finished difference Result 198 states and 236 transitions. [2022-04-27 13:47:27,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:47:27,179 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 53 [2022-04-27 13:47:27,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:47:27,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-27 13:47:27,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2022-04-27 13:47:27,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-27 13:47:27,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2022-04-27 13:47:27,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 131 transitions. [2022-04-27 13:47:27,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:27,286 INFO L225 Difference]: With dead ends: 198 [2022-04-27 13:47:27,286 INFO L226 Difference]: Without dead ends: 177 [2022-04-27 13:47:27,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:47:27,288 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 56 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:47:27,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 198 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:47:27,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-27 13:47:27,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 172. [2022-04-27 13:47:27,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:47:27,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 172 states, 111 states have (on average 1.1801801801801801) internal successors, (131), 117 states have internal predecessors, (131), 39 states have call successors, (39), 23 states have call predecessors, (39), 21 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 13:47:27,370 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 172 states, 111 states have (on average 1.1801801801801801) internal successors, (131), 117 states have internal predecessors, (131), 39 states have call successors, (39), 23 states have call predecessors, (39), 21 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 13:47:27,370 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 172 states, 111 states have (on average 1.1801801801801801) internal successors, (131), 117 states have internal predecessors, (131), 39 states have call successors, (39), 23 states have call predecessors, (39), 21 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 13:47:27,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:27,376 INFO L93 Difference]: Finished difference Result 177 states and 208 transitions. [2022-04-27 13:47:27,376 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 208 transitions. [2022-04-27 13:47:27,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:27,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:27,377 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 111 states have (on average 1.1801801801801801) internal successors, (131), 117 states have internal predecessors, (131), 39 states have call successors, (39), 23 states have call predecessors, (39), 21 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) Second operand 177 states. [2022-04-27 13:47:27,377 INFO L87 Difference]: Start difference. First operand has 172 states, 111 states have (on average 1.1801801801801801) internal successors, (131), 117 states have internal predecessors, (131), 39 states have call successors, (39), 23 states have call predecessors, (39), 21 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) Second operand 177 states. [2022-04-27 13:47:27,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:27,381 INFO L93 Difference]: Finished difference Result 177 states and 208 transitions. [2022-04-27 13:47:27,381 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 208 transitions. [2022-04-27 13:47:27,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:27,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:27,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:47:27,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:47:27,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 111 states have (on average 1.1801801801801801) internal successors, (131), 117 states have internal predecessors, (131), 39 states have call successors, (39), 23 states have call predecessors, (39), 21 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 13:47:27,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 205 transitions. [2022-04-27 13:47:27,386 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 205 transitions. Word has length 53 [2022-04-27 13:47:27,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:47:27,387 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 205 transitions. [2022-04-27 13:47:27,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-27 13:47:27,387 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 205 transitions. [2022-04-27 13:47:27,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-27 13:47:27,388 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:47:27,388 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:47:27,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 13:47:27,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:47:27,599 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:47:27,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:47:27,600 INFO L85 PathProgramCache]: Analyzing trace with hash -41602886, now seen corresponding path program 1 times [2022-04-27 13:47:27,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:47:27,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177536091] [2022-04-27 13:47:27,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:27,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:47:27,610 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:47:27,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2075896294] [2022-04-27 13:47:27,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:27,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:47:27,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:47:27,611 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:47:27,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 13:47:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:27,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 13:47:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:27,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:47:28,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {4879#true} call ULTIMATE.init(); {4879#true} is VALID [2022-04-27 13:47:28,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {4879#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);~counter~0 := 0; {4879#true} is VALID [2022-04-27 13:47:28,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-27 13:47:28,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4879#true} {4879#true} #92#return; {4879#true} is VALID [2022-04-27 13:47:28,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {4879#true} call #t~ret7 := main(); {4879#true} is VALID [2022-04-27 13:47:28,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {4879#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; {4899#(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-27 13:47:28,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {4899#(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))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4899#(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-27 13:47:28,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {4899#(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 !!(#t~post5 < 5);havoc #t~post5; {4899#(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-27 13:47:28,146 INFO L272 TraceCheckUtils]: 8: Hoare triple {4899#(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)); {4879#true} is VALID [2022-04-27 13:47:28,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-27 13:47:28,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-27 13:47:28,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-27 13:47:28,147 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4879#true} {4899#(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; {4899#(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-27 13:47:28,147 INFO L272 TraceCheckUtils]: 13: Hoare triple {4899#(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)); {4879#true} is VALID [2022-04-27 13:47:28,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-27 13:47:28,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-27 13:47:28,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-27 13:47:28,148 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4879#true} {4899#(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; {4899#(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-27 13:47:28,148 INFO L272 TraceCheckUtils]: 18: Hoare triple {4899#(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)); {4879#true} is VALID [2022-04-27 13:47:28,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-27 13:47:28,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-27 13:47:28,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-27 13:47:28,149 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4879#true} {4899#(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))} #82#return; {4899#(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-27 13:47:28,149 INFO L290 TraceCheckUtils]: 23: Hoare triple {4899#(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; {4954#(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-27 13:47:28,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {4954#(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))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4954#(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-27 13:47:28,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {4954#(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 !!(#t~post5 < 5);havoc #t~post5; {4954#(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-27 13:47:28,150 INFO L272 TraceCheckUtils]: 26: Hoare triple {4954#(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)); {4879#true} is VALID [2022-04-27 13:47:28,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-27 13:47:28,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-27 13:47:28,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-27 13:47:28,153 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4879#true} {4954#(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; {4954#(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-27 13:47:28,153 INFO L272 TraceCheckUtils]: 31: Hoare triple {4954#(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)); {4879#true} is VALID [2022-04-27 13:47:28,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-27 13:47:28,153 INFO L290 TraceCheckUtils]: 33: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-27 13:47:28,153 INFO L290 TraceCheckUtils]: 34: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-27 13:47:28,154 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4879#true} {4954#(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; {4954#(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-27 13:47:28,154 INFO L272 TraceCheckUtils]: 36: Hoare triple {4954#(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)); {4879#true} is VALID [2022-04-27 13:47:28,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-27 13:47:28,154 INFO L290 TraceCheckUtils]: 38: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-27 13:47:28,154 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-27 13:47:28,155 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4879#true} {4954#(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; {4954#(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-27 13:47:28,155 INFO L290 TraceCheckUtils]: 41: Hoare triple {4954#(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); {4954#(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-27 13:47:28,156 INFO L290 TraceCheckUtils]: 42: Hoare triple {4954#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4954#(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-27 13:47:28,156 INFO L290 TraceCheckUtils]: 43: Hoare triple {4954#(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 !!(#t~post6 < 5);havoc #t~post6; {4954#(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-27 13:47:28,156 INFO L272 TraceCheckUtils]: 44: Hoare triple {4954#(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)); {4879#true} is VALID [2022-04-27 13:47:28,156 INFO L290 TraceCheckUtils]: 45: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-27 13:47:28,156 INFO L290 TraceCheckUtils]: 46: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-27 13:47:28,156 INFO L290 TraceCheckUtils]: 47: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-27 13:47:28,157 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4879#true} {4954#(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; {4954#(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-27 13:47:28,157 INFO L272 TraceCheckUtils]: 49: Hoare triple {4954#(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)); {4879#true} is VALID [2022-04-27 13:47:28,157 INFO L290 TraceCheckUtils]: 50: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-27 13:47:28,157 INFO L290 TraceCheckUtils]: 51: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-27 13:47:28,157 INFO L290 TraceCheckUtils]: 52: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-27 13:47:28,158 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {4879#true} {4954#(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))} #86#return; {4954#(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-27 13:47:28,159 INFO L290 TraceCheckUtils]: 54: Hoare triple {4954#(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); {4899#(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-27 13:47:28,159 INFO L290 TraceCheckUtils]: 55: Hoare triple {4899#(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; {5051#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-27 13:47:28,160 INFO L290 TraceCheckUtils]: 56: Hoare triple {5051#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5051#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-27 13:47:28,160 INFO L290 TraceCheckUtils]: 57: Hoare triple {5051#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {5051#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-27 13:47:28,161 INFO L272 TraceCheckUtils]: 58: Hoare triple {5051#(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)); {5061#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:47:28,161 INFO L290 TraceCheckUtils]: 59: Hoare triple {5061#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5065#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:47:28,161 INFO L290 TraceCheckUtils]: 60: Hoare triple {5065#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4880#false} is VALID [2022-04-27 13:47:28,161 INFO L290 TraceCheckUtils]: 61: Hoare triple {4880#false} assume !false; {4880#false} is VALID [2022-04-27 13:47:28,162 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 13:47:28,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:47:29,467 INFO L290 TraceCheckUtils]: 61: Hoare triple {4880#false} assume !false; {4880#false} is VALID [2022-04-27 13:47:29,467 INFO L290 TraceCheckUtils]: 60: Hoare triple {5065#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4880#false} is VALID [2022-04-27 13:47:29,467 INFO L290 TraceCheckUtils]: 59: Hoare triple {5061#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5065#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:47:29,468 INFO L272 TraceCheckUtils]: 58: Hoare triple {5081#(= (+ (* 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)); {5061#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:47:29,468 INFO L290 TraceCheckUtils]: 57: Hoare triple {5081#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 5);havoc #t~post6; {5081#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:47:29,469 INFO L290 TraceCheckUtils]: 56: Hoare triple {5081#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5081#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:47:29,481 INFO L290 TraceCheckUtils]: 55: Hoare triple {5091#(= 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; {5081#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:47:29,505 INFO L290 TraceCheckUtils]: 54: Hoare triple {5095#(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); {5091#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 13:47:29,506 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {4879#true} {5095#(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))))))))} #86#return; {5095#(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-27 13:47:29,506 INFO L290 TraceCheckUtils]: 52: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-27 13:47:29,507 INFO L290 TraceCheckUtils]: 51: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-27 13:47:29,507 INFO L290 TraceCheckUtils]: 50: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-27 13:47:29,507 INFO L272 TraceCheckUtils]: 49: Hoare triple {5095#(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)); {4879#true} is VALID [2022-04-27 13:47:29,507 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4879#true} {5095#(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; {5095#(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-27 13:47:29,508 INFO L290 TraceCheckUtils]: 47: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-27 13:47:29,508 INFO L290 TraceCheckUtils]: 46: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-27 13:47:29,508 INFO L290 TraceCheckUtils]: 45: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-27 13:47:29,508 INFO L272 TraceCheckUtils]: 44: Hoare triple {5095#(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)); {4879#true} is VALID [2022-04-27 13:47:29,509 INFO L290 TraceCheckUtils]: 43: Hoare triple {5095#(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 !!(#t~post6 < 5);havoc #t~post6; {5095#(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-27 13:47:29,510 INFO L290 TraceCheckUtils]: 42: Hoare triple {5095#(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))))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5095#(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-27 13:47:29,510 INFO L290 TraceCheckUtils]: 41: Hoare triple {5095#(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); {5095#(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-27 13:47:29,511 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4879#true} {5095#(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; {5095#(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-27 13:47:29,511 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-27 13:47:29,511 INFO L290 TraceCheckUtils]: 38: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-27 13:47:29,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-27 13:47:29,511 INFO L272 TraceCheckUtils]: 36: Hoare triple {5095#(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)); {4879#true} is VALID [2022-04-27 13:47:29,512 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4879#true} {5095#(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; {5095#(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-27 13:47:29,512 INFO L290 TraceCheckUtils]: 34: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-27 13:47:29,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-27 13:47:29,512 INFO L290 TraceCheckUtils]: 32: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-27 13:47:29,512 INFO L272 TraceCheckUtils]: 31: Hoare triple {5095#(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)); {4879#true} is VALID [2022-04-27 13:47:29,514 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4879#true} {5095#(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; {5095#(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-27 13:47:29,514 INFO L290 TraceCheckUtils]: 29: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-27 13:47:29,514 INFO L290 TraceCheckUtils]: 28: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-27 13:47:29,514 INFO L290 TraceCheckUtils]: 27: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-27 13:47:29,515 INFO L272 TraceCheckUtils]: 26: Hoare triple {5095#(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)); {4879#true} is VALID [2022-04-27 13:47:29,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {5095#(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 !!(#t~post5 < 5);havoc #t~post5; {5095#(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-27 13:47:29,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {5095#(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))))))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5095#(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-27 13:47:29,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {5091#(= 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; {5095#(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-27 13:47:29,529 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4879#true} {5091#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #82#return; {5091#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 13:47:29,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-27 13:47:29,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-27 13:47:29,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-27 13:47:29,529 INFO L272 TraceCheckUtils]: 18: Hoare triple {5091#(= 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)); {4879#true} is VALID [2022-04-27 13:47:29,530 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4879#true} {5091#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #80#return; {5091#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 13:47:29,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-27 13:47:29,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-27 13:47:29,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-27 13:47:29,530 INFO L272 TraceCheckUtils]: 13: Hoare triple {5091#(= 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)); {4879#true} is VALID [2022-04-27 13:47:29,531 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4879#true} {5091#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #78#return; {5091#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 13:47:29,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-27 13:47:29,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-27 13:47:29,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-27 13:47:29,531 INFO L272 TraceCheckUtils]: 8: Hoare triple {5091#(= 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)); {4879#true} is VALID [2022-04-27 13:47:29,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {5091#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume !!(#t~post5 < 5);havoc #t~post5; {5091#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 13:47:29,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {5091#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5091#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 13:47:29,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {4879#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; {5091#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 13:47:29,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {4879#true} call #t~ret7 := main(); {4879#true} is VALID [2022-04-27 13:47:29,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4879#true} {4879#true} #92#return; {4879#true} is VALID [2022-04-27 13:47:29,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-27 13:47:29,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {4879#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);~counter~0 := 0; {4879#true} is VALID [2022-04-27 13:47:29,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {4879#true} call ULTIMATE.init(); {4879#true} is VALID [2022-04-27 13:47:29,533 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 13:47:29,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:47:29,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177536091] [2022-04-27 13:47:29,533 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:47:29,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075896294] [2022-04-27 13:47:29,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075896294] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:47:29,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:47:29,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-27 13:47:29,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21830637] [2022-04-27 13:47:29,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:47:29,534 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 62 [2022-04-27 13:47:29,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:47:29,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 13:47:29,630 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-27 13:47:29,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:47:29,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:47:29,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:47:29,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:47:29,631 INFO L87 Difference]: Start difference. First operand 172 states and 205 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 13:47:33,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:33,373 INFO L93 Difference]: Finished difference Result 270 states and 344 transitions. [2022-04-27 13:47:33,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:47:33,373 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 62 [2022-04-27 13:47:33,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:47:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 13:47:33,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2022-04-27 13:47:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 13:47:33,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2022-04-27 13:47:33,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 153 transitions. [2022-04-27 13:47:33,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:33,618 INFO L225 Difference]: With dead ends: 270 [2022-04-27 13:47:33,618 INFO L226 Difference]: Without dead ends: 225 [2022-04-27 13:47:33,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:47:33,621 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 54 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 13:47:33,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 200 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 13:47:33,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-04-27 13:47:33,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 212. [2022-04-27 13:47:33,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:47:33,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand has 212 states, 141 states have (on average 1.2198581560283688) internal successors, (172), 147 states have internal predecessors, (172), 45 states have call successors, (45), 26 states have call predecessors, (45), 25 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 13:47:33,694 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand has 212 states, 141 states have (on average 1.2198581560283688) internal successors, (172), 147 states have internal predecessors, (172), 45 states have call successors, (45), 26 states have call predecessors, (45), 25 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 13:47:33,694 INFO L87 Difference]: Start difference. First operand 225 states. Second operand has 212 states, 141 states have (on average 1.2198581560283688) internal successors, (172), 147 states have internal predecessors, (172), 45 states have call successors, (45), 26 states have call predecessors, (45), 25 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 13:47:33,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:33,700 INFO L93 Difference]: Finished difference Result 225 states and 280 transitions. [2022-04-27 13:47:33,700 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 280 transitions. [2022-04-27 13:47:33,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:33,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:33,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 212 states, 141 states have (on average 1.2198581560283688) internal successors, (172), 147 states have internal predecessors, (172), 45 states have call successors, (45), 26 states have call predecessors, (45), 25 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) Second operand 225 states. [2022-04-27 13:47:33,703 INFO L87 Difference]: Start difference. First operand has 212 states, 141 states have (on average 1.2198581560283688) internal successors, (172), 147 states have internal predecessors, (172), 45 states have call successors, (45), 26 states have call predecessors, (45), 25 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) Second operand 225 states. [2022-04-27 13:47:33,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:33,708 INFO L93 Difference]: Finished difference Result 225 states and 280 transitions. [2022-04-27 13:47:33,708 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 280 transitions. [2022-04-27 13:47:33,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:33,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:33,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:47:33,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:47:33,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 141 states have (on average 1.2198581560283688) internal successors, (172), 147 states have internal predecessors, (172), 45 states have call successors, (45), 26 states have call predecessors, (45), 25 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 13:47:33,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 259 transitions. [2022-04-27 13:47:33,715 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 259 transitions. Word has length 62 [2022-04-27 13:47:33,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:47:33,715 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 259 transitions. [2022-04-27 13:47:33,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 13:47:33,716 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 259 transitions. [2022-04-27 13:47:33,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-27 13:47:33,716 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:47:33,716 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:47:33,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 13:47:33,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:47:33,932 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:47:33,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:47:33,932 INFO L85 PathProgramCache]: Analyzing trace with hash 73149133, now seen corresponding path program 1 times [2022-04-27 13:47:33,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:47:33,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056575296] [2022-04-27 13:47:33,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:33,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:47:33,944 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:47:33,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046915779] [2022-04-27 13:47:33,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:33,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:47:33,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:47:33,946 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:47:33,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 13:47:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:33,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-27 13:47:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:34,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:47:34,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {6380#true} call ULTIMATE.init(); {6380#true} is VALID [2022-04-27 13:47:34,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {6380#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);~counter~0 := 0; {6380#true} is VALID [2022-04-27 13:47:34,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {6380#true} assume true; {6380#true} is VALID [2022-04-27 13:47:34,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6380#true} {6380#true} #92#return; {6380#true} is VALID [2022-04-27 13:47:34,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {6380#true} call #t~ret7 := main(); {6380#true} is VALID [2022-04-27 13:47:34,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {6380#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; {6400#(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-27 13:47:34,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {6400#(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))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6400#(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-27 13:47:34,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {6400#(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 !!(#t~post5 < 5);havoc #t~post5; {6400#(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-27 13:47:34,786 INFO L272 TraceCheckUtils]: 8: Hoare triple {6400#(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)); {6380#true} is VALID [2022-04-27 13:47:34,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {6380#true} ~cond := #in~cond; {6380#true} is VALID [2022-04-27 13:47:34,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {6380#true} assume !(0 == ~cond); {6380#true} is VALID [2022-04-27 13:47:34,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {6380#true} assume true; {6380#true} is VALID [2022-04-27 13:47:34,787 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6380#true} {6400#(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; {6400#(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-27 13:47:34,787 INFO L272 TraceCheckUtils]: 13: Hoare triple {6400#(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)); {6380#true} is VALID [2022-04-27 13:47:34,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {6380#true} ~cond := #in~cond; {6380#true} is VALID [2022-04-27 13:47:34,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {6380#true} assume !(0 == ~cond); {6380#true} is VALID [2022-04-27 13:47:34,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {6380#true} assume true; {6380#true} is VALID [2022-04-27 13:47:34,788 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6380#true} {6400#(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; {6400#(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-27 13:47:34,788 INFO L272 TraceCheckUtils]: 18: Hoare triple {6400#(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)); {6380#true} is VALID [2022-04-27 13:47:34,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {6380#true} ~cond := #in~cond; {6380#true} is VALID [2022-04-27 13:47:34,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {6380#true} assume !(0 == ~cond); {6380#true} is VALID [2022-04-27 13:47:34,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {6380#true} assume true; {6380#true} is VALID [2022-04-27 13:47:34,789 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6380#true} {6400#(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))} #82#return; {6400#(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-27 13:47:34,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {6400#(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; {6455#(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-27 13:47:34,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {6455#(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))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6455#(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-27 13:47:34,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {6455#(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 !!(#t~post5 < 5);havoc #t~post5; {6455#(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-27 13:47:34,791 INFO L272 TraceCheckUtils]: 26: Hoare triple {6455#(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)); {6380#true} is VALID [2022-04-27 13:47:34,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {6380#true} ~cond := #in~cond; {6380#true} is VALID [2022-04-27 13:47:34,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {6380#true} assume !(0 == ~cond); {6380#true} is VALID [2022-04-27 13:47:34,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {6380#true} assume true; {6380#true} is VALID [2022-04-27 13:47:34,792 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6380#true} {6455#(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; {6455#(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-27 13:47:34,792 INFO L272 TraceCheckUtils]: 31: Hoare triple {6455#(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)); {6380#true} is VALID [2022-04-27 13:47:34,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {6380#true} ~cond := #in~cond; {6380#true} is VALID [2022-04-27 13:47:34,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {6380#true} assume !(0 == ~cond); {6380#true} is VALID [2022-04-27 13:47:34,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {6380#true} assume true; {6380#true} is VALID [2022-04-27 13:47:34,792 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6380#true} {6455#(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; {6455#(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-27 13:47:34,793 INFO L272 TraceCheckUtils]: 36: Hoare triple {6455#(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)); {6380#true} is VALID [2022-04-27 13:47:34,793 INFO L290 TraceCheckUtils]: 37: Hoare triple {6380#true} ~cond := #in~cond; {6380#true} is VALID [2022-04-27 13:47:34,793 INFO L290 TraceCheckUtils]: 38: Hoare triple {6380#true} assume !(0 == ~cond); {6380#true} is VALID [2022-04-27 13:47:34,793 INFO L290 TraceCheckUtils]: 39: Hoare triple {6380#true} assume true; {6380#true} is VALID [2022-04-27 13:47:34,794 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6380#true} {6455#(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; {6455#(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-27 13:47:34,794 INFO L290 TraceCheckUtils]: 41: Hoare triple {6455#(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); {6455#(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-27 13:47:34,795 INFO L290 TraceCheckUtils]: 42: Hoare triple {6455#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6455#(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-27 13:47:34,795 INFO L290 TraceCheckUtils]: 43: Hoare triple {6455#(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 !!(#t~post6 < 5);havoc #t~post6; {6455#(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-27 13:47:34,795 INFO L272 TraceCheckUtils]: 44: Hoare triple {6455#(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)); {6380#true} is VALID [2022-04-27 13:47:34,795 INFO L290 TraceCheckUtils]: 45: Hoare triple {6380#true} ~cond := #in~cond; {6380#true} is VALID [2022-04-27 13:47:34,796 INFO L290 TraceCheckUtils]: 46: Hoare triple {6380#true} assume !(0 == ~cond); {6380#true} is VALID [2022-04-27 13:47:34,796 INFO L290 TraceCheckUtils]: 47: Hoare triple {6380#true} assume true; {6380#true} is VALID [2022-04-27 13:47:34,796 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6380#true} {6455#(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; {6455#(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-27 13:47:34,796 INFO L272 TraceCheckUtils]: 49: Hoare triple {6455#(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)); {6380#true} is VALID [2022-04-27 13:47:34,796 INFO L290 TraceCheckUtils]: 50: Hoare triple {6380#true} ~cond := #in~cond; {6380#true} is VALID [2022-04-27 13:47:34,797 INFO L290 TraceCheckUtils]: 51: Hoare triple {6380#true} assume !(0 == ~cond); {6380#true} is VALID [2022-04-27 13:47:34,797 INFO L290 TraceCheckUtils]: 52: Hoare triple {6380#true} assume true; {6380#true} is VALID [2022-04-27 13:47:34,797 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6380#true} {6455#(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))} #86#return; {6455#(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-27 13:47:34,798 INFO L290 TraceCheckUtils]: 54: Hoare triple {6455#(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); {6400#(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-27 13:47:34,799 INFO L290 TraceCheckUtils]: 55: Hoare triple {6400#(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; {6552#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:47:34,799 INFO L290 TraceCheckUtils]: 56: Hoare triple {6552#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6552#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:47:34,800 INFO L290 TraceCheckUtils]: 57: Hoare triple {6552#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {6552#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:47:34,800 INFO L272 TraceCheckUtils]: 58: Hoare triple {6552#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= 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)); {6380#true} is VALID [2022-04-27 13:47:34,800 INFO L290 TraceCheckUtils]: 59: Hoare triple {6380#true} ~cond := #in~cond; {6565#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:47:34,800 INFO L290 TraceCheckUtils]: 60: Hoare triple {6565#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6569#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:47:34,801 INFO L290 TraceCheckUtils]: 61: Hoare triple {6569#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6569#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:47:34,801 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {6569#(not (= |__VERIFIER_assert_#in~cond| 0))} {6552#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {6576#(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-27 13:47:34,802 INFO L272 TraceCheckUtils]: 63: Hoare triple {6576#(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)); {6380#true} is VALID [2022-04-27 13:47:34,802 INFO L290 TraceCheckUtils]: 64: Hoare triple {6380#true} ~cond := #in~cond; {6565#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:47:34,802 INFO L290 TraceCheckUtils]: 65: Hoare triple {6565#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6569#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:47:34,802 INFO L290 TraceCheckUtils]: 66: Hoare triple {6569#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6569#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:47:34,803 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {6569#(not (= |__VERIFIER_assert_#in~cond| 0))} {6576#(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))} #86#return; {6592#(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-27 13:47:34,804 INFO L290 TraceCheckUtils]: 68: Hoare triple {6592#(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); {6596#(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-27 13:47:34,804 INFO L272 TraceCheckUtils]: 69: Hoare triple {6596#(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)); {6600#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:47:34,805 INFO L290 TraceCheckUtils]: 70: Hoare triple {6600#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6604#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:47:34,805 INFO L290 TraceCheckUtils]: 71: Hoare triple {6604#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6381#false} is VALID [2022-04-27 13:47:34,805 INFO L290 TraceCheckUtils]: 72: Hoare triple {6381#false} assume !false; {6381#false} is VALID [2022-04-27 13:47:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 66 proven. 13 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-04-27 13:47:34,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:47:50,122 INFO L290 TraceCheckUtils]: 72: Hoare triple {6381#false} assume !false; {6381#false} is VALID [2022-04-27 13:47:50,123 INFO L290 TraceCheckUtils]: 71: Hoare triple {6604#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6381#false} is VALID [2022-04-27 13:47:50,123 INFO L290 TraceCheckUtils]: 70: Hoare triple {6600#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6604#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:47:50,124 INFO L272 TraceCheckUtils]: 69: Hoare triple {6620#(= (+ (* 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)); {6600#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:47:50,125 INFO L290 TraceCheckUtils]: 68: Hoare triple {6624#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} assume !(1 != ~p~0); {6620#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:47:50,125 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {6569#(not (= |__VERIFIER_assert_#in~cond| 0))} {6628#(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)))} #86#return; {6624#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} is VALID [2022-04-27 13:47:50,126 INFO L290 TraceCheckUtils]: 66: Hoare triple {6569#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6569#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:47:50,126 INFO L290 TraceCheckUtils]: 65: Hoare triple {6638#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6569#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:47:50,126 INFO L290 TraceCheckUtils]: 64: Hoare triple {6380#true} ~cond := #in~cond; {6638#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:47:50,127 INFO L272 TraceCheckUtils]: 63: Hoare triple {6628#(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)); {6380#true} is VALID [2022-04-27 13:47:50,129 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {6569#(not (= |__VERIFIER_assert_#in~cond| 0))} {6380#true} #84#return; {6628#(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-27 13:47:50,129 INFO L290 TraceCheckUtils]: 61: Hoare triple {6569#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6569#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:47:50,130 INFO L290 TraceCheckUtils]: 60: Hoare triple {6638#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6569#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:47:50,130 INFO L290 TraceCheckUtils]: 59: Hoare triple {6380#true} ~cond := #in~cond; {6638#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:47:50,130 INFO L272 TraceCheckUtils]: 58: Hoare triple {6380#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6380#true} is VALID [2022-04-27 13:47:50,130 INFO L290 TraceCheckUtils]: 57: Hoare triple {6380#true} assume !!(#t~post6 < 5);havoc #t~post6; {6380#true} is VALID [2022-04-27 13:47:50,130 INFO L290 TraceCheckUtils]: 56: Hoare triple {6380#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6380#true} is VALID [2022-04-27 13:47:50,131 INFO L290 TraceCheckUtils]: 55: Hoare triple {6380#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {6380#true} is VALID [2022-04-27 13:47:50,131 INFO L290 TraceCheckUtils]: 54: Hoare triple {6380#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); {6380#true} is VALID [2022-04-27 13:47:50,131 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6380#true} {6380#true} #86#return; {6380#true} is VALID [2022-04-27 13:47:50,131 INFO L290 TraceCheckUtils]: 52: Hoare triple {6380#true} assume true; {6380#true} is VALID [2022-04-27 13:47:50,131 INFO L290 TraceCheckUtils]: 51: Hoare triple {6380#true} assume !(0 == ~cond); {6380#true} is VALID [2022-04-27 13:47:50,131 INFO L290 TraceCheckUtils]: 50: Hoare triple {6380#true} ~cond := #in~cond; {6380#true} is VALID [2022-04-27 13:47:50,131 INFO L272 TraceCheckUtils]: 49: Hoare triple {6380#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6380#true} is VALID [2022-04-27 13:47:50,131 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6380#true} {6380#true} #84#return; {6380#true} is VALID [2022-04-27 13:47:50,131 INFO L290 TraceCheckUtils]: 47: Hoare triple {6380#true} assume true; {6380#true} is VALID [2022-04-27 13:47:50,131 INFO L290 TraceCheckUtils]: 46: Hoare triple {6380#true} assume !(0 == ~cond); {6380#true} is VALID [2022-04-27 13:47:50,131 INFO L290 TraceCheckUtils]: 45: Hoare triple {6380#true} ~cond := #in~cond; {6380#true} is VALID [2022-04-27 13:47:50,132 INFO L272 TraceCheckUtils]: 44: Hoare triple {6380#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6380#true} is VALID [2022-04-27 13:47:50,132 INFO L290 TraceCheckUtils]: 43: Hoare triple {6380#true} assume !!(#t~post6 < 5);havoc #t~post6; {6380#true} is VALID [2022-04-27 13:47:50,132 INFO L290 TraceCheckUtils]: 42: Hoare triple {6380#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6380#true} is VALID [2022-04-27 13:47:50,132 INFO L290 TraceCheckUtils]: 41: Hoare triple {6380#true} assume !(~r~0 >= ~d~0); {6380#true} is VALID [2022-04-27 13:47:50,132 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6380#true} {6380#true} #82#return; {6380#true} is VALID [2022-04-27 13:47:50,132 INFO L290 TraceCheckUtils]: 39: Hoare triple {6380#true} assume true; {6380#true} is VALID [2022-04-27 13:47:50,132 INFO L290 TraceCheckUtils]: 38: Hoare triple {6380#true} assume !(0 == ~cond); {6380#true} is VALID [2022-04-27 13:47:50,132 INFO L290 TraceCheckUtils]: 37: Hoare triple {6380#true} ~cond := #in~cond; {6380#true} is VALID [2022-04-27 13:47:50,132 INFO L272 TraceCheckUtils]: 36: Hoare triple {6380#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6380#true} is VALID [2022-04-27 13:47:50,132 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6380#true} {6380#true} #80#return; {6380#true} is VALID [2022-04-27 13:47:50,132 INFO L290 TraceCheckUtils]: 34: Hoare triple {6380#true} assume true; {6380#true} is VALID [2022-04-27 13:47:50,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {6380#true} assume !(0 == ~cond); {6380#true} is VALID [2022-04-27 13:47:50,133 INFO L290 TraceCheckUtils]: 32: Hoare triple {6380#true} ~cond := #in~cond; {6380#true} is VALID [2022-04-27 13:47:50,133 INFO L272 TraceCheckUtils]: 31: Hoare triple {6380#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6380#true} is VALID [2022-04-27 13:47:50,133 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6380#true} {6380#true} #78#return; {6380#true} is VALID [2022-04-27 13:47:50,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {6380#true} assume true; {6380#true} is VALID [2022-04-27 13:47:50,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {6380#true} assume !(0 == ~cond); {6380#true} is VALID [2022-04-27 13:47:50,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {6380#true} ~cond := #in~cond; {6380#true} is VALID [2022-04-27 13:47:50,133 INFO L272 TraceCheckUtils]: 26: Hoare triple {6380#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6380#true} is VALID [2022-04-27 13:47:50,133 INFO L290 TraceCheckUtils]: 25: Hoare triple {6380#true} assume !!(#t~post5 < 5);havoc #t~post5; {6380#true} is VALID [2022-04-27 13:47:50,133 INFO L290 TraceCheckUtils]: 24: Hoare triple {6380#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6380#true} is VALID [2022-04-27 13:47:50,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {6380#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6380#true} is VALID [2022-04-27 13:47:50,134 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6380#true} {6380#true} #82#return; {6380#true} is VALID [2022-04-27 13:47:50,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {6380#true} assume true; {6380#true} is VALID [2022-04-27 13:47:50,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {6380#true} assume !(0 == ~cond); {6380#true} is VALID [2022-04-27 13:47:50,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {6380#true} ~cond := #in~cond; {6380#true} is VALID [2022-04-27 13:47:50,134 INFO L272 TraceCheckUtils]: 18: Hoare triple {6380#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6380#true} is VALID [2022-04-27 13:47:50,134 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6380#true} {6380#true} #80#return; {6380#true} is VALID [2022-04-27 13:47:50,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {6380#true} assume true; {6380#true} is VALID [2022-04-27 13:47:50,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {6380#true} assume !(0 == ~cond); {6380#true} is VALID [2022-04-27 13:47:50,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {6380#true} ~cond := #in~cond; {6380#true} is VALID [2022-04-27 13:47:50,134 INFO L272 TraceCheckUtils]: 13: Hoare triple {6380#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6380#true} is VALID [2022-04-27 13:47:50,134 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6380#true} {6380#true} #78#return; {6380#true} is VALID [2022-04-27 13:47:50,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {6380#true} assume true; {6380#true} is VALID [2022-04-27 13:47:50,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {6380#true} assume !(0 == ~cond); {6380#true} is VALID [2022-04-27 13:47:50,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {6380#true} ~cond := #in~cond; {6380#true} is VALID [2022-04-27 13:47:50,135 INFO L272 TraceCheckUtils]: 8: Hoare triple {6380#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6380#true} is VALID [2022-04-27 13:47:50,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {6380#true} assume !!(#t~post5 < 5);havoc #t~post5; {6380#true} is VALID [2022-04-27 13:47:50,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {6380#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6380#true} is VALID [2022-04-27 13:47:50,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {6380#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; {6380#true} is VALID [2022-04-27 13:47:50,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {6380#true} call #t~ret7 := main(); {6380#true} is VALID [2022-04-27 13:47:50,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6380#true} {6380#true} #92#return; {6380#true} is VALID [2022-04-27 13:47:50,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {6380#true} assume true; {6380#true} is VALID [2022-04-27 13:47:50,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {6380#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);~counter~0 := 0; {6380#true} is VALID [2022-04-27 13:47:50,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {6380#true} call ULTIMATE.init(); {6380#true} is VALID [2022-04-27 13:47:50,136 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2022-04-27 13:47:50,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:47:50,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056575296] [2022-04-27 13:47:50,136 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:47:50,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046915779] [2022-04-27 13:47:50,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046915779] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:47:50,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:47:50,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-04-27 13:47:50,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317533108] [2022-04-27 13:47:50,137 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:47:50,138 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) Word has length 73 [2022-04-27 13:47:50,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:47:50,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 13:47:50,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:50,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 13:47:50,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:47:50,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 13:47:50,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-04-27 13:47:50,210 INFO L87 Difference]: Start difference. First operand 212 states and 259 transitions. Second operand has 16 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 13:47:51,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:51,702 INFO L93 Difference]: Finished difference Result 260 states and 320 transitions. [2022-04-27 13:47:51,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 13:47:51,702 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) Word has length 73 [2022-04-27 13:47:51,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:47:51,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 13:47:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2022-04-27 13:47:51,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 13:47:51,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2022-04-27 13:47:51,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 126 transitions. [2022-04-27 13:47:51,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:51,824 INFO L225 Difference]: With dead ends: 260 [2022-04-27 13:47:51,824 INFO L226 Difference]: Without dead ends: 184 [2022-04-27 13:47:51,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-04-27 13:47:51,825 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 44 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:47:51,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 219 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 13:47:51,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-04-27 13:47:51,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 173. [2022-04-27 13:47:51,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:47:51,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand has 173 states, 114 states have (on average 1.1842105263157894) internal successors, (135), 118 states have internal predecessors, (135), 36 states have call successors, (36), 24 states have call predecessors, (36), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-27 13:47:51,897 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand has 173 states, 114 states have (on average 1.1842105263157894) internal successors, (135), 118 states have internal predecessors, (135), 36 states have call successors, (36), 24 states have call predecessors, (36), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-27 13:47:51,898 INFO L87 Difference]: Start difference. First operand 184 states. Second operand has 173 states, 114 states have (on average 1.1842105263157894) internal successors, (135), 118 states have internal predecessors, (135), 36 states have call successors, (36), 24 states have call predecessors, (36), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-27 13:47:51,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:51,902 INFO L93 Difference]: Finished difference Result 184 states and 216 transitions. [2022-04-27 13:47:51,902 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 216 transitions. [2022-04-27 13:47:51,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:51,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:51,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 114 states have (on average 1.1842105263157894) internal successors, (135), 118 states have internal predecessors, (135), 36 states have call successors, (36), 24 states have call predecessors, (36), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) Second operand 184 states. [2022-04-27 13:47:51,903 INFO L87 Difference]: Start difference. First operand has 173 states, 114 states have (on average 1.1842105263157894) internal successors, (135), 118 states have internal predecessors, (135), 36 states have call successors, (36), 24 states have call predecessors, (36), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) Second operand 184 states. [2022-04-27 13:47:51,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:51,908 INFO L93 Difference]: Finished difference Result 184 states and 216 transitions. [2022-04-27 13:47:51,908 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 216 transitions. [2022-04-27 13:47:51,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:51,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:51,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:47:51,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:47:51,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 114 states have (on average 1.1842105263157894) internal successors, (135), 118 states have internal predecessors, (135), 36 states have call successors, (36), 24 states have call predecessors, (36), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-27 13:47:51,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 204 transitions. [2022-04-27 13:47:51,914 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 204 transitions. Word has length 73 [2022-04-27 13:47:51,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:47:51,915 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 204 transitions. [2022-04-27 13:47:51,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 13:47:51,915 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 204 transitions. [2022-04-27 13:47:51,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-27 13:47:51,917 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:47:51,917 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:47:51,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 13:47:52,139 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,SelfDestructingSolverStorable11 [2022-04-27 13:47:52,140 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:47:52,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:47:52,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1894150768, now seen corresponding path program 1 times [2022-04-27 13:47:52,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:47:52,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62902573] [2022-04-27 13:47:52,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:52,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:47:52,154 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:47:52,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1828254102] [2022-04-27 13:47:52,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:52,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:47:52,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:47:52,160 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:47:52,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 13:47:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:52,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 13:47:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:52,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:47:53,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {7801#true} call ULTIMATE.init(); {7801#true} is VALID [2022-04-27 13:47:53,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {7801#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);~counter~0 := 0; {7801#true} is VALID [2022-04-27 13:47:53,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {7801#true} assume true; {7801#true} is VALID [2022-04-27 13:47:53,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7801#true} {7801#true} #92#return; {7801#true} is VALID [2022-04-27 13:47:53,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {7801#true} call #t~ret7 := main(); {7801#true} is VALID [2022-04-27 13:47:53,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {7801#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; {7821#(<= 1 main_~p~0)} is VALID [2022-04-27 13:47:53,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {7821#(<= 1 main_~p~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7821#(<= 1 main_~p~0)} is VALID [2022-04-27 13:47:53,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {7821#(<= 1 main_~p~0)} assume !!(#t~post5 < 5);havoc #t~post5; {7821#(<= 1 main_~p~0)} is VALID [2022-04-27 13:47:53,606 INFO L272 TraceCheckUtils]: 8: Hoare triple {7821#(<= 1 main_~p~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7801#true} is VALID [2022-04-27 13:47:53,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {7801#true} ~cond := #in~cond; {7801#true} is VALID [2022-04-27 13:47:53,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {7801#true} assume !(0 == ~cond); {7801#true} is VALID [2022-04-27 13:47:53,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {7801#true} assume true; {7801#true} is VALID [2022-04-27 13:47:53,606 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7801#true} {7821#(<= 1 main_~p~0)} #78#return; {7821#(<= 1 main_~p~0)} is VALID [2022-04-27 13:47:53,606 INFO L272 TraceCheckUtils]: 13: Hoare triple {7821#(<= 1 main_~p~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {7801#true} is VALID [2022-04-27 13:47:53,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {7801#true} ~cond := #in~cond; {7801#true} is VALID [2022-04-27 13:47:53,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {7801#true} assume !(0 == ~cond); {7801#true} is VALID [2022-04-27 13:47:53,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {7801#true} assume true; {7801#true} is VALID [2022-04-27 13:47:53,607 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7801#true} {7821#(<= 1 main_~p~0)} #80#return; {7821#(<= 1 main_~p~0)} is VALID [2022-04-27 13:47:53,607 INFO L272 TraceCheckUtils]: 18: Hoare triple {7821#(<= 1 main_~p~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7801#true} is VALID [2022-04-27 13:47:53,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {7801#true} ~cond := #in~cond; {7801#true} is VALID [2022-04-27 13:47:53,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {7801#true} assume !(0 == ~cond); {7801#true} is VALID [2022-04-27 13:47:53,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {7801#true} assume true; {7801#true} is VALID [2022-04-27 13:47:53,608 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7801#true} {7821#(<= 1 main_~p~0)} #82#return; {7821#(<= 1 main_~p~0)} is VALID [2022-04-27 13:47:53,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {7821#(<= 1 main_~p~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7876#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:47:53,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {7876#(<= 1 (div main_~p~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7876#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:47:53,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {7876#(<= 1 (div main_~p~0 2))} assume !!(#t~post5 < 5);havoc #t~post5; {7876#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:47:53,610 INFO L272 TraceCheckUtils]: 26: Hoare triple {7876#(<= 1 (div main_~p~0 2))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7801#true} is VALID [2022-04-27 13:47:53,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {7801#true} ~cond := #in~cond; {7801#true} is VALID [2022-04-27 13:47:53,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {7801#true} assume !(0 == ~cond); {7801#true} is VALID [2022-04-27 13:47:53,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {7801#true} assume true; {7801#true} is VALID [2022-04-27 13:47:53,610 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {7801#true} {7876#(<= 1 (div main_~p~0 2))} #78#return; {7876#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:47:53,611 INFO L272 TraceCheckUtils]: 31: Hoare triple {7876#(<= 1 (div main_~p~0 2))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {7801#true} is VALID [2022-04-27 13:47:53,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {7801#true} ~cond := #in~cond; {7801#true} is VALID [2022-04-27 13:47:53,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {7801#true} assume !(0 == ~cond); {7801#true} is VALID [2022-04-27 13:47:53,611 INFO L290 TraceCheckUtils]: 34: Hoare triple {7801#true} assume true; {7801#true} is VALID [2022-04-27 13:47:53,611 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {7801#true} {7876#(<= 1 (div main_~p~0 2))} #80#return; {7876#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:47:53,611 INFO L272 TraceCheckUtils]: 36: Hoare triple {7876#(<= 1 (div main_~p~0 2))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7801#true} is VALID [2022-04-27 13:47:53,611 INFO L290 TraceCheckUtils]: 37: Hoare triple {7801#true} ~cond := #in~cond; {7801#true} is VALID [2022-04-27 13:47:53,612 INFO L290 TraceCheckUtils]: 38: Hoare triple {7801#true} assume !(0 == ~cond); {7801#true} is VALID [2022-04-27 13:47:53,612 INFO L290 TraceCheckUtils]: 39: Hoare triple {7801#true} assume true; {7801#true} is VALID [2022-04-27 13:47:53,612 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7801#true} {7876#(<= 1 (div main_~p~0 2))} #82#return; {7876#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:47:53,613 INFO L290 TraceCheckUtils]: 41: Hoare triple {7876#(<= 1 (div main_~p~0 2))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7931#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:47:53,613 INFO L290 TraceCheckUtils]: 42: Hoare triple {7931#(<= 1 (div (div main_~p~0 2) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7931#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:47:53,614 INFO L290 TraceCheckUtils]: 43: Hoare triple {7931#(<= 1 (div (div main_~p~0 2) 2))} assume !!(#t~post5 < 5);havoc #t~post5; {7931#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:47:53,614 INFO L272 TraceCheckUtils]: 44: Hoare triple {7931#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7801#true} is VALID [2022-04-27 13:47:53,614 INFO L290 TraceCheckUtils]: 45: Hoare triple {7801#true} ~cond := #in~cond; {7801#true} is VALID [2022-04-27 13:47:53,614 INFO L290 TraceCheckUtils]: 46: Hoare triple {7801#true} assume !(0 == ~cond); {7801#true} is VALID [2022-04-27 13:47:53,614 INFO L290 TraceCheckUtils]: 47: Hoare triple {7801#true} assume true; {7801#true} is VALID [2022-04-27 13:47:53,614 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {7801#true} {7931#(<= 1 (div (div main_~p~0 2) 2))} #78#return; {7931#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:47:53,615 INFO L272 TraceCheckUtils]: 49: Hoare triple {7931#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {7801#true} is VALID [2022-04-27 13:47:53,615 INFO L290 TraceCheckUtils]: 50: Hoare triple {7801#true} ~cond := #in~cond; {7801#true} is VALID [2022-04-27 13:47:53,615 INFO L290 TraceCheckUtils]: 51: Hoare triple {7801#true} assume !(0 == ~cond); {7801#true} is VALID [2022-04-27 13:47:53,615 INFO L290 TraceCheckUtils]: 52: Hoare triple {7801#true} assume true; {7801#true} is VALID [2022-04-27 13:47:53,615 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {7801#true} {7931#(<= 1 (div (div main_~p~0 2) 2))} #80#return; {7931#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:47:53,615 INFO L272 TraceCheckUtils]: 54: Hoare triple {7931#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7801#true} is VALID [2022-04-27 13:47:53,616 INFO L290 TraceCheckUtils]: 55: Hoare triple {7801#true} ~cond := #in~cond; {7801#true} is VALID [2022-04-27 13:47:53,616 INFO L290 TraceCheckUtils]: 56: Hoare triple {7801#true} assume !(0 == ~cond); {7801#true} is VALID [2022-04-27 13:47:53,616 INFO L290 TraceCheckUtils]: 57: Hoare triple {7801#true} assume true; {7801#true} is VALID [2022-04-27 13:47:53,616 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7801#true} {7931#(<= 1 (div (div main_~p~0 2) 2))} #82#return; {7931#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:47:53,617 INFO L290 TraceCheckUtils]: 59: Hoare triple {7931#(<= 1 (div (div main_~p~0 2) 2))} assume !(~r~0 >= ~d~0); {7931#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:47:53,617 INFO L290 TraceCheckUtils]: 60: Hoare triple {7931#(<= 1 (div (div main_~p~0 2) 2))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7931#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:47:53,617 INFO L290 TraceCheckUtils]: 61: Hoare triple {7931#(<= 1 (div (div main_~p~0 2) 2))} assume !!(#t~post6 < 5);havoc #t~post6; {7931#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:47:53,617 INFO L272 TraceCheckUtils]: 62: Hoare triple {7931#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7801#true} is VALID [2022-04-27 13:47:53,617 INFO L290 TraceCheckUtils]: 63: Hoare triple {7801#true} ~cond := #in~cond; {7801#true} is VALID [2022-04-27 13:47:53,618 INFO L290 TraceCheckUtils]: 64: Hoare triple {7801#true} assume !(0 == ~cond); {7801#true} is VALID [2022-04-27 13:47:53,618 INFO L290 TraceCheckUtils]: 65: Hoare triple {7801#true} assume true; {7801#true} is VALID [2022-04-27 13:47:53,618 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7801#true} {7931#(<= 1 (div (div main_~p~0 2) 2))} #84#return; {7931#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:47:53,618 INFO L272 TraceCheckUtils]: 67: Hoare triple {7931#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7801#true} is VALID [2022-04-27 13:47:53,618 INFO L290 TraceCheckUtils]: 68: Hoare triple {7801#true} ~cond := #in~cond; {7801#true} is VALID [2022-04-27 13:47:53,619 INFO L290 TraceCheckUtils]: 69: Hoare triple {7801#true} assume !(0 == ~cond); {7801#true} is VALID [2022-04-27 13:47:53,619 INFO L290 TraceCheckUtils]: 70: Hoare triple {7801#true} assume true; {7801#true} is VALID [2022-04-27 13:47:53,619 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7801#true} {7931#(<= 1 (div (div main_~p~0 2) 2))} #86#return; {7931#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:47:53,619 INFO L290 TraceCheckUtils]: 72: Hoare triple {7931#(<= 1 (div (div main_~p~0 2) 2))} assume !(1 != ~p~0); {7802#false} is VALID [2022-04-27 13:47:53,620 INFO L272 TraceCheckUtils]: 73: Hoare triple {7802#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {7802#false} is VALID [2022-04-27 13:47:53,620 INFO L290 TraceCheckUtils]: 74: Hoare triple {7802#false} ~cond := #in~cond; {7802#false} is VALID [2022-04-27 13:47:53,620 INFO L290 TraceCheckUtils]: 75: Hoare triple {7802#false} assume !(0 == ~cond); {7802#false} is VALID [2022-04-27 13:47:53,620 INFO L290 TraceCheckUtils]: 76: Hoare triple {7802#false} assume true; {7802#false} is VALID [2022-04-27 13:47:53,620 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {7802#false} {7802#false} #88#return; {7802#false} is VALID [2022-04-27 13:47:53,620 INFO L272 TraceCheckUtils]: 78: Hoare triple {7802#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {7802#false} is VALID [2022-04-27 13:47:53,620 INFO L290 TraceCheckUtils]: 79: Hoare triple {7802#false} ~cond := #in~cond; {7802#false} is VALID [2022-04-27 13:47:53,620 INFO L290 TraceCheckUtils]: 80: Hoare triple {7802#false} assume 0 == ~cond; {7802#false} is VALID [2022-04-27 13:47:53,620 INFO L290 TraceCheckUtils]: 81: Hoare triple {7802#false} assume !false; {7802#false} is VALID [2022-04-27 13:47:53,621 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-27 13:47:53,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:47:53,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:47:53,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62902573] [2022-04-27 13:47:53,621 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:47:53,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828254102] [2022-04-27 13:47:53,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828254102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:47:53,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:47:53,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:47:53,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331375510] [2022-04-27 13:47:53,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:47:53,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 82 [2022-04-27 13:47:53,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:47:53,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-27 13:47:53,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:53,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:47:53,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:47:53,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:47:53,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:47:53,670 INFO L87 Difference]: Start difference. First operand 173 states and 204 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-27 13:47:53,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:53,912 INFO L93 Difference]: Finished difference Result 192 states and 227 transitions. [2022-04-27 13:47:53,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:47:53,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 82 [2022-04-27 13:47:53,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:47:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-27 13:47:53,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-04-27 13:47:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-27 13:47:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-04-27 13:47:53,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 88 transitions. [2022-04-27 13:47:53,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:53,998 INFO L225 Difference]: With dead ends: 192 [2022-04-27 13:47:53,998 INFO L226 Difference]: Without dead ends: 172 [2022-04-27 13:47:53,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:47:53,999 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:47:53,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 85 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:47:54,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-04-27 13:47:54,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 167. [2022-04-27 13:47:54,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:47:54,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 167 states, 111 states have (on average 1.1711711711711712) internal successors, (130), 113 states have internal predecessors, (130), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:47:54,088 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 167 states, 111 states have (on average 1.1711711711711712) internal successors, (130), 113 states have internal predecessors, (130), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:47:54,090 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 167 states, 111 states have (on average 1.1711711711711712) internal successors, (130), 113 states have internal predecessors, (130), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:47:54,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:54,101 INFO L93 Difference]: Finished difference Result 172 states and 204 transitions. [2022-04-27 13:47:54,101 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 204 transitions. [2022-04-27 13:47:54,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:54,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:54,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 111 states have (on average 1.1711711711711712) internal successors, (130), 113 states have internal predecessors, (130), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) Second operand 172 states. [2022-04-27 13:47:54,103 INFO L87 Difference]: Start difference. First operand has 167 states, 111 states have (on average 1.1711711711711712) internal successors, (130), 113 states have internal predecessors, (130), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) Second operand 172 states. [2022-04-27 13:47:54,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:54,109 INFO L93 Difference]: Finished difference Result 172 states and 204 transitions. [2022-04-27 13:47:54,109 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 204 transitions. [2022-04-27 13:47:54,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:54,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:54,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:47:54,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:47:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 111 states have (on average 1.1711711711711712) internal successors, (130), 113 states have internal predecessors, (130), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:47:54,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 196 transitions. [2022-04-27 13:47:54,121 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 196 transitions. Word has length 82 [2022-04-27 13:47:54,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:47:54,121 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 196 transitions. [2022-04-27 13:47:54,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-27 13:47:54,122 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 196 transitions. [2022-04-27 13:47:54,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-27 13:47:54,123 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:47:54,123 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:47:54,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-27 13:47:54,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 13:47:54,340 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:47:54,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:47:54,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1432051402, now seen corresponding path program 2 times [2022-04-27 13:47:54,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:47:54,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269104878] [2022-04-27 13:47:54,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:54,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:47:54,352 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:47:54,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1707628305] [2022-04-27 13:47:54,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:47:54,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:47:54,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:47:54,353 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:47:54,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 13:47:54,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:47:54,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:47:54,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:47:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:54,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:47:54,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {8889#true} call ULTIMATE.init(); {8889#true} is VALID [2022-04-27 13:47:54,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {8889#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);~counter~0 := 0; {8897#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:54,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {8897#(<= ~counter~0 0)} assume true; {8897#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:54,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8897#(<= ~counter~0 0)} {8889#true} #92#return; {8897#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:54,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {8897#(<= ~counter~0 0)} call #t~ret7 := main(); {8897#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:54,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {8897#(<= ~counter~0 0)} 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; {8897#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:54,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {8897#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:54,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {8913#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:54,776 INFO L272 TraceCheckUtils]: 8: Hoare triple {8913#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:54,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {8913#(<= ~counter~0 1)} ~cond := #in~cond; {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:54,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {8913#(<= ~counter~0 1)} assume !(0 == ~cond); {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:54,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {8913#(<= ~counter~0 1)} assume true; {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:54,778 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8913#(<= ~counter~0 1)} {8913#(<= ~counter~0 1)} #78#return; {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:54,778 INFO L272 TraceCheckUtils]: 13: Hoare triple {8913#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:54,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {8913#(<= ~counter~0 1)} ~cond := #in~cond; {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:54,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {8913#(<= ~counter~0 1)} assume !(0 == ~cond); {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:54,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {8913#(<= ~counter~0 1)} assume true; {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:54,780 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8913#(<= ~counter~0 1)} {8913#(<= ~counter~0 1)} #80#return; {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:54,784 INFO L272 TraceCheckUtils]: 18: Hoare triple {8913#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:54,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {8913#(<= ~counter~0 1)} ~cond := #in~cond; {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:54,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {8913#(<= ~counter~0 1)} assume !(0 == ~cond); {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:54,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {8913#(<= ~counter~0 1)} assume true; {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:54,786 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8913#(<= ~counter~0 1)} {8913#(<= ~counter~0 1)} #82#return; {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:54,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {8913#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:54,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {8913#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:54,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {8968#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:54,787 INFO L272 TraceCheckUtils]: 26: Hoare triple {8968#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:54,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {8968#(<= ~counter~0 2)} ~cond := #in~cond; {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:54,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {8968#(<= ~counter~0 2)} assume !(0 == ~cond); {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:54,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {8968#(<= ~counter~0 2)} assume true; {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:54,788 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {8968#(<= ~counter~0 2)} {8968#(<= ~counter~0 2)} #78#return; {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:54,789 INFO L272 TraceCheckUtils]: 31: Hoare triple {8968#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:54,789 INFO L290 TraceCheckUtils]: 32: Hoare triple {8968#(<= ~counter~0 2)} ~cond := #in~cond; {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:54,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {8968#(<= ~counter~0 2)} assume !(0 == ~cond); {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:54,789 INFO L290 TraceCheckUtils]: 34: Hoare triple {8968#(<= ~counter~0 2)} assume true; {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:54,790 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8968#(<= ~counter~0 2)} {8968#(<= ~counter~0 2)} #80#return; {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:54,790 INFO L272 TraceCheckUtils]: 36: Hoare triple {8968#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:54,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {8968#(<= ~counter~0 2)} ~cond := #in~cond; {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:54,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {8968#(<= ~counter~0 2)} assume !(0 == ~cond); {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:54,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {8968#(<= ~counter~0 2)} assume true; {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:54,791 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8968#(<= ~counter~0 2)} {8968#(<= ~counter~0 2)} #82#return; {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:54,792 INFO L290 TraceCheckUtils]: 41: Hoare triple {8968#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:54,806 INFO L290 TraceCheckUtils]: 42: Hoare triple {8968#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:54,807 INFO L290 TraceCheckUtils]: 43: Hoare triple {9023#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:54,807 INFO L272 TraceCheckUtils]: 44: Hoare triple {9023#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:54,807 INFO L290 TraceCheckUtils]: 45: Hoare triple {9023#(<= ~counter~0 3)} ~cond := #in~cond; {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:54,810 INFO L290 TraceCheckUtils]: 46: Hoare triple {9023#(<= ~counter~0 3)} assume !(0 == ~cond); {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:54,810 INFO L290 TraceCheckUtils]: 47: Hoare triple {9023#(<= ~counter~0 3)} assume true; {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:54,811 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9023#(<= ~counter~0 3)} {9023#(<= ~counter~0 3)} #78#return; {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:54,811 INFO L272 TraceCheckUtils]: 49: Hoare triple {9023#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:54,811 INFO L290 TraceCheckUtils]: 50: Hoare triple {9023#(<= ~counter~0 3)} ~cond := #in~cond; {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:54,812 INFO L290 TraceCheckUtils]: 51: Hoare triple {9023#(<= ~counter~0 3)} assume !(0 == ~cond); {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:54,812 INFO L290 TraceCheckUtils]: 52: Hoare triple {9023#(<= ~counter~0 3)} assume true; {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:54,812 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9023#(<= ~counter~0 3)} {9023#(<= ~counter~0 3)} #80#return; {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:54,813 INFO L272 TraceCheckUtils]: 54: Hoare triple {9023#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:54,813 INFO L290 TraceCheckUtils]: 55: Hoare triple {9023#(<= ~counter~0 3)} ~cond := #in~cond; {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:54,814 INFO L290 TraceCheckUtils]: 56: Hoare triple {9023#(<= ~counter~0 3)} assume !(0 == ~cond); {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:54,814 INFO L290 TraceCheckUtils]: 57: Hoare triple {9023#(<= ~counter~0 3)} assume true; {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:54,814 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9023#(<= ~counter~0 3)} {9023#(<= ~counter~0 3)} #82#return; {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:54,815 INFO L290 TraceCheckUtils]: 59: Hoare triple {9023#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:54,815 INFO L290 TraceCheckUtils]: 60: Hoare triple {9023#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:54,815 INFO L290 TraceCheckUtils]: 61: Hoare triple {9078#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:54,816 INFO L272 TraceCheckUtils]: 62: Hoare triple {9078#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:54,816 INFO L290 TraceCheckUtils]: 63: Hoare triple {9078#(<= ~counter~0 4)} ~cond := #in~cond; {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:54,816 INFO L290 TraceCheckUtils]: 64: Hoare triple {9078#(<= ~counter~0 4)} assume !(0 == ~cond); {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:54,817 INFO L290 TraceCheckUtils]: 65: Hoare triple {9078#(<= ~counter~0 4)} assume true; {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:54,817 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9078#(<= ~counter~0 4)} {9078#(<= ~counter~0 4)} #78#return; {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:54,817 INFO L272 TraceCheckUtils]: 67: Hoare triple {9078#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:54,818 INFO L290 TraceCheckUtils]: 68: Hoare triple {9078#(<= ~counter~0 4)} ~cond := #in~cond; {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:54,818 INFO L290 TraceCheckUtils]: 69: Hoare triple {9078#(<= ~counter~0 4)} assume !(0 == ~cond); {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:54,819 INFO L290 TraceCheckUtils]: 70: Hoare triple {9078#(<= ~counter~0 4)} assume true; {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:54,820 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9078#(<= ~counter~0 4)} {9078#(<= ~counter~0 4)} #80#return; {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:54,820 INFO L272 TraceCheckUtils]: 72: Hoare triple {9078#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:54,821 INFO L290 TraceCheckUtils]: 73: Hoare triple {9078#(<= ~counter~0 4)} ~cond := #in~cond; {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:54,821 INFO L290 TraceCheckUtils]: 74: Hoare triple {9078#(<= ~counter~0 4)} assume !(0 == ~cond); {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:54,821 INFO L290 TraceCheckUtils]: 75: Hoare triple {9078#(<= ~counter~0 4)} assume true; {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:54,822 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {9078#(<= ~counter~0 4)} {9078#(<= ~counter~0 4)} #82#return; {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:54,822 INFO L290 TraceCheckUtils]: 77: Hoare triple {9078#(<= ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:54,823 INFO L290 TraceCheckUtils]: 78: Hoare triple {9078#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9133#(<= |main_#t~post5| 4)} is VALID [2022-04-27 13:47:54,823 INFO L290 TraceCheckUtils]: 79: Hoare triple {9133#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {8890#false} is VALID [2022-04-27 13:47:54,823 INFO L290 TraceCheckUtils]: 80: Hoare triple {8890#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8890#false} is VALID [2022-04-27 13:47:54,823 INFO L290 TraceCheckUtils]: 81: Hoare triple {8890#false} assume !(#t~post6 < 5);havoc #t~post6; {8890#false} is VALID [2022-04-27 13:47:54,823 INFO L272 TraceCheckUtils]: 82: Hoare triple {8890#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {8890#false} is VALID [2022-04-27 13:47:54,823 INFO L290 TraceCheckUtils]: 83: Hoare triple {8890#false} ~cond := #in~cond; {8890#false} is VALID [2022-04-27 13:47:54,824 INFO L290 TraceCheckUtils]: 84: Hoare triple {8890#false} assume !(0 == ~cond); {8890#false} is VALID [2022-04-27 13:47:54,824 INFO L290 TraceCheckUtils]: 85: Hoare triple {8890#false} assume true; {8890#false} is VALID [2022-04-27 13:47:54,824 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {8890#false} {8890#false} #88#return; {8890#false} is VALID [2022-04-27 13:47:54,824 INFO L272 TraceCheckUtils]: 87: Hoare triple {8890#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {8890#false} is VALID [2022-04-27 13:47:54,824 INFO L290 TraceCheckUtils]: 88: Hoare triple {8890#false} ~cond := #in~cond; {8890#false} is VALID [2022-04-27 13:47:54,824 INFO L290 TraceCheckUtils]: 89: Hoare triple {8890#false} assume 0 == ~cond; {8890#false} is VALID [2022-04-27 13:47:54,824 INFO L290 TraceCheckUtils]: 90: Hoare triple {8890#false} assume !false; {8890#false} is VALID [2022-04-27 13:47:54,825 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 72 proven. 260 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-04-27 13:47:54,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:47:55,181 INFO L290 TraceCheckUtils]: 90: Hoare triple {8890#false} assume !false; {8890#false} is VALID [2022-04-27 13:47:55,181 INFO L290 TraceCheckUtils]: 89: Hoare triple {8890#false} assume 0 == ~cond; {8890#false} is VALID [2022-04-27 13:47:55,181 INFO L290 TraceCheckUtils]: 88: Hoare triple {8890#false} ~cond := #in~cond; {8890#false} is VALID [2022-04-27 13:47:55,181 INFO L272 TraceCheckUtils]: 87: Hoare triple {8890#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {8890#false} is VALID [2022-04-27 13:47:55,182 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {8889#true} {8890#false} #88#return; {8890#false} is VALID [2022-04-27 13:47:55,182 INFO L290 TraceCheckUtils]: 85: Hoare triple {8889#true} assume true; {8889#true} is VALID [2022-04-27 13:47:55,182 INFO L290 TraceCheckUtils]: 84: Hoare triple {8889#true} assume !(0 == ~cond); {8889#true} is VALID [2022-04-27 13:47:55,182 INFO L290 TraceCheckUtils]: 83: Hoare triple {8889#true} ~cond := #in~cond; {8889#true} is VALID [2022-04-27 13:47:55,182 INFO L272 TraceCheckUtils]: 82: Hoare triple {8890#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {8889#true} is VALID [2022-04-27 13:47:55,182 INFO L290 TraceCheckUtils]: 81: Hoare triple {8890#false} assume !(#t~post6 < 5);havoc #t~post6; {8890#false} is VALID [2022-04-27 13:47:55,182 INFO L290 TraceCheckUtils]: 80: Hoare triple {8890#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8890#false} is VALID [2022-04-27 13:47:55,182 INFO L290 TraceCheckUtils]: 79: Hoare triple {9133#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {8890#false} is VALID [2022-04-27 13:47:55,183 INFO L290 TraceCheckUtils]: 78: Hoare triple {9078#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9133#(<= |main_#t~post5| 4)} is VALID [2022-04-27 13:47:55,183 INFO L290 TraceCheckUtils]: 77: Hoare triple {9078#(<= ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:55,183 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8889#true} {9078#(<= ~counter~0 4)} #82#return; {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:55,184 INFO L290 TraceCheckUtils]: 75: Hoare triple {8889#true} assume true; {8889#true} is VALID [2022-04-27 13:47:55,184 INFO L290 TraceCheckUtils]: 74: Hoare triple {8889#true} assume !(0 == ~cond); {8889#true} is VALID [2022-04-27 13:47:55,184 INFO L290 TraceCheckUtils]: 73: Hoare triple {8889#true} ~cond := #in~cond; {8889#true} is VALID [2022-04-27 13:47:55,184 INFO L272 TraceCheckUtils]: 72: Hoare triple {9078#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8889#true} is VALID [2022-04-27 13:47:55,184 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8889#true} {9078#(<= ~counter~0 4)} #80#return; {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:55,184 INFO L290 TraceCheckUtils]: 70: Hoare triple {8889#true} assume true; {8889#true} is VALID [2022-04-27 13:47:55,184 INFO L290 TraceCheckUtils]: 69: Hoare triple {8889#true} assume !(0 == ~cond); {8889#true} is VALID [2022-04-27 13:47:55,184 INFO L290 TraceCheckUtils]: 68: Hoare triple {8889#true} ~cond := #in~cond; {8889#true} is VALID [2022-04-27 13:47:55,184 INFO L272 TraceCheckUtils]: 67: Hoare triple {9078#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8889#true} is VALID [2022-04-27 13:47:55,185 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8889#true} {9078#(<= ~counter~0 4)} #78#return; {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:55,185 INFO L290 TraceCheckUtils]: 65: Hoare triple {8889#true} assume true; {8889#true} is VALID [2022-04-27 13:47:55,185 INFO L290 TraceCheckUtils]: 64: Hoare triple {8889#true} assume !(0 == ~cond); {8889#true} is VALID [2022-04-27 13:47:55,185 INFO L290 TraceCheckUtils]: 63: Hoare triple {8889#true} ~cond := #in~cond; {8889#true} is VALID [2022-04-27 13:47:55,185 INFO L272 TraceCheckUtils]: 62: Hoare triple {9078#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8889#true} is VALID [2022-04-27 13:47:55,185 INFO L290 TraceCheckUtils]: 61: Hoare triple {9078#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:55,186 INFO L290 TraceCheckUtils]: 60: Hoare triple {9023#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9078#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:55,186 INFO L290 TraceCheckUtils]: 59: Hoare triple {9023#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:55,187 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8889#true} {9023#(<= ~counter~0 3)} #82#return; {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:55,187 INFO L290 TraceCheckUtils]: 57: Hoare triple {8889#true} assume true; {8889#true} is VALID [2022-04-27 13:47:55,187 INFO L290 TraceCheckUtils]: 56: Hoare triple {8889#true} assume !(0 == ~cond); {8889#true} is VALID [2022-04-27 13:47:55,187 INFO L290 TraceCheckUtils]: 55: Hoare triple {8889#true} ~cond := #in~cond; {8889#true} is VALID [2022-04-27 13:47:55,187 INFO L272 TraceCheckUtils]: 54: Hoare triple {9023#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8889#true} is VALID [2022-04-27 13:47:55,187 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {8889#true} {9023#(<= ~counter~0 3)} #80#return; {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:55,188 INFO L290 TraceCheckUtils]: 52: Hoare triple {8889#true} assume true; {8889#true} is VALID [2022-04-27 13:47:55,188 INFO L290 TraceCheckUtils]: 51: Hoare triple {8889#true} assume !(0 == ~cond); {8889#true} is VALID [2022-04-27 13:47:55,188 INFO L290 TraceCheckUtils]: 50: Hoare triple {8889#true} ~cond := #in~cond; {8889#true} is VALID [2022-04-27 13:47:55,188 INFO L272 TraceCheckUtils]: 49: Hoare triple {9023#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8889#true} is VALID [2022-04-27 13:47:55,195 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {8889#true} {9023#(<= ~counter~0 3)} #78#return; {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:55,196 INFO L290 TraceCheckUtils]: 47: Hoare triple {8889#true} assume true; {8889#true} is VALID [2022-04-27 13:47:55,196 INFO L290 TraceCheckUtils]: 46: Hoare triple {8889#true} assume !(0 == ~cond); {8889#true} is VALID [2022-04-27 13:47:55,196 INFO L290 TraceCheckUtils]: 45: Hoare triple {8889#true} ~cond := #in~cond; {8889#true} is VALID [2022-04-27 13:47:55,196 INFO L272 TraceCheckUtils]: 44: Hoare triple {9023#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8889#true} is VALID [2022-04-27 13:47:55,196 INFO L290 TraceCheckUtils]: 43: Hoare triple {9023#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:55,197 INFO L290 TraceCheckUtils]: 42: Hoare triple {8968#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9023#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:55,197 INFO L290 TraceCheckUtils]: 41: Hoare triple {8968#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:55,198 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8889#true} {8968#(<= ~counter~0 2)} #82#return; {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:55,198 INFO L290 TraceCheckUtils]: 39: Hoare triple {8889#true} assume true; {8889#true} is VALID [2022-04-27 13:47:55,204 INFO L290 TraceCheckUtils]: 38: Hoare triple {8889#true} assume !(0 == ~cond); {8889#true} is VALID [2022-04-27 13:47:55,204 INFO L290 TraceCheckUtils]: 37: Hoare triple {8889#true} ~cond := #in~cond; {8889#true} is VALID [2022-04-27 13:47:55,204 INFO L272 TraceCheckUtils]: 36: Hoare triple {8968#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8889#true} is VALID [2022-04-27 13:47:55,205 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8889#true} {8968#(<= ~counter~0 2)} #80#return; {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:55,205 INFO L290 TraceCheckUtils]: 34: Hoare triple {8889#true} assume true; {8889#true} is VALID [2022-04-27 13:47:55,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {8889#true} assume !(0 == ~cond); {8889#true} is VALID [2022-04-27 13:47:55,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {8889#true} ~cond := #in~cond; {8889#true} is VALID [2022-04-27 13:47:55,205 INFO L272 TraceCheckUtils]: 31: Hoare triple {8968#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8889#true} is VALID [2022-04-27 13:47:55,206 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {8889#true} {8968#(<= ~counter~0 2)} #78#return; {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:55,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {8889#true} assume true; {8889#true} is VALID [2022-04-27 13:47:55,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {8889#true} assume !(0 == ~cond); {8889#true} is VALID [2022-04-27 13:47:55,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {8889#true} ~cond := #in~cond; {8889#true} is VALID [2022-04-27 13:47:55,206 INFO L272 TraceCheckUtils]: 26: Hoare triple {8968#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8889#true} is VALID [2022-04-27 13:47:55,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {8968#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:55,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {8913#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8968#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:55,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {8913#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:55,208 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8889#true} {8913#(<= ~counter~0 1)} #82#return; {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:55,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {8889#true} assume true; {8889#true} is VALID [2022-04-27 13:47:55,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {8889#true} assume !(0 == ~cond); {8889#true} is VALID [2022-04-27 13:47:55,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {8889#true} ~cond := #in~cond; {8889#true} is VALID [2022-04-27 13:47:55,208 INFO L272 TraceCheckUtils]: 18: Hoare triple {8913#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8889#true} is VALID [2022-04-27 13:47:55,209 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8889#true} {8913#(<= ~counter~0 1)} #80#return; {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:55,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {8889#true} assume true; {8889#true} is VALID [2022-04-27 13:47:55,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {8889#true} assume !(0 == ~cond); {8889#true} is VALID [2022-04-27 13:47:55,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {8889#true} ~cond := #in~cond; {8889#true} is VALID [2022-04-27 13:47:55,209 INFO L272 TraceCheckUtils]: 13: Hoare triple {8913#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8889#true} is VALID [2022-04-27 13:47:55,209 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8889#true} {8913#(<= ~counter~0 1)} #78#return; {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:55,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {8889#true} assume true; {8889#true} is VALID [2022-04-27 13:47:55,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {8889#true} assume !(0 == ~cond); {8889#true} is VALID [2022-04-27 13:47:55,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {8889#true} ~cond := #in~cond; {8889#true} is VALID [2022-04-27 13:47:55,210 INFO L272 TraceCheckUtils]: 8: Hoare triple {8913#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8889#true} is VALID [2022-04-27 13:47:55,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {8913#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:55,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {8897#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8913#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:55,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {8897#(<= ~counter~0 0)} 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; {8897#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:55,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {8897#(<= ~counter~0 0)} call #t~ret7 := main(); {8897#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:55,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8897#(<= ~counter~0 0)} {8889#true} #92#return; {8897#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:55,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {8897#(<= ~counter~0 0)} assume true; {8897#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:55,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {8889#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);~counter~0 := 0; {8897#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:55,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {8889#true} call ULTIMATE.init(); {8889#true} is VALID [2022-04-27 13:47:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-27 13:47:55,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:47:55,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269104878] [2022-04-27 13:47:55,213 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:47:55,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707628305] [2022-04-27 13:47:55,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707628305] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:47:55,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:47:55,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-27 13:47:55,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037134153] [2022-04-27 13:47:55,214 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:47:55,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 7 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) Word has length 91 [2022-04-27 13:47:55,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:47:55,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 7 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) [2022-04-27 13:47:55,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:55,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 13:47:55,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:47:55,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 13:47:55,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:47:55,420 INFO L87 Difference]: Start difference. First operand 167 states and 196 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 7 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) [2022-04-27 13:47:55,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:55,728 INFO L93 Difference]: Finished difference Result 228 states and 280 transitions. [2022-04-27 13:47:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 13:47:55,728 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 7 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) Word has length 91 [2022-04-27 13:47:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:47:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 7 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) [2022-04-27 13:47:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 118 transitions. [2022-04-27 13:47:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 7 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) [2022-04-27 13:47:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 118 transitions. [2022-04-27 13:47:55,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 118 transitions. [2022-04-27 13:47:55,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:55,832 INFO L225 Difference]: With dead ends: 228 [2022-04-27 13:47:55,833 INFO L226 Difference]: Without dead ends: 169 [2022-04-27 13:47:55,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:47:55,833 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 15 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:47:55,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 180 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:47:55,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-04-27 13:47:55,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-04-27 13:47:55,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:47:55,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 169 states, 113 states have (on average 1.168141592920354) internal successors, (132), 115 states have internal predecessors, (132), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:47:55,947 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 169 states, 113 states have (on average 1.168141592920354) internal successors, (132), 115 states have internal predecessors, (132), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:47:55,948 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 169 states, 113 states have (on average 1.168141592920354) internal successors, (132), 115 states have internal predecessors, (132), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:47:55,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:55,951 INFO L93 Difference]: Finished difference Result 169 states and 198 transitions. [2022-04-27 13:47:55,951 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 198 transitions. [2022-04-27 13:47:55,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:55,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:55,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 113 states have (on average 1.168141592920354) internal successors, (132), 115 states have internal predecessors, (132), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) Second operand 169 states. [2022-04-27 13:47:55,952 INFO L87 Difference]: Start difference. First operand has 169 states, 113 states have (on average 1.168141592920354) internal successors, (132), 115 states have internal predecessors, (132), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) Second operand 169 states. [2022-04-27 13:47:55,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:55,956 INFO L93 Difference]: Finished difference Result 169 states and 198 transitions. [2022-04-27 13:47:55,956 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 198 transitions. [2022-04-27 13:47:55,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:55,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:55,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:47:55,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:47:55,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 113 states have (on average 1.168141592920354) internal successors, (132), 115 states have internal predecessors, (132), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:47:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 198 transitions. [2022-04-27 13:47:55,961 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 198 transitions. Word has length 91 [2022-04-27 13:47:55,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:47:55,961 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 198 transitions. [2022-04-27 13:47:55,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 7 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) [2022-04-27 13:47:55,961 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 198 transitions. [2022-04-27 13:47:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-27 13:47:55,962 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:47:55,962 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:47:55,986 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-27 13:47:56,177 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,SelfDestructingSolverStorable13 [2022-04-27 13:47:56,178 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:47:56,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:47:56,178 INFO L85 PathProgramCache]: Analyzing trace with hash -614243194, now seen corresponding path program 1 times [2022-04-27 13:47:56,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:47:56,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465287258] [2022-04-27 13:47:56,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:56,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:47:56,190 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:47:56,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [217494183] [2022-04-27 13:47:56,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:56,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:47:56,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:47:56,192 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-27 13:47:56,199 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-27 13:47:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:56,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-27 13:47:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:56,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:47:56,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {10329#true} call ULTIMATE.init(); {10329#true} is VALID [2022-04-27 13:47:56,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {10329#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);~counter~0 := 0; {10329#true} is VALID [2022-04-27 13:47:56,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:47:56,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10329#true} {10329#true} #92#return; {10329#true} is VALID [2022-04-27 13:47:56,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {10329#true} call #t~ret7 := main(); {10329#true} is VALID [2022-04-27 13:47:56,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {10329#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; {10349#(and (= main_~A~0 main_~r~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:47:56,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {10349#(and (= main_~A~0 main_~r~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10349#(and (= main_~A~0 main_~r~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:47:56,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {10349#(and (= main_~A~0 main_~r~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {10349#(and (= main_~A~0 main_~r~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:47:56,854 INFO L272 TraceCheckUtils]: 8: Hoare triple {10349#(and (= main_~A~0 main_~r~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:47:56,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:47:56,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:47:56,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:47:56,855 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10329#true} {10349#(and (= main_~A~0 main_~r~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~p~0 1))} #78#return; {10349#(and (= main_~A~0 main_~r~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:47:56,855 INFO L272 TraceCheckUtils]: 13: Hoare triple {10349#(and (= main_~A~0 main_~r~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:47:56,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:47:56,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:47:56,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:47:56,856 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10329#true} {10349#(and (= main_~A~0 main_~r~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~p~0 1))} #80#return; {10349#(and (= main_~A~0 main_~r~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:47:56,856 INFO L272 TraceCheckUtils]: 18: Hoare triple {10349#(and (= main_~A~0 main_~r~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:47:56,856 INFO L290 TraceCheckUtils]: 19: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:47:56,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:47:56,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:47:56,856 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10329#true} {10349#(and (= main_~A~0 main_~r~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~p~0 1))} #82#return; {10349#(and (= main_~A~0 main_~r~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:47:56,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {10349#(and (= main_~A~0 main_~r~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10404#(and (= main_~A~0 main_~r~0) (= main_~p~0 2) (= main_~d~0 2) (= main_~q~0 0))} is VALID [2022-04-27 13:47:56,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {10404#(and (= main_~A~0 main_~r~0) (= main_~p~0 2) (= main_~d~0 2) (= main_~q~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10404#(and (= main_~A~0 main_~r~0) (= main_~p~0 2) (= main_~d~0 2) (= main_~q~0 0))} is VALID [2022-04-27 13:47:56,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {10404#(and (= main_~A~0 main_~r~0) (= main_~p~0 2) (= main_~d~0 2) (= main_~q~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {10404#(and (= main_~A~0 main_~r~0) (= main_~p~0 2) (= main_~d~0 2) (= main_~q~0 0))} is VALID [2022-04-27 13:47:56,858 INFO L272 TraceCheckUtils]: 26: Hoare triple {10404#(and (= main_~A~0 main_~r~0) (= main_~p~0 2) (= main_~d~0 2) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:47:56,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:47:56,858 INFO L290 TraceCheckUtils]: 28: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:47:56,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:47:56,858 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10329#true} {10404#(and (= main_~A~0 main_~r~0) (= main_~p~0 2) (= main_~d~0 2) (= main_~q~0 0))} #78#return; {10404#(and (= main_~A~0 main_~r~0) (= main_~p~0 2) (= main_~d~0 2) (= main_~q~0 0))} is VALID [2022-04-27 13:47:56,858 INFO L272 TraceCheckUtils]: 31: Hoare triple {10404#(and (= main_~A~0 main_~r~0) (= main_~p~0 2) (= main_~d~0 2) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:47:56,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:47:56,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:47:56,858 INFO L290 TraceCheckUtils]: 34: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:47:56,859 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {10329#true} {10404#(and (= main_~A~0 main_~r~0) (= main_~p~0 2) (= main_~d~0 2) (= main_~q~0 0))} #80#return; {10404#(and (= main_~A~0 main_~r~0) (= main_~p~0 2) (= main_~d~0 2) (= main_~q~0 0))} is VALID [2022-04-27 13:47:56,859 INFO L272 TraceCheckUtils]: 36: Hoare triple {10404#(and (= main_~A~0 main_~r~0) (= main_~p~0 2) (= main_~d~0 2) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:47:56,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:47:56,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:47:56,859 INFO L290 TraceCheckUtils]: 39: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:47:56,860 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10329#true} {10404#(and (= main_~A~0 main_~r~0) (= main_~p~0 2) (= main_~d~0 2) (= main_~q~0 0))} #82#return; {10404#(and (= main_~A~0 main_~r~0) (= main_~p~0 2) (= main_~d~0 2) (= main_~q~0 0))} is VALID [2022-04-27 13:47:56,860 INFO L290 TraceCheckUtils]: 41: Hoare triple {10404#(and (= main_~A~0 main_~r~0) (= main_~p~0 2) (= main_~d~0 2) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 13:47:56,860 INFO L290 TraceCheckUtils]: 42: Hoare triple {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 13:47:56,861 INFO L290 TraceCheckUtils]: 43: Hoare triple {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} assume !!(#t~post5 < 5);havoc #t~post5; {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 13:47:56,861 INFO L272 TraceCheckUtils]: 44: Hoare triple {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:47:56,861 INFO L290 TraceCheckUtils]: 45: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:47:56,861 INFO L290 TraceCheckUtils]: 46: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:47:56,861 INFO L290 TraceCheckUtils]: 47: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:47:56,864 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {10329#true} {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} #78#return; {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 13:47:56,864 INFO L272 TraceCheckUtils]: 49: Hoare triple {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:47:56,864 INFO L290 TraceCheckUtils]: 50: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:47:56,864 INFO L290 TraceCheckUtils]: 51: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:47:56,865 INFO L290 TraceCheckUtils]: 52: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:47:56,865 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {10329#true} {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} #80#return; {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 13:47:56,865 INFO L272 TraceCheckUtils]: 54: Hoare triple {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:47:56,865 INFO L290 TraceCheckUtils]: 55: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:47:56,865 INFO L290 TraceCheckUtils]: 56: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:47:56,865 INFO L290 TraceCheckUtils]: 57: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:47:56,867 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10329#true} {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} #82#return; {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 13:47:56,868 INFO L290 TraceCheckUtils]: 59: Hoare triple {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} assume !(~r~0 >= ~d~0); {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 13:47:56,875 INFO L290 TraceCheckUtils]: 60: Hoare triple {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 13:47:56,876 INFO L290 TraceCheckUtils]: 61: Hoare triple {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} assume !!(#t~post6 < 5);havoc #t~post6; {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 13:47:56,876 INFO L272 TraceCheckUtils]: 62: Hoare triple {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:47:56,876 INFO L290 TraceCheckUtils]: 63: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:47:56,876 INFO L290 TraceCheckUtils]: 64: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:47:56,876 INFO L290 TraceCheckUtils]: 65: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:47:56,877 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10329#true} {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} #84#return; {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 13:47:56,877 INFO L272 TraceCheckUtils]: 67: Hoare triple {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:47:56,877 INFO L290 TraceCheckUtils]: 68: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:47:56,877 INFO L290 TraceCheckUtils]: 69: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:47:56,877 INFO L290 TraceCheckUtils]: 70: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:47:56,878 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {10329#true} {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} #86#return; {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 13:47:56,878 INFO L290 TraceCheckUtils]: 72: Hoare triple {10459#(and (= main_~A~0 main_~r~0) (= main_~d~0 4) (= main_~q~0 0) (= main_~p~0 4))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {10404#(and (= main_~A~0 main_~r~0) (= main_~p~0 2) (= main_~d~0 2) (= main_~q~0 0))} is VALID [2022-04-27 13:47:56,879 INFO L290 TraceCheckUtils]: 73: Hoare triple {10404#(and (= main_~A~0 main_~r~0) (= main_~p~0 2) (= main_~d~0 2) (= main_~q~0 0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10556#(and (= main_~q~0 main_~p~0) (= main_~p~0 2) (= main_~d~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0))} is VALID [2022-04-27 13:47:56,880 INFO L290 TraceCheckUtils]: 74: Hoare triple {10556#(and (= main_~q~0 main_~p~0) (= main_~p~0 2) (= main_~d~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10556#(and (= main_~q~0 main_~p~0) (= main_~p~0 2) (= main_~d~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0))} is VALID [2022-04-27 13:47:56,880 INFO L290 TraceCheckUtils]: 75: Hoare triple {10556#(and (= main_~q~0 main_~p~0) (= main_~p~0 2) (= main_~d~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0))} assume !!(#t~post6 < 5);havoc #t~post6; {10556#(and (= main_~q~0 main_~p~0) (= main_~p~0 2) (= main_~d~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0))} is VALID [2022-04-27 13:47:56,880 INFO L272 TraceCheckUtils]: 76: Hoare triple {10556#(and (= main_~q~0 main_~p~0) (= main_~p~0 2) (= main_~d~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:47:56,880 INFO L290 TraceCheckUtils]: 77: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:47:56,880 INFO L290 TraceCheckUtils]: 78: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:47:56,880 INFO L290 TraceCheckUtils]: 79: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:47:56,881 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {10329#true} {10556#(and (= main_~q~0 main_~p~0) (= main_~p~0 2) (= main_~d~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0))} #84#return; {10556#(and (= main_~q~0 main_~p~0) (= main_~p~0 2) (= main_~d~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0))} is VALID [2022-04-27 13:47:56,881 INFO L272 TraceCheckUtils]: 81: Hoare triple {10556#(and (= main_~q~0 main_~p~0) (= main_~p~0 2) (= main_~d~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:47:56,881 INFO L290 TraceCheckUtils]: 82: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:47:56,881 INFO L290 TraceCheckUtils]: 83: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:47:56,881 INFO L290 TraceCheckUtils]: 84: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:47:56,882 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {10329#true} {10556#(and (= main_~q~0 main_~p~0) (= main_~p~0 2) (= main_~d~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0))} #86#return; {10556#(and (= main_~q~0 main_~p~0) (= main_~p~0 2) (= main_~d~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0))} is VALID [2022-04-27 13:47:56,883 INFO L290 TraceCheckUtils]: 86: Hoare triple {10556#(and (= main_~q~0 main_~p~0) (= main_~p~0 2) (= main_~d~0 2) (= (+ main_~d~0 main_~r~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); {10596#(and (= main_~q~0 2) (= main_~A~0 (+ main_~r~0 2)) (= main_~d~0 1) (= main_~p~0 1))} is VALID [2022-04-27 13:47:56,884 INFO L290 TraceCheckUtils]: 87: Hoare triple {10596#(and (= main_~q~0 2) (= main_~A~0 (+ main_~r~0 2)) (= main_~d~0 1) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10600#(and (= main_~r~0 (+ (- 2) (* (- 1) main_~d~0) main_~A~0)) (= main_~d~0 1) (= (+ (- 2) main_~q~0) 1))} is VALID [2022-04-27 13:47:56,884 INFO L290 TraceCheckUtils]: 88: Hoare triple {10600#(and (= main_~r~0 (+ (- 2) (* (- 1) main_~d~0) main_~A~0)) (= main_~d~0 1) (= (+ (- 2) main_~q~0) 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10600#(and (= main_~r~0 (+ (- 2) (* (- 1) main_~d~0) main_~A~0)) (= main_~d~0 1) (= (+ (- 2) main_~q~0) 1))} is VALID [2022-04-27 13:47:56,885 INFO L290 TraceCheckUtils]: 89: Hoare triple {10600#(and (= main_~r~0 (+ (- 2) (* (- 1) main_~d~0) main_~A~0)) (= main_~d~0 1) (= (+ (- 2) main_~q~0) 1))} assume !(#t~post6 < 5);havoc #t~post6; {10600#(and (= main_~r~0 (+ (- 2) (* (- 1) main_~d~0) main_~A~0)) (= main_~d~0 1) (= (+ (- 2) main_~q~0) 1))} is VALID [2022-04-27 13:47:56,885 INFO L272 TraceCheckUtils]: 90: Hoare triple {10600#(and (= main_~r~0 (+ (- 2) (* (- 1) main_~d~0) main_~A~0)) (= main_~d~0 1) (= (+ (- 2) main_~q~0) 1))} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {10610#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:47:56,886 INFO L290 TraceCheckUtils]: 91: Hoare triple {10610#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10614#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:47:56,886 INFO L290 TraceCheckUtils]: 92: Hoare triple {10614#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10330#false} is VALID [2022-04-27 13:47:56,886 INFO L290 TraceCheckUtils]: 93: Hoare triple {10330#false} assume !false; {10330#false} is VALID [2022-04-27 13:47:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-27 13:47:56,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:48:23,109 INFO L290 TraceCheckUtils]: 93: Hoare triple {10330#false} assume !false; {10330#false} is VALID [2022-04-27 13:48:23,110 INFO L290 TraceCheckUtils]: 92: Hoare triple {10614#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10330#false} is VALID [2022-04-27 13:48:23,110 INFO L290 TraceCheckUtils]: 91: Hoare triple {10610#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10614#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:48:23,111 INFO L272 TraceCheckUtils]: 90: Hoare triple {10630#(= (+ (* 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)); {10610#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:48:23,111 INFO L290 TraceCheckUtils]: 89: Hoare triple {10630#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} assume !(#t~post6 < 5);havoc #t~post6; {10630#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:48:23,112 INFO L290 TraceCheckUtils]: 88: Hoare triple {10630#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10630#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:48:23,114 INFO L290 TraceCheckUtils]: 87: Hoare triple {10640#(= (+ (* (+ main_~q~0 main_~p~0) main_~d~0) (* (- 1) main_~d~0) main_~r~0) main_~A~0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10630#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:48:23,152 INFO L290 TraceCheckUtils]: 86: Hoare triple {10644#(and (or (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (not (< main_~p~0 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {10640#(= (+ (* (+ main_~q~0 main_~p~0) main_~d~0) (* (- 1) main_~d~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:48:23,153 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {10329#true} {10644#(and (or (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (not (< main_~p~0 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #86#return; {10644#(and (or (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (not (< main_~p~0 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:48:23,153 INFO L290 TraceCheckUtils]: 84: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:48:23,153 INFO L290 TraceCheckUtils]: 83: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:48:23,153 INFO L290 TraceCheckUtils]: 82: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:48:23,153 INFO L272 TraceCheckUtils]: 81: Hoare triple {10644#(and (or (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (not (< main_~p~0 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:48:23,154 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {10329#true} {10644#(and (or (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (not (< main_~p~0 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #84#return; {10644#(and (or (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (not (< main_~p~0 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:48:23,154 INFO L290 TraceCheckUtils]: 79: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:48:23,154 INFO L290 TraceCheckUtils]: 78: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:48:23,154 INFO L290 TraceCheckUtils]: 77: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:48:23,154 INFO L272 TraceCheckUtils]: 76: Hoare triple {10644#(and (or (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (not (< main_~p~0 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:48:23,156 INFO L290 TraceCheckUtils]: 75: Hoare triple {10644#(and (or (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (not (< main_~p~0 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} assume !!(#t~post6 < 5);havoc #t~post6; {10644#(and (or (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (not (< main_~p~0 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:48:23,157 INFO L290 TraceCheckUtils]: 74: Hoare triple {10644#(and (or (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (not (< main_~p~0 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10644#(and (or (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (not (< main_~p~0 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:48:23,200 INFO L290 TraceCheckUtils]: 73: Hoare triple {10684#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))) (or (not (< main_~p~0 0)) (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (= (mod main_~p~0 2) 0)))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10644#(and (or (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div main_~p~0 2) 1) (div main_~d~0 2)) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (div main_~d~0 2)) (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (not (< main_~p~0 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 (div main_~p~0 2)))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:48:23,398 INFO L290 TraceCheckUtils]: 72: Hoare triple {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {10684#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))) (or (not (< main_~p~0 0)) (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-27 13:48:23,400 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {10329#true} {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} #86#return; {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} is VALID [2022-04-27 13:48:23,400 INFO L290 TraceCheckUtils]: 70: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:48:23,400 INFO L290 TraceCheckUtils]: 69: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:48:23,400 INFO L290 TraceCheckUtils]: 68: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:48:23,401 INFO L272 TraceCheckUtils]: 67: Hoare triple {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:48:23,402 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10329#true} {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} #84#return; {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} is VALID [2022-04-27 13:48:23,402 INFO L290 TraceCheckUtils]: 65: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:48:23,402 INFO L290 TraceCheckUtils]: 64: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:48:23,402 INFO L290 TraceCheckUtils]: 63: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:48:23,402 INFO L272 TraceCheckUtils]: 62: Hoare triple {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:48:23,407 INFO L290 TraceCheckUtils]: 61: Hoare triple {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} assume !!(#t~post6 < 5);havoc #t~post6; {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} is VALID [2022-04-27 13:48:23,412 INFO L290 TraceCheckUtils]: 60: Hoare triple {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} is VALID [2022-04-27 13:48:23,416 INFO L290 TraceCheckUtils]: 59: Hoare triple {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} assume !(~r~0 >= ~d~0); {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} is VALID [2022-04-27 13:48:23,417 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10329#true} {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} #82#return; {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} is VALID [2022-04-27 13:48:23,418 INFO L290 TraceCheckUtils]: 57: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:48:23,418 INFO L290 TraceCheckUtils]: 56: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:48:23,418 INFO L290 TraceCheckUtils]: 55: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:48:23,418 INFO L272 TraceCheckUtils]: 54: Hoare triple {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:48:23,419 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {10329#true} {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} #80#return; {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} is VALID [2022-04-27 13:48:23,419 INFO L290 TraceCheckUtils]: 52: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:48:23,419 INFO L290 TraceCheckUtils]: 51: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:48:23,419 INFO L290 TraceCheckUtils]: 50: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:48:23,419 INFO L272 TraceCheckUtils]: 49: Hoare triple {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:48:23,420 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {10329#true} {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} #78#return; {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} is VALID [2022-04-27 13:48:23,420 INFO L290 TraceCheckUtils]: 47: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:48:23,420 INFO L290 TraceCheckUtils]: 46: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:48:23,421 INFO L290 TraceCheckUtils]: 45: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:48:23,421 INFO L272 TraceCheckUtils]: 44: Hoare triple {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:48:23,426 INFO L290 TraceCheckUtils]: 43: Hoare triple {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} assume !!(#t~post5 < 5);havoc #t~post5; {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} is VALID [2022-04-27 13:48:23,430 INFO L290 TraceCheckUtils]: 42: Hoare triple {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} is VALID [2022-04-27 13:48:23,513 INFO L290 TraceCheckUtils]: 41: Hoare triple {10684#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))) (or (not (< main_~p~0 0)) (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (= (mod main_~p~0 2) 0)))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10688#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0)) (or (= (+ (- 1) (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ (div (+ (div main_~d~0 2) 1) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))) 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 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (+ (div main_~d~0 2) 1) 2) 1)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (div (+ (div main_~d~0 2) 1) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (+ (div main_~d~0 2) 1) 2)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (div (div main_~d~0 2) 2)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (+ (div (div main_~d~0 2) 2) 1)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0))) (= (mod 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 (= (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ (- 1) main_~r~0 (* (+ (div (div main_~d~0 2) 2) 1) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)) (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (or (= (+ (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2))) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (div (div main_~d~0 2) 2) (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))))} is VALID [2022-04-27 13:48:23,514 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10329#true} {10684#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))) (or (not (< main_~p~0 0)) (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (= (mod main_~p~0 2) 0)))))} #82#return; {10684#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))) (or (not (< main_~p~0 0)) (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-27 13:48:23,515 INFO L290 TraceCheckUtils]: 39: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:48:23,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:48:23,515 INFO L290 TraceCheckUtils]: 37: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:48:23,515 INFO L272 TraceCheckUtils]: 36: Hoare triple {10684#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))) (or (not (< main_~p~0 0)) (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:48:23,516 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {10329#true} {10684#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))) (or (not (< main_~p~0 0)) (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (= (mod main_~p~0 2) 0)))))} #80#return; {10684#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))) (or (not (< main_~p~0 0)) (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-27 13:48:23,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:48:23,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:48:23,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:48:23,516 INFO L272 TraceCheckUtils]: 31: Hoare triple {10684#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))) (or (not (< main_~p~0 0)) (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:48:23,517 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10329#true} {10684#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))) (or (not (< main_~p~0 0)) (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (= (mod main_~p~0 2) 0)))))} #78#return; {10684#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))) (or (not (< main_~p~0 0)) (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-27 13:48:23,517 INFO L290 TraceCheckUtils]: 29: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:48:23,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:48:23,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:48:23,517 INFO L272 TraceCheckUtils]: 26: Hoare triple {10684#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))) (or (not (< main_~p~0 0)) (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:48:23,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {10684#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))) (or (not (< main_~p~0 0)) (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (= (mod main_~p~0 2) 0)))))} assume !!(#t~post5 < 5);havoc #t~post5; {10684#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))) (or (not (< main_~p~0 0)) (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-27 13:48:23,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {10684#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))) (or (not (< main_~p~0 0)) (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (= (mod main_~p~0 2) 0)))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10684#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))) (or (not (< main_~p~0 0)) (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-27 13:48:23,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {10836#(= (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))) (+ main_~A~0 (* main_~d~0 3)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10684#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (div main_~d~0 2))) main_~A~0) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (div main_~d~0 2) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) (div main_~d~0 2))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2)))))) (or (not (< main_~p~0 0)) (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ (div main_~d~0 2) 1) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-27 13:48:23,526 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10329#true} {10836#(= (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))) (+ main_~A~0 (* main_~d~0 3)))} #82#return; {10836#(= (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-27 13:48:23,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:48:23,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:48:23,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:48:23,526 INFO L272 TraceCheckUtils]: 18: Hoare triple {10836#(= (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:48:23,527 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10329#true} {10836#(= (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))) (+ main_~A~0 (* main_~d~0 3)))} #80#return; {10836#(= (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-27 13:48:23,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:48:23,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:48:23,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:48:23,527 INFO L272 TraceCheckUtils]: 13: Hoare triple {10836#(= (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:48:23,528 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10329#true} {10836#(= (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))) (+ main_~A~0 (* main_~d~0 3)))} #78#return; {10836#(= (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-27 13:48:23,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:48:23,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {10329#true} assume !(0 == ~cond); {10329#true} is VALID [2022-04-27 13:48:23,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {10329#true} ~cond := #in~cond; {10329#true} is VALID [2022-04-27 13:48:23,528 INFO L272 TraceCheckUtils]: 8: Hoare triple {10836#(= (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10329#true} is VALID [2022-04-27 13:48:23,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {10836#(= (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))) (+ main_~A~0 (* main_~d~0 3)))} assume !!(#t~post5 < 5);havoc #t~post5; {10836#(= (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-27 13:48:23,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {10836#(= (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))) (+ main_~A~0 (* main_~d~0 3)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10836#(= (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-27 13:48:23,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {10329#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; {10836#(= (+ (* main_~d~0 main_~q~0) main_~r~0 (* 3 (* main_~d~0 main_~p~0))) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-27 13:48:23,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {10329#true} call #t~ret7 := main(); {10329#true} is VALID [2022-04-27 13:48:23,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10329#true} {10329#true} #92#return; {10329#true} is VALID [2022-04-27 13:48:23,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {10329#true} assume true; {10329#true} is VALID [2022-04-27 13:48:23,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {10329#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);~counter~0 := 0; {10329#true} is VALID [2022-04-27 13:48:23,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {10329#true} call ULTIMATE.init(); {10329#true} is VALID [2022-04-27 13:48:23,532 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-27 13:48:23,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:48:23,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465287258] [2022-04-27 13:48:23,532 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:48:23,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217494183] [2022-04-27 13:48:23,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217494183] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:48:23,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:48:23,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-27 13:48:23,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594055285] [2022-04-27 13:48:23,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:48:23,534 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 94 [2022-04-27 13:48:23,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:48:23,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2022-04-27 13:48:24,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:48:24,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 13:48:24,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:48:24,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 13:48:24,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-04-27 13:48:24,024 INFO L87 Difference]: Start difference. First operand 169 states and 198 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2022-04-27 13:48:41,191 WARN L232 SmtUtils]: Spent 7.83s on a formula simplification. DAG size of input: 209 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 13:48:44,133 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:48:47,011 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (= (mod c_main_~p~0 2) 0)) (.cse15 (< c_main_~p~0 0)) (.cse8 (= (mod c_main_~d~0 2) 0)) (.cse16 (div c_main_~p~0 2)) (.cse17 (< c_main_~d~0 0)) (.cse14 (div c_main_~d~0 2))) (let ((.cse2 (+ .cse14 1)) (.cse9 (not .cse17)) (.cse12 (* c_main_~q~0 c_main_~d~0)) (.cse6 (+ c_main_~q~0 .cse16 1)) (.cse1 (+ c_main_~q~0 .cse16)) (.cse13 (and .cse17 (not .cse8))) (.cse10 (+ c_main_~q~0 c_main_~p~0 .cse16 1)) (.cse7 (not .cse15)) (.cse0 (* (- 1) c_main_~d~0)) (.cse3 (* (- 1) .cse14)) (.cse11 (+ c_main_~q~0 c_main_~p~0 .cse16)) (.cse4 (and (not .cse5) .cse15))) (and (= c_main_~A~0 (+ .cse0 c_main_~r~0 (* c_main_~d~0 (+ c_main_~q~0 c_main_~p~0)))) (or (and (or (= c_main_~A~0 (+ (- 1) (* .cse1 .cse2) c_main_~r~0 .cse3)) .cse4) (or .cse5 (= c_main_~A~0 (+ (- 1) (* .cse6 .cse2) c_main_~r~0 .cse3)) .cse7)) .cse8 .cse9) (or (and (or (= (+ (- 1) (* .cse10 .cse2) .cse0 c_main_~r~0 .cse3) c_main_~A~0) .cse5 .cse7) (or .cse4 (= (+ (- 1) .cse0 c_main_~r~0 (* .cse2 .cse11) .cse3) c_main_~A~0))) .cse8 .cse9) (= (+ .cse12 c_main_~r~0) c_main_~A~0) (= (+ .cse12 c_main_~r~0 (* 3 (* c_main_~d~0 c_main_~p~0))) (+ c_main_~A~0 (* 3 c_main_~d~0))) (or .cse13 (and (or (= (+ c_main_~r~0 .cse3 (* .cse6 .cse14)) c_main_~A~0) .cse5 .cse7) (or (= c_main_~A~0 (+ c_main_~r~0 (* .cse1 .cse14) .cse3)) .cse4))) (or .cse13 (and (or .cse5 (= (+ .cse0 c_main_~r~0 .cse3 (* .cse10 .cse14)) c_main_~A~0) .cse7) (or (= c_main_~A~0 (+ .cse0 c_main_~r~0 .cse3 (* .cse14 .cse11))) .cse4)))))) is different from false [2022-04-27 13:48:51,456 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:49:14,319 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:49:16,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:16,853 INFO L93 Difference]: Finished difference Result 295 states and 390 transitions. [2022-04-27 13:49:16,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 13:49:16,853 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 94 [2022-04-27 13:49:16,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:49:16,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2022-04-27 13:49:16,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 227 transitions. [2022-04-27 13:49:16,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2022-04-27 13:49:16,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 227 transitions. [2022-04-27 13:49:16,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 227 transitions. [2022-04-27 13:49:19,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 226 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:49:19,680 INFO L225 Difference]: With dead ends: 295 [2022-04-27 13:49:19,680 INFO L226 Difference]: Without dead ends: 256 [2022-04-27 13:49:19,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 171 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=91, Invalid=374, Unknown=1, NotChecked=40, Total=506 [2022-04-27 13:49:19,681 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 85 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 131 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:49:19,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 510 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 816 Invalid, 2 Unknown, 1 Unchecked, 18.0s Time] [2022-04-27 13:49:19,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-04-27 13:49:19,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 206. [2022-04-27 13:49:19,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:49:19,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand has 206 states, 137 states have (on average 1.2262773722627738) internal successors, (168), 141 states have internal predecessors, (168), 46 states have call successors, (46), 23 states have call predecessors, (46), 22 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-27 13:49:19,783 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand has 206 states, 137 states have (on average 1.2262773722627738) internal successors, (168), 141 states have internal predecessors, (168), 46 states have call successors, (46), 23 states have call predecessors, (46), 22 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-27 13:49:19,783 INFO L87 Difference]: Start difference. First operand 256 states. Second operand has 206 states, 137 states have (on average 1.2262773722627738) internal successors, (168), 141 states have internal predecessors, (168), 46 states have call successors, (46), 23 states have call predecessors, (46), 22 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-27 13:49:19,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:19,791 INFO L93 Difference]: Finished difference Result 256 states and 334 transitions. [2022-04-27 13:49:19,791 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 334 transitions. [2022-04-27 13:49:19,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:19,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:19,793 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 137 states have (on average 1.2262773722627738) internal successors, (168), 141 states have internal predecessors, (168), 46 states have call successors, (46), 23 states have call predecessors, (46), 22 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) Second operand 256 states. [2022-04-27 13:49:19,794 INFO L87 Difference]: Start difference. First operand has 206 states, 137 states have (on average 1.2262773722627738) internal successors, (168), 141 states have internal predecessors, (168), 46 states have call successors, (46), 23 states have call predecessors, (46), 22 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) Second operand 256 states. [2022-04-27 13:49:19,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:19,802 INFO L93 Difference]: Finished difference Result 256 states and 334 transitions. [2022-04-27 13:49:19,802 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 334 transitions. [2022-04-27 13:49:19,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:19,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:19,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:49:19,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:49:19,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 137 states have (on average 1.2262773722627738) internal successors, (168), 141 states have internal predecessors, (168), 46 states have call successors, (46), 23 states have call predecessors, (46), 22 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-27 13:49:19,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 258 transitions. [2022-04-27 13:49:19,810 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 258 transitions. Word has length 94 [2022-04-27 13:49:19,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:49:19,810 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 258 transitions. [2022-04-27 13:49:19,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2022-04-27 13:49:19,810 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 258 transitions. [2022-04-27 13:49:19,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-27 13:49:19,816 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:49:19,816 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:49:19,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 13:49:20,027 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,SelfDestructingSolverStorable14 [2022-04-27 13:49:20,028 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:49:20,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:49:20,028 INFO L85 PathProgramCache]: Analyzing trace with hash -612515316, now seen corresponding path program 2 times [2022-04-27 13:49:20,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:49:20,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756862684] [2022-04-27 13:49:20,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:49:20,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:49:20,042 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:49:20,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1830327562] [2022-04-27 13:49:20,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:49:20,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:49:20,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:49:20,048 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-27 13:49:20,049 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-27 13:49:20,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:49:20,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:49:20,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 13:49:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:20,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:49:20,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {12132#true} call ULTIMATE.init(); {12132#true} is VALID [2022-04-27 13:49:20,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {12132#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);~counter~0 := 0; {12140#(<= 0 ~counter~0)} is VALID [2022-04-27 13:49:20,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {12140#(<= 0 ~counter~0)} assume true; {12140#(<= 0 ~counter~0)} is VALID [2022-04-27 13:49:20,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12140#(<= 0 ~counter~0)} {12132#true} #92#return; {12140#(<= 0 ~counter~0)} is VALID [2022-04-27 13:49:20,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {12140#(<= 0 ~counter~0)} call #t~ret7 := main(); {12140#(<= 0 ~counter~0)} is VALID [2022-04-27 13:49:20,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {12140#(<= 0 ~counter~0)} 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; {12140#(<= 0 ~counter~0)} is VALID [2022-04-27 13:49:20,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {12140#(<= 0 ~counter~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {12156#(<= 1 ~counter~0)} assume !!(#t~post5 < 5);havoc #t~post5; {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,520 INFO L272 TraceCheckUtils]: 8: Hoare triple {12156#(<= 1 ~counter~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {12156#(<= 1 ~counter~0)} ~cond := #in~cond; {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {12156#(<= 1 ~counter~0)} assume !(0 == ~cond); {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {12156#(<= 1 ~counter~0)} assume true; {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,521 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12156#(<= 1 ~counter~0)} {12156#(<= 1 ~counter~0)} #78#return; {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,521 INFO L272 TraceCheckUtils]: 13: Hoare triple {12156#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {12156#(<= 1 ~counter~0)} ~cond := #in~cond; {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {12156#(<= 1 ~counter~0)} assume !(0 == ~cond); {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {12156#(<= 1 ~counter~0)} assume true; {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,523 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12156#(<= 1 ~counter~0)} {12156#(<= 1 ~counter~0)} #80#return; {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,523 INFO L272 TraceCheckUtils]: 18: Hoare triple {12156#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {12156#(<= 1 ~counter~0)} ~cond := #in~cond; {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {12156#(<= 1 ~counter~0)} assume !(0 == ~cond); {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {12156#(<= 1 ~counter~0)} assume true; {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,524 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12156#(<= 1 ~counter~0)} {12156#(<= 1 ~counter~0)} #82#return; {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {12156#(<= 1 ~counter~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {12156#(<= 1 ~counter~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {12211#(<= 2 ~counter~0)} assume !!(#t~post5 < 5);havoc #t~post5; {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,526 INFO L272 TraceCheckUtils]: 26: Hoare triple {12211#(<= 2 ~counter~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {12211#(<= 2 ~counter~0)} ~cond := #in~cond; {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {12211#(<= 2 ~counter~0)} assume !(0 == ~cond); {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,527 INFO L290 TraceCheckUtils]: 29: Hoare triple {12211#(<= 2 ~counter~0)} assume true; {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,527 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {12211#(<= 2 ~counter~0)} {12211#(<= 2 ~counter~0)} #78#return; {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,527 INFO L272 TraceCheckUtils]: 31: Hoare triple {12211#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {12211#(<= 2 ~counter~0)} ~cond := #in~cond; {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,528 INFO L290 TraceCheckUtils]: 33: Hoare triple {12211#(<= 2 ~counter~0)} assume !(0 == ~cond); {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {12211#(<= 2 ~counter~0)} assume true; {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,529 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {12211#(<= 2 ~counter~0)} {12211#(<= 2 ~counter~0)} #80#return; {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,529 INFO L272 TraceCheckUtils]: 36: Hoare triple {12211#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,529 INFO L290 TraceCheckUtils]: 37: Hoare triple {12211#(<= 2 ~counter~0)} ~cond := #in~cond; {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,530 INFO L290 TraceCheckUtils]: 38: Hoare triple {12211#(<= 2 ~counter~0)} assume !(0 == ~cond); {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,530 INFO L290 TraceCheckUtils]: 39: Hoare triple {12211#(<= 2 ~counter~0)} assume true; {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,530 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12211#(<= 2 ~counter~0)} {12211#(<= 2 ~counter~0)} #82#return; {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,531 INFO L290 TraceCheckUtils]: 41: Hoare triple {12211#(<= 2 ~counter~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,531 INFO L290 TraceCheckUtils]: 42: Hoare triple {12211#(<= 2 ~counter~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,532 INFO L290 TraceCheckUtils]: 43: Hoare triple {12266#(<= 3 ~counter~0)} assume !!(#t~post5 < 5);havoc #t~post5; {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,532 INFO L272 TraceCheckUtils]: 44: Hoare triple {12266#(<= 3 ~counter~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,532 INFO L290 TraceCheckUtils]: 45: Hoare triple {12266#(<= 3 ~counter~0)} ~cond := #in~cond; {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,532 INFO L290 TraceCheckUtils]: 46: Hoare triple {12266#(<= 3 ~counter~0)} assume !(0 == ~cond); {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,533 INFO L290 TraceCheckUtils]: 47: Hoare triple {12266#(<= 3 ~counter~0)} assume true; {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,533 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12266#(<= 3 ~counter~0)} {12266#(<= 3 ~counter~0)} #78#return; {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,533 INFO L272 TraceCheckUtils]: 49: Hoare triple {12266#(<= 3 ~counter~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,534 INFO L290 TraceCheckUtils]: 50: Hoare triple {12266#(<= 3 ~counter~0)} ~cond := #in~cond; {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,534 INFO L290 TraceCheckUtils]: 51: Hoare triple {12266#(<= 3 ~counter~0)} assume !(0 == ~cond); {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,534 INFO L290 TraceCheckUtils]: 52: Hoare triple {12266#(<= 3 ~counter~0)} assume true; {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,535 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {12266#(<= 3 ~counter~0)} {12266#(<= 3 ~counter~0)} #80#return; {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,535 INFO L272 TraceCheckUtils]: 54: Hoare triple {12266#(<= 3 ~counter~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,535 INFO L290 TraceCheckUtils]: 55: Hoare triple {12266#(<= 3 ~counter~0)} ~cond := #in~cond; {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,536 INFO L290 TraceCheckUtils]: 56: Hoare triple {12266#(<= 3 ~counter~0)} assume !(0 == ~cond); {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,536 INFO L290 TraceCheckUtils]: 57: Hoare triple {12266#(<= 3 ~counter~0)} assume true; {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,536 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12266#(<= 3 ~counter~0)} {12266#(<= 3 ~counter~0)} #82#return; {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,537 INFO L290 TraceCheckUtils]: 59: Hoare triple {12266#(<= 3 ~counter~0)} assume !(~r~0 >= ~d~0); {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,537 INFO L290 TraceCheckUtils]: 60: Hoare triple {12266#(<= 3 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12321#(<= 4 ~counter~0)} is VALID [2022-04-27 13:49:20,538 INFO L290 TraceCheckUtils]: 61: Hoare triple {12321#(<= 4 ~counter~0)} assume !!(#t~post6 < 5);havoc #t~post6; {12321#(<= 4 ~counter~0)} is VALID [2022-04-27 13:49:20,538 INFO L272 TraceCheckUtils]: 62: Hoare triple {12321#(<= 4 ~counter~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {12321#(<= 4 ~counter~0)} is VALID [2022-04-27 13:49:20,538 INFO L290 TraceCheckUtils]: 63: Hoare triple {12321#(<= 4 ~counter~0)} ~cond := #in~cond; {12321#(<= 4 ~counter~0)} is VALID [2022-04-27 13:49:20,539 INFO L290 TraceCheckUtils]: 64: Hoare triple {12321#(<= 4 ~counter~0)} assume !(0 == ~cond); {12321#(<= 4 ~counter~0)} is VALID [2022-04-27 13:49:20,539 INFO L290 TraceCheckUtils]: 65: Hoare triple {12321#(<= 4 ~counter~0)} assume true; {12321#(<= 4 ~counter~0)} is VALID [2022-04-27 13:49:20,539 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12321#(<= 4 ~counter~0)} {12321#(<= 4 ~counter~0)} #84#return; {12321#(<= 4 ~counter~0)} is VALID [2022-04-27 13:49:20,540 INFO L272 TraceCheckUtils]: 67: Hoare triple {12321#(<= 4 ~counter~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12321#(<= 4 ~counter~0)} is VALID [2022-04-27 13:49:20,540 INFO L290 TraceCheckUtils]: 68: Hoare triple {12321#(<= 4 ~counter~0)} ~cond := #in~cond; {12321#(<= 4 ~counter~0)} is VALID [2022-04-27 13:49:20,540 INFO L290 TraceCheckUtils]: 69: Hoare triple {12321#(<= 4 ~counter~0)} assume !(0 == ~cond); {12321#(<= 4 ~counter~0)} is VALID [2022-04-27 13:49:20,541 INFO L290 TraceCheckUtils]: 70: Hoare triple {12321#(<= 4 ~counter~0)} assume true; {12321#(<= 4 ~counter~0)} is VALID [2022-04-27 13:49:20,541 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12321#(<= 4 ~counter~0)} {12321#(<= 4 ~counter~0)} #86#return; {12321#(<= 4 ~counter~0)} is VALID [2022-04-27 13:49:20,541 INFO L290 TraceCheckUtils]: 72: Hoare triple {12321#(<= 4 ~counter~0)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {12321#(<= 4 ~counter~0)} is VALID [2022-04-27 13:49:20,546 INFO L290 TraceCheckUtils]: 73: Hoare triple {12321#(<= 4 ~counter~0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {12321#(<= 4 ~counter~0)} is VALID [2022-04-27 13:49:20,546 INFO L290 TraceCheckUtils]: 74: Hoare triple {12321#(<= 4 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12364#(<= 5 ~counter~0)} is VALID [2022-04-27 13:49:20,547 INFO L290 TraceCheckUtils]: 75: Hoare triple {12364#(<= 5 ~counter~0)} assume !!(#t~post6 < 5);havoc #t~post6; {12364#(<= 5 ~counter~0)} is VALID [2022-04-27 13:49:20,547 INFO L272 TraceCheckUtils]: 76: Hoare triple {12364#(<= 5 ~counter~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {12364#(<= 5 ~counter~0)} is VALID [2022-04-27 13:49:20,548 INFO L290 TraceCheckUtils]: 77: Hoare triple {12364#(<= 5 ~counter~0)} ~cond := #in~cond; {12364#(<= 5 ~counter~0)} is VALID [2022-04-27 13:49:20,548 INFO L290 TraceCheckUtils]: 78: Hoare triple {12364#(<= 5 ~counter~0)} assume !(0 == ~cond); {12364#(<= 5 ~counter~0)} is VALID [2022-04-27 13:49:20,548 INFO L290 TraceCheckUtils]: 79: Hoare triple {12364#(<= 5 ~counter~0)} assume true; {12364#(<= 5 ~counter~0)} is VALID [2022-04-27 13:49:20,549 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12364#(<= 5 ~counter~0)} {12364#(<= 5 ~counter~0)} #84#return; {12364#(<= 5 ~counter~0)} is VALID [2022-04-27 13:49:20,549 INFO L272 TraceCheckUtils]: 81: Hoare triple {12364#(<= 5 ~counter~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12364#(<= 5 ~counter~0)} is VALID [2022-04-27 13:49:20,549 INFO L290 TraceCheckUtils]: 82: Hoare triple {12364#(<= 5 ~counter~0)} ~cond := #in~cond; {12364#(<= 5 ~counter~0)} is VALID [2022-04-27 13:49:20,550 INFO L290 TraceCheckUtils]: 83: Hoare triple {12364#(<= 5 ~counter~0)} assume !(0 == ~cond); {12364#(<= 5 ~counter~0)} is VALID [2022-04-27 13:49:20,550 INFO L290 TraceCheckUtils]: 84: Hoare triple {12364#(<= 5 ~counter~0)} assume true; {12364#(<= 5 ~counter~0)} is VALID [2022-04-27 13:49:20,550 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {12364#(<= 5 ~counter~0)} {12364#(<= 5 ~counter~0)} #86#return; {12364#(<= 5 ~counter~0)} is VALID [2022-04-27 13:49:20,551 INFO L290 TraceCheckUtils]: 86: Hoare triple {12364#(<= 5 ~counter~0)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {12364#(<= 5 ~counter~0)} is VALID [2022-04-27 13:49:20,551 INFO L290 TraceCheckUtils]: 87: Hoare triple {12364#(<= 5 ~counter~0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {12364#(<= 5 ~counter~0)} is VALID [2022-04-27 13:49:20,551 INFO L290 TraceCheckUtils]: 88: Hoare triple {12364#(<= 5 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12407#(<= 5 |main_#t~post6|)} is VALID [2022-04-27 13:49:20,551 INFO L290 TraceCheckUtils]: 89: Hoare triple {12407#(<= 5 |main_#t~post6|)} assume !!(#t~post6 < 5);havoc #t~post6; {12133#false} is VALID [2022-04-27 13:49:20,552 INFO L272 TraceCheckUtils]: 90: Hoare triple {12133#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {12133#false} is VALID [2022-04-27 13:49:20,552 INFO L290 TraceCheckUtils]: 91: Hoare triple {12133#false} ~cond := #in~cond; {12133#false} is VALID [2022-04-27 13:49:20,552 INFO L290 TraceCheckUtils]: 92: Hoare triple {12133#false} assume 0 == ~cond; {12133#false} is VALID [2022-04-27 13:49:20,552 INFO L290 TraceCheckUtils]: 93: Hoare triple {12133#false} assume !false; {12133#false} is VALID [2022-04-27 13:49:20,552 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 322 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-27 13:49:20,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:49:20,928 INFO L290 TraceCheckUtils]: 93: Hoare triple {12133#false} assume !false; {12133#false} is VALID [2022-04-27 13:49:20,928 INFO L290 TraceCheckUtils]: 92: Hoare triple {12133#false} assume 0 == ~cond; {12133#false} is VALID [2022-04-27 13:49:20,928 INFO L290 TraceCheckUtils]: 91: Hoare triple {12133#false} ~cond := #in~cond; {12133#false} is VALID [2022-04-27 13:49:20,929 INFO L272 TraceCheckUtils]: 90: Hoare triple {12133#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {12133#false} is VALID [2022-04-27 13:49:20,929 INFO L290 TraceCheckUtils]: 89: Hoare triple {12407#(<= 5 |main_#t~post6|)} assume !!(#t~post6 < 5);havoc #t~post6; {12133#false} is VALID [2022-04-27 13:49:20,929 INFO L290 TraceCheckUtils]: 88: Hoare triple {12364#(<= 5 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12407#(<= 5 |main_#t~post6|)} is VALID [2022-04-27 13:49:20,929 INFO L290 TraceCheckUtils]: 87: Hoare triple {12364#(<= 5 ~counter~0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {12364#(<= 5 ~counter~0)} is VALID [2022-04-27 13:49:20,930 INFO L290 TraceCheckUtils]: 86: Hoare triple {12364#(<= 5 ~counter~0)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {12364#(<= 5 ~counter~0)} is VALID [2022-04-27 13:49:20,930 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {12132#true} {12364#(<= 5 ~counter~0)} #86#return; {12364#(<= 5 ~counter~0)} is VALID [2022-04-27 13:49:20,930 INFO L290 TraceCheckUtils]: 84: Hoare triple {12132#true} assume true; {12132#true} is VALID [2022-04-27 13:49:20,930 INFO L290 TraceCheckUtils]: 83: Hoare triple {12132#true} assume !(0 == ~cond); {12132#true} is VALID [2022-04-27 13:49:20,930 INFO L290 TraceCheckUtils]: 82: Hoare triple {12132#true} ~cond := #in~cond; {12132#true} is VALID [2022-04-27 13:49:20,931 INFO L272 TraceCheckUtils]: 81: Hoare triple {12364#(<= 5 ~counter~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12132#true} is VALID [2022-04-27 13:49:20,931 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12132#true} {12364#(<= 5 ~counter~0)} #84#return; {12364#(<= 5 ~counter~0)} is VALID [2022-04-27 13:49:20,931 INFO L290 TraceCheckUtils]: 79: Hoare triple {12132#true} assume true; {12132#true} is VALID [2022-04-27 13:49:20,932 INFO L290 TraceCheckUtils]: 78: Hoare triple {12132#true} assume !(0 == ~cond); {12132#true} is VALID [2022-04-27 13:49:20,932 INFO L290 TraceCheckUtils]: 77: Hoare triple {12132#true} ~cond := #in~cond; {12132#true} is VALID [2022-04-27 13:49:20,932 INFO L272 TraceCheckUtils]: 76: Hoare triple {12364#(<= 5 ~counter~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {12132#true} is VALID [2022-04-27 13:49:20,932 INFO L290 TraceCheckUtils]: 75: Hoare triple {12364#(<= 5 ~counter~0)} assume !!(#t~post6 < 5);havoc #t~post6; {12364#(<= 5 ~counter~0)} is VALID [2022-04-27 13:49:20,933 INFO L290 TraceCheckUtils]: 74: Hoare triple {12321#(<= 4 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12364#(<= 5 ~counter~0)} is VALID [2022-04-27 13:49:20,933 INFO L290 TraceCheckUtils]: 73: Hoare triple {12321#(<= 4 ~counter~0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {12321#(<= 4 ~counter~0)} is VALID [2022-04-27 13:49:20,933 INFO L290 TraceCheckUtils]: 72: Hoare triple {12321#(<= 4 ~counter~0)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {12321#(<= 4 ~counter~0)} is VALID [2022-04-27 13:49:20,934 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12132#true} {12321#(<= 4 ~counter~0)} #86#return; {12321#(<= 4 ~counter~0)} is VALID [2022-04-27 13:49:20,934 INFO L290 TraceCheckUtils]: 70: Hoare triple {12132#true} assume true; {12132#true} is VALID [2022-04-27 13:49:20,934 INFO L290 TraceCheckUtils]: 69: Hoare triple {12132#true} assume !(0 == ~cond); {12132#true} is VALID [2022-04-27 13:49:20,934 INFO L290 TraceCheckUtils]: 68: Hoare triple {12132#true} ~cond := #in~cond; {12132#true} is VALID [2022-04-27 13:49:20,934 INFO L272 TraceCheckUtils]: 67: Hoare triple {12321#(<= 4 ~counter~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12132#true} is VALID [2022-04-27 13:49:20,935 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12132#true} {12321#(<= 4 ~counter~0)} #84#return; {12321#(<= 4 ~counter~0)} is VALID [2022-04-27 13:49:20,935 INFO L290 TraceCheckUtils]: 65: Hoare triple {12132#true} assume true; {12132#true} is VALID [2022-04-27 13:49:20,935 INFO L290 TraceCheckUtils]: 64: Hoare triple {12132#true} assume !(0 == ~cond); {12132#true} is VALID [2022-04-27 13:49:20,935 INFO L290 TraceCheckUtils]: 63: Hoare triple {12132#true} ~cond := #in~cond; {12132#true} is VALID [2022-04-27 13:49:20,935 INFO L272 TraceCheckUtils]: 62: Hoare triple {12321#(<= 4 ~counter~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {12132#true} is VALID [2022-04-27 13:49:20,935 INFO L290 TraceCheckUtils]: 61: Hoare triple {12321#(<= 4 ~counter~0)} assume !!(#t~post6 < 5);havoc #t~post6; {12321#(<= 4 ~counter~0)} is VALID [2022-04-27 13:49:20,936 INFO L290 TraceCheckUtils]: 60: Hoare triple {12266#(<= 3 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12321#(<= 4 ~counter~0)} is VALID [2022-04-27 13:49:20,936 INFO L290 TraceCheckUtils]: 59: Hoare triple {12266#(<= 3 ~counter~0)} assume !(~r~0 >= ~d~0); {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,939 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12132#true} {12266#(<= 3 ~counter~0)} #82#return; {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,939 INFO L290 TraceCheckUtils]: 57: Hoare triple {12132#true} assume true; {12132#true} is VALID [2022-04-27 13:49:20,939 INFO L290 TraceCheckUtils]: 56: Hoare triple {12132#true} assume !(0 == ~cond); {12132#true} is VALID [2022-04-27 13:49:20,939 INFO L290 TraceCheckUtils]: 55: Hoare triple {12132#true} ~cond := #in~cond; {12132#true} is VALID [2022-04-27 13:49:20,939 INFO L272 TraceCheckUtils]: 54: Hoare triple {12266#(<= 3 ~counter~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12132#true} is VALID [2022-04-27 13:49:20,939 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {12132#true} {12266#(<= 3 ~counter~0)} #80#return; {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,939 INFO L290 TraceCheckUtils]: 52: Hoare triple {12132#true} assume true; {12132#true} is VALID [2022-04-27 13:49:20,939 INFO L290 TraceCheckUtils]: 51: Hoare triple {12132#true} assume !(0 == ~cond); {12132#true} is VALID [2022-04-27 13:49:20,940 INFO L290 TraceCheckUtils]: 50: Hoare triple {12132#true} ~cond := #in~cond; {12132#true} is VALID [2022-04-27 13:49:20,940 INFO L272 TraceCheckUtils]: 49: Hoare triple {12266#(<= 3 ~counter~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12132#true} is VALID [2022-04-27 13:49:20,940 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12132#true} {12266#(<= 3 ~counter~0)} #78#return; {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,940 INFO L290 TraceCheckUtils]: 47: Hoare triple {12132#true} assume true; {12132#true} is VALID [2022-04-27 13:49:20,940 INFO L290 TraceCheckUtils]: 46: Hoare triple {12132#true} assume !(0 == ~cond); {12132#true} is VALID [2022-04-27 13:49:20,940 INFO L290 TraceCheckUtils]: 45: Hoare triple {12132#true} ~cond := #in~cond; {12132#true} is VALID [2022-04-27 13:49:20,940 INFO L272 TraceCheckUtils]: 44: Hoare triple {12266#(<= 3 ~counter~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12132#true} is VALID [2022-04-27 13:49:20,941 INFO L290 TraceCheckUtils]: 43: Hoare triple {12266#(<= 3 ~counter~0)} assume !!(#t~post5 < 5);havoc #t~post5; {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,941 INFO L290 TraceCheckUtils]: 42: Hoare triple {12211#(<= 2 ~counter~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12266#(<= 3 ~counter~0)} is VALID [2022-04-27 13:49:20,942 INFO L290 TraceCheckUtils]: 41: Hoare triple {12211#(<= 2 ~counter~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,942 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12132#true} {12211#(<= 2 ~counter~0)} #82#return; {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,942 INFO L290 TraceCheckUtils]: 39: Hoare triple {12132#true} assume true; {12132#true} is VALID [2022-04-27 13:49:20,943 INFO L290 TraceCheckUtils]: 38: Hoare triple {12132#true} assume !(0 == ~cond); {12132#true} is VALID [2022-04-27 13:49:20,943 INFO L290 TraceCheckUtils]: 37: Hoare triple {12132#true} ~cond := #in~cond; {12132#true} is VALID [2022-04-27 13:49:20,943 INFO L272 TraceCheckUtils]: 36: Hoare triple {12211#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12132#true} is VALID [2022-04-27 13:49:20,943 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {12132#true} {12211#(<= 2 ~counter~0)} #80#return; {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,943 INFO L290 TraceCheckUtils]: 34: Hoare triple {12132#true} assume true; {12132#true} is VALID [2022-04-27 13:49:20,943 INFO L290 TraceCheckUtils]: 33: Hoare triple {12132#true} assume !(0 == ~cond); {12132#true} is VALID [2022-04-27 13:49:20,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {12132#true} ~cond := #in~cond; {12132#true} is VALID [2022-04-27 13:49:20,943 INFO L272 TraceCheckUtils]: 31: Hoare triple {12211#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12132#true} is VALID [2022-04-27 13:49:20,944 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {12132#true} {12211#(<= 2 ~counter~0)} #78#return; {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,944 INFO L290 TraceCheckUtils]: 29: Hoare triple {12132#true} assume true; {12132#true} is VALID [2022-04-27 13:49:20,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {12132#true} assume !(0 == ~cond); {12132#true} is VALID [2022-04-27 13:49:20,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {12132#true} ~cond := #in~cond; {12132#true} is VALID [2022-04-27 13:49:20,944 INFO L272 TraceCheckUtils]: 26: Hoare triple {12211#(<= 2 ~counter~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12132#true} is VALID [2022-04-27 13:49:20,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {12211#(<= 2 ~counter~0)} assume !!(#t~post5 < 5);havoc #t~post5; {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {12156#(<= 1 ~counter~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12211#(<= 2 ~counter~0)} is VALID [2022-04-27 13:49:20,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {12156#(<= 1 ~counter~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,946 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12132#true} {12156#(<= 1 ~counter~0)} #82#return; {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {12132#true} assume true; {12132#true} is VALID [2022-04-27 13:49:20,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {12132#true} assume !(0 == ~cond); {12132#true} is VALID [2022-04-27 13:49:20,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {12132#true} ~cond := #in~cond; {12132#true} is VALID [2022-04-27 13:49:20,946 INFO L272 TraceCheckUtils]: 18: Hoare triple {12156#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12132#true} is VALID [2022-04-27 13:49:20,946 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12132#true} {12156#(<= 1 ~counter~0)} #80#return; {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {12132#true} assume true; {12132#true} is VALID [2022-04-27 13:49:20,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {12132#true} assume !(0 == ~cond); {12132#true} is VALID [2022-04-27 13:49:20,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {12132#true} ~cond := #in~cond; {12132#true} is VALID [2022-04-27 13:49:20,947 INFO L272 TraceCheckUtils]: 13: Hoare triple {12156#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12132#true} is VALID [2022-04-27 13:49:20,947 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12132#true} {12156#(<= 1 ~counter~0)} #78#return; {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {12132#true} assume true; {12132#true} is VALID [2022-04-27 13:49:20,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {12132#true} assume !(0 == ~cond); {12132#true} is VALID [2022-04-27 13:49:20,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {12132#true} ~cond := #in~cond; {12132#true} is VALID [2022-04-27 13:49:20,947 INFO L272 TraceCheckUtils]: 8: Hoare triple {12156#(<= 1 ~counter~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12132#true} is VALID [2022-04-27 13:49:20,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {12156#(<= 1 ~counter~0)} assume !!(#t~post5 < 5);havoc #t~post5; {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {12140#(<= 0 ~counter~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12156#(<= 1 ~counter~0)} is VALID [2022-04-27 13:49:20,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {12140#(<= 0 ~counter~0)} 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; {12140#(<= 0 ~counter~0)} is VALID [2022-04-27 13:49:20,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {12140#(<= 0 ~counter~0)} call #t~ret7 := main(); {12140#(<= 0 ~counter~0)} is VALID [2022-04-27 13:49:20,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12140#(<= 0 ~counter~0)} {12132#true} #92#return; {12140#(<= 0 ~counter~0)} is VALID [2022-04-27 13:49:20,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {12140#(<= 0 ~counter~0)} assume true; {12140#(<= 0 ~counter~0)} is VALID [2022-04-27 13:49:20,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {12132#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);~counter~0 := 0; {12140#(<= 0 ~counter~0)} is VALID [2022-04-27 13:49:20,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {12132#true} call ULTIMATE.init(); {12132#true} is VALID [2022-04-27 13:49:20,950 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-27 13:49:20,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:49:20,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756862684] [2022-04-27 13:49:20,951 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:49:20,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830327562] [2022-04-27 13:49:20,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830327562] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:49:20,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:49:20,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2022-04-27 13:49:20,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616066452] [2022-04-27 13:49:20,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:49:20,952 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 8 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) Word has length 94 [2022-04-27 13:49:21,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:49:21,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 8 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) [2022-04-27 13:49:21,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:49:21,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:49:21,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:49:21,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:49:21,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:49:21,154 INFO L87 Difference]: Start difference. First operand 206 states and 258 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 8 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) [2022-04-27 13:49:21,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:21,573 INFO L93 Difference]: Finished difference Result 245 states and 299 transitions. [2022-04-27 13:49:21,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 13:49:21,573 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 8 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) Word has length 94 [2022-04-27 13:49:21,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:49:21,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 8 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) [2022-04-27 13:49:21,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2022-04-27 13:49:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 8 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) [2022-04-27 13:49:21,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2022-04-27 13:49:21,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 116 transitions. [2022-04-27 13:49:21,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:49:21,671 INFO L225 Difference]: With dead ends: 245 [2022-04-27 13:49:21,672 INFO L226 Difference]: Without dead ends: 165 [2022-04-27 13:49:21,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:49:21,672 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 38 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:49:21,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 227 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:49:21,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-27 13:49:21,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 152. [2022-04-27 13:49:21,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:49:21,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 152 states, 102 states have (on average 1.0784313725490196) internal successors, (110), 105 states have internal predecessors, (110), 27 states have call successors, (27), 23 states have call predecessors, (27), 22 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 13:49:21,780 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 152 states, 102 states have (on average 1.0784313725490196) internal successors, (110), 105 states have internal predecessors, (110), 27 states have call successors, (27), 23 states have call predecessors, (27), 22 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 13:49:21,780 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 152 states, 102 states have (on average 1.0784313725490196) internal successors, (110), 105 states have internal predecessors, (110), 27 states have call successors, (27), 23 states have call predecessors, (27), 22 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 13:49:21,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:21,783 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2022-04-27 13:49:21,783 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 177 transitions. [2022-04-27 13:49:21,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:21,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:21,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 102 states have (on average 1.0784313725490196) internal successors, (110), 105 states have internal predecessors, (110), 27 states have call successors, (27), 23 states have call predecessors, (27), 22 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 165 states. [2022-04-27 13:49:21,785 INFO L87 Difference]: Start difference. First operand has 152 states, 102 states have (on average 1.0784313725490196) internal successors, (110), 105 states have internal predecessors, (110), 27 states have call successors, (27), 23 states have call predecessors, (27), 22 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 165 states. [2022-04-27 13:49:21,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:21,788 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2022-04-27 13:49:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 177 transitions. [2022-04-27 13:49:21,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:21,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:21,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:49:21,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:49:21,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 102 states have (on average 1.0784313725490196) internal successors, (110), 105 states have internal predecessors, (110), 27 states have call successors, (27), 23 states have call predecessors, (27), 22 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 13:49:21,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2022-04-27 13:49:21,793 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 94 [2022-04-27 13:49:21,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:49:21,793 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2022-04-27 13:49:21,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 8 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) [2022-04-27 13:49:21,793 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2022-04-27 13:49:21,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-27 13:49:21,794 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:49:21,794 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:49:21,814 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-27 13:49:22,003 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,SelfDestructingSolverStorable15 [2022-04-27 13:49:22,004 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:49:22,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:49:22,004 INFO L85 PathProgramCache]: Analyzing trace with hash 410341376, now seen corresponding path program 2 times [2022-04-27 13:49:22,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:49:22,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016021644] [2022-04-27 13:49:22,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:49:22,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:49:22,017 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:49:22,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1653290443] [2022-04-27 13:49:22,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:49:22,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:49:22,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:49:22,019 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:49:22,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 13:49:22,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:49:22,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-27 13:49:22,073 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 13:49:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 13:49:22,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 13:49:22,128 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 13:49:22,129 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:49:22,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-27 13:49:22,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-27 13:49:22,359 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:49:22,363 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:49:22,445 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:49:22,445 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 13:49:22,445 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:49:22,445 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:49:22,445 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 13:49:22,445 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 13:49:22,445 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 13:49:22,445 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:49:22,445 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:49:22,445 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:49:22,445 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:49:22,446 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:49:22,447 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:49:22,447 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:49:22,447 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:49:22,447 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-27 13:49:22,447 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-27 13:49:22,447 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 13:49:22,447 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 13:49:22,447 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:49:22,447 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:49:22,447 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 13:49:22,447 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 13:49:22,447 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 13:49:22,447 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 13:49:22,447 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2022-04-27 13:49:22,447 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2022-04-27 13:49:22,447 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 13:49:22,447 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 13:49:22,447 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-27 13:49:22,447 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 13:49:22,447 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 13:49:22,447 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:49:22,447 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:49:22,447 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 13:49:22,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:49:22 BoogieIcfgContainer [2022-04-27 13:49:22,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:49:22,449 INFO L158 Benchmark]: Toolchain (without parser) took 126485.32ms. Allocated memory was 177.2MB in the beginning and 217.1MB in the end (delta: 39.8MB). Free memory was 130.0MB in the beginning and 98.8MB in the end (delta: 31.2MB). Peak memory consumption was 71.4MB. Max. memory is 8.0GB. [2022-04-27 13:49:22,449 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 177.2MB. Free memory is still 146.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:49:22,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.93ms. Allocated memory is still 177.2MB. Free memory was 129.8MB in the beginning and 154.8MB in the end (delta: -25.1MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. [2022-04-27 13:49:22,450 INFO L158 Benchmark]: Boogie Preprocessor took 22.53ms. Allocated memory is still 177.2MB. Free memory was 154.8MB in the beginning and 153.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 13:49:22,450 INFO L158 Benchmark]: RCFGBuilder took 319.52ms. Allocated memory is still 177.2MB. Free memory was 153.2MB in the beginning and 141.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 13:49:22,450 INFO L158 Benchmark]: TraceAbstraction took 125926.02ms. Allocated memory was 177.2MB in the beginning and 217.1MB in the end (delta: 39.8MB). Free memory was 140.7MB in the beginning and 98.8MB in the end (delta: 41.9MB). Peak memory consumption was 82.7MB. Max. memory is 8.0GB. [2022-04-27 13:49:22,451 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 177.2MB. Free memory is still 146.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 210.93ms. Allocated memory is still 177.2MB. Free memory was 129.8MB in the beginning and 154.8MB in the end (delta: -25.1MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.53ms. Allocated memory is still 177.2MB. Free memory was 154.8MB in the beginning and 153.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 319.52ms. Allocated memory is still 177.2MB. Free memory was 153.2MB in the beginning and 141.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 125926.02ms. Allocated memory was 177.2MB in the beginning and 217.1MB in the end (delta: 39.8MB). Free memory was 140.7MB in the beginning and 98.8MB in the end (delta: 41.9MB). Peak memory consumption was 82.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=11, counter=0] [L24] int A, B; [L25] int r, d, p, q; [L26] A = __VERIFIER_nondet_int() [L27] B = 1 [L29] r = A [L30] d = B [L31] p = 1 [L32] q = 0 VAL [\old(counter)=0, A=7, B=1, counter=0, d=1, p=1, q=0, r=7] [L34] EXPR counter++ VAL [\old(counter)=0, A=7, B=1, counter=1, counter++=0, d=1, p=1, q=0, r=7] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(q == 0) VAL [\old(counter)=0, A=7, B=1, counter=1, d=1, p=1, q=0, r=7] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(r == A) VAL [\old(counter)=0, A=7, B=1, counter=1, d=1, p=1, q=0, r=7] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(d == B * p) VAL [\old(counter)=0, A=7, B=1, counter=1, d=1, p=1, q=0, r=7] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [\old(counter)=0, A=7, B=1, counter=1, d=2, p=2, q=0, r=7] [L34] EXPR counter++ VAL [\old(counter)=0, A=7, B=1, counter=2, counter++=1, d=2, p=2, q=0, r=7] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(q == 0) VAL [\old(counter)=0, A=7, B=1, counter=2, d=2, p=2, q=0, r=7] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(r == A) VAL [\old(counter)=0, A=7, B=1, counter=2, d=2, p=2, q=0, r=7] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(d == B * p) VAL [\old(counter)=0, A=7, B=1, counter=2, d=2, p=2, q=0, r=7] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [\old(counter)=0, A=7, B=1, counter=2, d=4, p=4, q=0, r=7] [L34] EXPR counter++ VAL [\old(counter)=0, A=7, B=1, counter=3, counter++=2, d=4, p=4, q=0, r=7] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(q == 0) VAL [\old(counter)=0, A=7, B=1, counter=3, d=4, p=4, q=0, r=7] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L36] RET __VERIFIER_assert(r == A) VAL [\old(counter)=0, A=7, B=1, counter=3, d=4, p=4, q=0, r=7] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(d == B * p) VAL [\old(counter)=0, A=7, B=1, counter=3, d=4, p=4, q=0, r=7] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [\old(counter)=0, A=7, B=1, counter=3, d=8, p=8, q=0, r=7] [L34] EXPR counter++ VAL [\old(counter)=0, A=7, B=1, counter=4, counter++=3, d=8, p=8, q=0, r=7] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(q == 0) VAL [\old(counter)=0, A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L36] RET __VERIFIER_assert(r == A) VAL [\old(counter)=0, A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(d == B * p) VAL [\old(counter)=0, A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L38] COND TRUE !(r >= d) VAL [\old(counter)=0, A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L44] EXPR counter++ VAL [\old(counter)=0, A=7, B=1, counter=5, counter++=4, d=8, p=8, q=0, r=7] [L44] COND TRUE counter++<5 [L45] CALL __VERIFIER_assert(A == q*B + r) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L45] RET __VERIFIER_assert(A == q*B + r) VAL [\old(counter)=0, A=7, B=1, counter=5, d=8, p=8, q=0, r=7] [L46] CALL __VERIFIER_assert(d == B*p) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L46] RET __VERIFIER_assert(d == B*p) VAL [\old(counter)=0, A=7, B=1, counter=5, d=8, p=8, q=0, r=7] [L48] COND FALSE !(!(p != 1)) [L50] d = d / 2 [L51] p = p / 2 VAL [\old(counter)=0, A=7, B=1, counter=5, d=4, p=4, q=0, r=7] [L52] COND TRUE r >= d [L53] r = r - d [L54] q = q + p VAL [\old(counter)=0, A=7, B=1, counter=5, d=4, p=4, q=4, r=3] [L44] EXPR counter++ VAL [\old(counter)=0, A=7, B=1, counter=6, counter++=5, d=4, p=4, q=4, r=3] [L44] COND FALSE !(counter++<5) [L58] CALL __VERIFIER_assert(A == d*q + r) VAL [\old(cond)=0, \old(counter)=0, counter=6] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=6] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 125.8s, OverallIterations: 17, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 67.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 514 SdHoareTripleChecker+Valid, 20.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 450 mSDsluCounter, 2472 SdHoareTripleChecker+Invalid, 20.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1 IncrementalHoareTripleChecker+Unchecked, 1718 mSDsCounter, 369 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2357 IncrementalHoareTripleChecker+Invalid, 2729 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 369 mSolverCounterUnsat, 754 mSDtfsCounter, 2357 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1303 GetRequests, 1163 SyntacticMatches, 12 SemanticMatches, 128 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 18.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=11, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 127 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 51.7s InterpolantComputationTime, 861 NumberOfCodeBlocks, 861 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1283 ConstructedInterpolants, 0 QuantifiedInterpolants, 17951 SizeOfPredicates, 33 NumberOfNonLiveVariables, 2039 ConjunctsInSsa, 183 ConjunctsInUnsatCore, 24 InterpolantComputations, 9 PerfectInterpolantSequences, 3212/3666 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 13:49:22,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...